Lower bounds on the efficiency of encryption and digital signature schemes
From MaRDI portal
Publication:3581302
DOI10.1145/780542.780604zbMath1192.94095OpenAlexW2025126575MaRDI QIDQ3581302
Rosario Gennaro, Yael Gertner, Jonathan N. Katz
Publication date: 16 August 2010
Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/780542.780604
Related Items (8)
Computational hardness of optimal fair computation: beyond Minicrypt ⋮ On the impossibility of algebraic vector commitments in pairing-free groups ⋮ On the impossibility of algebraic NIZK in pairing-free groups ⋮ On derandomizing Yao's weak-to-strong OWF construction ⋮ A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval ⋮ Efficiency Bounds for Adversary Constructions in Black-Box Reductions ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing
This page was built for publication: Lower bounds on the efficiency of encryption and digital signature schemes
