Limits of provable security from standard assumptions
From MaRDI portal
Publication:5419080
DOI10.1145/1993636.1993652zbMath1288.94080OpenAlexW2067109782MaRDI QIDQ5419080
Publication date: 5 June 2014
Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1993636.1993652
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (17)
On the security loss of unique signatures ⋮ Towards Non-Black-Box Separations of Public Key Encryption and One Way Function ⋮ Unprovable security of perfect NIZK and non-interactive non-malleable commitments ⋮ The One-More Discrete Logarithm Assumption in the Generic Group Model ⋮ Non-interactive blind signatures for random messages ⋮ Rai-Choo! Evolving blind signatures to the next level ⋮ The hunting of the SNARK ⋮ Individual simulations ⋮ On the adaptive security of MACs and PRFs ⋮ Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives ⋮ Lower Bounds on Assumptions Behind Indistinguishability Obfuscation ⋮ Constructing tree decompositions of graphs with bounded gonality ⋮ Round-optimal blind signatures in the plain model from classical and quantum standard assumptions ⋮ Impossibility on tamper-resilient cryptography with uniqueness properties ⋮ On selective-opening security of deterministic primitives ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing ⋮ Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
This page was built for publication: Limits of provable security from standard assumptions
