On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives
From MaRDI portal
Publication:4412792
DOI10.1007/3-540-36178-2_7zbMath1065.94542OpenAlexW2138492701MaRDI QIDQ4412792
Yan-Cheng Chang, Chun-Yuan Hsiao, Chi-Jen Lu
Publication date: 16 July 2003
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-36178-2_7
cryptographic primitivesdigital signaturepublic-key encryptionprivate-key encryptionpseudo-random generatortrapdoor functionsblack-box reductionsone-way permutations
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Random number generation in numerical analysis (65C10)
Related Items (2)
Limits on the usefulness of random oracles ⋮ Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
This page was built for publication: On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives