Black-Box Separations for One-More (Static) CDH and Its Generalization

DOI10.1007/978-3-662-45608-8_20zbMATH Open1317.94137OpenAlexW171577188MaRDI QIDQ2936619FDOQ2936619

Yu Chen, Zongyang Zhang, Jiang Zhang, Yanfei Guo, Zhenfeng Zhang

Publication date: 6 January 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-45608-8_20

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited In (5)

• \textsc{OneMax} in black-box models with several restrictions
• New limits of provable security and applications to ElGamal encryption
• Impossibility on tamper-resilient cryptography with uniqueness properties
• Black-Box Separations and Their Adaptability to the Non-uniform Model
• Black-box use of one-way functions is useless for optimal fair coin-tossing

This page was built for publication: Black-Box Separations for One-More (Static) CDH and Its Generalization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936619)