Black-Box Separations for One-More (Static) CDH and Its Generalization
From MaRDI portal
Publication:2936619
DOI10.1007/978-3-662-45608-8_20zbMath1317.94137OpenAlexW171577188MaRDI QIDQ2936619
Yu Chen, Jiang Zhang, Yanfei Guo, Zhenfeng Zhang, Zong-yang 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
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
Impossibility on tamper-resilient cryptography with uniqueness properties ⋮ 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