Black-box separations for one-more (static) CDH and its generalization

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

Authors: Jiang Zhang, Zhenfeng Zhang, Yu Chen, Yanfei Guo, Zongyang 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

Recommendations

• Separation Results on the “One-More” Computational Problems
• Another look at non-standard discrete log and Diffie-Hellman problems
• Black-box reductions and separations in cryptography
• Limits of provable security from standard assumptions
• Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups

Mathematics Subject Classification ID

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

Cited In (6)

• \textsc{OneMax} in black-box models with several restrictions
• Separation Results on the “One-More” Computational Problems
• 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)