Image de couverture de livre

Unifying computational entropies via Kullback-Leibler divergence

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Agrawal, Rohit, Chen, Yi-Hsiu, Horel, Thibaut, Vadhan, Salil
Format:	Preprint
Publié:	2019
Sujets:	Cryptography and Security Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Generalized and Unified Equivalences between Hardness and Pseudoentropy
par: Hu, Lunjia, et autres
Publié: (2025)

Characterizing the Distinguishability of Product Distributions through Multicalibration
par: Marcussen, Cassandra, et autres
Publié: (2024)

Lattice Based Crypto breaks in a Superposition of Spacetimes
par: Aggarwal, Divesh, et autres
Publié: (2025)

Jeffrey's update rule as a minimizer of Kullback-Leibler divergence
par: Pinzón, Carlos, et autres
Publié: (2025)

A Framework for Differential Privacy Against Timing Attacks
par: Ratliff, Zachary, et autres
Publié: (2024)

Securing Unbounded Differential Privacy Against Timing Attacks
par: Ratliff, Zachary, et autres
Publié: (2025)

Hardness of Quantum Distribution Learning and Quantum Cryptography
par: Hiroka, Taiga, et autres
Publié: (2025)

Analyzing the Differentially Private Theil-Sen Estimator for Simple Linear Regression
par: Sarathy, Jayshree, et autres
Publié: (2022)

Cryptographic Conditions for Efficient Testing of Distributions and Quantum States
par: Cavalar, Bruno, et autres
Publié: (2025)

Improved Round-by-round Soundness IOPs via Reed-Muller Codes
par: Minzer, Dor, et autres
Publié: (2025)

Efficient and Privacy-Preserving Binary Dot Product via Multi-Party Computation
par: Dehkordi, Fatemeh Jafarian, et autres
Publié: (2025)

Practitioners' Perspectives on a Differential Privacy Deployment Registry
par: Nanayakkara, Priyanka, et autres
Publié: (2025)

Membership Inference Attacks and Privacy in Topic Modeling
par: Manzonelli, Nico, et autres
Publié: (2024)

More Efficient $k$-wise Independent Permutations from Random Reversible Circuits via log-Sobolev Inequalities
par: Gretta, Lucas, et autres
Publié: (2024)

Privacy-preserving formal concept analysis: A homomorphic encryption-based concept construction
par: Chen, Qiangqiang, et autres
Publié: (2025)

Optimally Blending Honeypots into Production Networks: Hardness and Algorithms
par: Zaman, Md Mahabub Uz, et autres
Publié: (2024)

Computational relative entropy
par: Meyer, Johannes Jakob, et autres
Publié: (2025)

Inapproximability of Finding Sparse Vectors in Codes, Subspaces, and Lattices
par: Bhattiprolu, Vijay, et autres
Publié: (2024)

New constructions of pseudorandom codes
par: Ghentiyala, Surendra, et autres
Publié: (2024)

Leakage-Resilient Extractors against Number-on-Forehead Protocols
par: Chattopadhyay, Eshan, et autres
Publié: (2025)

Efficient derandomization of differentially private counting queries
par: Ghentiyala, Surendra
Publié: (2025)

Hardness Amplification for (Sparse) LPN
par: Aggarwal, Divesh, et autres
Publié: (2026)

Hardness of Range Avoidance and Proof Complexity Generators from Demi-Bits
par: Ren, Hanlin, et autres
Publié: (2025)

Differentially Private Compression and the Sensitivity of LZ77
par: Blocki, Jeremiah, et autres
Publié: (2025)

Deterministic Hardness of Approximation of Unique-SVP and GapSVP in $\ell_p$ norms for $p>2$
par: Hecht, Yahli, et autres
Publié: (2025)

A Survey on the Applications of Zero-Knowledge Proofs
par: Lavin, Ryan, et autres
Publié: (2024)

Privacy-Preserving Hamming Distance Computation with Property-Preserving Hashing
par: Zhao, Dongfang
Publié: (2025)

Vulnerability Abundance: A formal proof of infinite vulnerabilities in code
par: Leverett, Eireann, et autres
Publié: (2026)

How to Verify Any (Reasonable) Distribution Property: Computationally Sound Argument Systems for Distributions
par: Herman, Tal, et autres
Publié: (2024)

Efficiently Batching Unambiguous Interactive Proofs
par: Berger, Bonnie, et autres
Publié: (2025)

On the Classical Hardness of the Semidirect Discrete Logarithm Problem in Finite Groups
par: Arif, Mohammad Ferry Husnil, et autres
Publié: (2025)

NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam
par: Otsuji, Taisei, et autres
Publié: (2026)

NP-Completeness and Physical Zero-Knowledge Proofs for Zeiger
par: Ruangwises, Suthee
Publié: (2024)

Black-Box Crypto is Useless for Pseudorandom Codes
par: Garg, Sanjam, et autres
Publié: (2025)

Interactive Oracle Proofs of Proximity to Codes on Graphs
par: Delavenne, Hugo, et autres
Publié: (2025)

Faster Mixing of Higher-Dimensional Random Reversible Circuits
par: Gay, William, et autres
Publié: (2024)

A Zero-Knowledge PCP Theorem
par: Gur, Tom, et autres
Publié: (2024)

Fast computational deep thermalization
par: Chakraborty, Shantanav, et autres
Publié: (2025)

The computational two-way quantum capacity
par: Meyer, Johannes Jakob, et autres
Publié: (2026)

NISQ Security and Complexity via Simple Classical Reasoning
par: Cojocaru, Alexandru, et autres
Publié: (2025)