On Cryptographic Assumptions and Challenges

2003/01/01 by Moni Naor · 2 citations
Computer Science · Mathematics · #Algorithm #Block (permutation group theory) #Block cipher #Coding theory and cryptography #Computational complexity theory #Computer science #Computer security #Cryptographic Implementations and Security #Cryptographic primitive #Cryptographic protocol #Cryptography #Cryptography and Data Security #Information retrieval #Mathematics #Theoretical computer science #sort

paper · doi:10.1007/978-3-540-45146-4_6

crossref issued 2003/01/01 · crossref published 2003/01/01 · crossref published-print 2003/01/01 · openalex publication_date 2003/01/01 · crossref created 2010/06/22 · crossref deposited 2019/05/30 · openalex created_date 2025/10/10 · crossref indexed 2026/07/15 · openalex updated_date 2026/08/04

Citations

• A Pseudorandom Generator from any One-way Function
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• How to Leak a Secret
• Signature schemes based on the strong RSA assumption
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• A method for obtaining digital signatures and public-key cryptosystems

Cited by

• Cryptographic Assumptions: A Position Paper
• Computational hardness assumption [wikipedia]