Cover Image

Characterizing the Distinguishability of Product Distributions through Multicalibration

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Marcussen, Cassandra, Putterman, Aaron, Vadhan, Salil
Format:	Preprint
Published:	2024
Subjects:	Cryptography and Security Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Generalized and Unified Equivalences between Hardness and Pseudoentropy
by: Hu, Lunjia, et al.
Published: (2025)

Unifying computational entropies via Kullback-Leibler divergence
by: Agrawal, Rohit, et al.
Published: (2019)

Complexity-Theoretic Implications of Multicalibration
by: Casacuberta, Sílvia, et al.
Published: (2023)

Bounded Independence Edge Sampling for Combinatorial Graph Properties
by: Putterman, Aaron, et al.
Published: (2026)

A Framework for Differential Privacy Against Timing Attacks
by: Ratliff, Zachary, et al.
Published: (2024)

Securing Unbounded Differential Privacy Against Timing Attacks
by: Ratliff, Zachary, et al.
Published: (2025)

How to Verify Any (Reasonable) Distribution Property: Computationally Sound Argument Systems for Distributions
by: Herman, Tal, et al.
Published: (2024)

Analyzing the Differentially Private Theil-Sen Estimator for Simple Linear Regression
by: Sarathy, Jayshree, et al.
Published: (2022)

Optimally Blending Honeypots into Production Networks: Hardness and Algorithms
by: Zaman, Md Mahabub Uz, et al.
Published: (2024)

Efficient and Privacy-Preserving Binary Dot Product via Multi-Party Computation
by: Dehkordi, Fatemeh Jafarian, et al.
Published: (2025)

Practitioners' Perspectives on a Differential Privacy Deployment Registry
by: Nanayakkara, Priyanka, et al.
Published: (2025)

Membership Inference Attacks and Privacy in Topic Modeling
by: Manzonelli, Nico, et al.
Published: (2024)

A Meta-Complexity Characterization of Quantum Cryptography
by: Cavalar, Bruno P., et al.
Published: (2024)

Inapproximability of Finding Sparse Vectors in Codes, Subspaces, and Lattices
by: Bhattiprolu, Vijay, et al.
Published: (2024)

New constructions of pseudorandom codes
by: Ghentiyala, Surendra, et al.
Published: (2024)

A Survey on the Applications of Zero-Knowledge Proofs
by: Lavin, Ryan, et al.
Published: (2024)

More Efficient $k$-wise Independent Permutations from Random Reversible Circuits via log-Sobolev Inequalities
by: Gretta, Lucas, et al.
Published: (2024)

NP-Completeness and Physical Zero-Knowledge Proofs for Zeiger
by: Ruangwises, Suthee
Published: (2024)

Faster Mixing of Higher-Dimensional Random Reversible Circuits
by: Gay, William, et al.
Published: (2024)

A Zero-Knowledge PCP Theorem
by: Gur, Tom, et al.
Published: (2024)

Leakage-Resilient Extractors against Number-on-Forehead Protocols
by: Chattopadhyay, Eshan, et al.
Published: (2025)

Efficient derandomization of differentially private counting queries
by: Ghentiyala, Surendra
Published: (2025)

Hardness Amplification for (Sparse) LPN
by: Aggarwal, Divesh, et al.
Published: (2026)

Hardness of Range Avoidance and Proof Complexity Generators from Demi-Bits
by: Ren, Hanlin, et al.
Published: (2025)

Differentially Private Compression and the Sensitivity of LZ77
by: Blocki, Jeremiah, et al.
Published: (2025)

Deterministic Hardness of Approximation of Unique-SVP and GapSVP in $\ell_p$ norms for $p>2$
by: Hecht, Yahli, et al.
Published: (2025)

Privacy-Preserving Hamming Distance Computation with Property-Preserving Hashing
by: Zhao, Dongfang
Published: (2025)

Vulnerability Abundance: A formal proof of infinite vulnerabilities in code
by: Leverett, Eireann, et al.
Published: (2026)

Lattice Based Crypto breaks in a Superposition of Spacetimes
by: Aggarwal, Divesh, et al.
Published: (2025)

Privacy-preserving formal concept analysis: A homomorphic encryption-based concept construction
by: Chen, Qiangqiang, et al.
Published: (2025)

Efficiently Batching Unambiguous Interactive Proofs
by: Berger, Bonnie, et al.
Published: (2025)

On the Classical Hardness of the Semidirect Discrete Logarithm Problem in Finite Groups
by: Arif, Mohammad Ferry Husnil, et al.
Published: (2025)

NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam
by: Otsuji, Taisei, et al.
Published: (2026)

Improved Round-by-round Soundness IOPs via Reed-Muller Codes
by: Minzer, Dor, et al.
Published: (2025)

Black-Box Crypto is Useless for Pseudorandom Codes
by: Garg, Sanjam, et al.
Published: (2025)

Interactive Oracle Proofs of Proximity to Codes on Graphs
by: Delavenne, Hugo, et al.
Published: (2025)

Hardness of Quantum Distribution Learning and Quantum Cryptography
by: Hiroka, Taiga, et al.
Published: (2025)

Cryptographic Conditions for Efficient Testing of Distributions and Quantum States
by: Cavalar, Bruno, et al.
Published: (2025)

Programming Frameworks for Differential Privacy
by: Gaboardi, Marco, et al.
Published: (2024)

Pseudorandom Permutations from Random Reversible Circuits
by: He, William, et al.
Published: (2024)