Towards non-black-box lower bounds in cryptography

DOI10.1007/978-3-642-19571-6_35zbMATH Open1290.94117OpenAlexW1784943930MaRDI QIDQ3000565FDOQ3000565

Authors: Rafael Pass, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam 

Publication date: 19 May 2011

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19571-6_35

Recommendations

• Bounds on the Efficiency of Generic Cryptographic Constructions
• Theory of Cryptography
• The curious case of non-interactive commitments -- on the power of black-box vs. non-black-box use of primitives
• Theory of Cryptography
• Bounds on the efficiency of black-box commitment schemes

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (11)

• On constructing one-way permutations from indistinguishability obfuscation
• Theory of Cryptography
• Adaptive One-Way Functions and Applications
• On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model
• Bounds on the Efficiency of Generic Cryptographic Constructions
• On Constructing One-Way Permutations from Indistinguishability Obfuscation
• Towards Non-Black-Box Separations of Public Key Encryption and One Way Function
• Unprovable security of perfect NIZK and non-interactive non-malleable commitments
• Lower bounds on the degree of block ciphers
• Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
• Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?

This page was built for publication: Towards non-black-box lower bounds in cryptography

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