Provable security for public key schemes

MaRDI QIDQ5489061zbMATH OpenFDO

Authors David Pointcheval

Publication date 25 September 2006

zbMATH Keywords

digital signaturesrandom-oracle modelstandard model

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Applications of game theory (91A80) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 1759639
• Another look at ``provable security
• scientific article; zbMATH DE number 5005844
• Digital Signatures
• scientific article; zbMATH DE number 2009973

Cited in

(15)

• Preserving privacy for free: efficient and provably secure two-factor authentication scheme with user anonymity
• Provable related-key security of contracting Feistel networks
• Provably Secure Key Assignment Schemes from Factoring
• Beyond provable security verifiable IND-CCA security of OAEP
• Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
• A Brief History of Provably-Secure Public-Key Encryption
• On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis
• scientific article; zbMATH DE number 17388 (Why is no real title available?)
• scientific article; zbMATH DE number 1149909 (Why is no real title available?)
• scientific article; zbMATH DE number 2009973 (Why is no real title available?)
• scientific article; zbMATH DE number 1759335 (Why is no real title available?)
• scientific article; zbMATH DE number 1759639 (Why is no real title available?)
• Direct proof of security of Wegman-Carter authentication with partially known key
• scientific article; zbMATH DE number 2204017 (Why is no real title available?)
• Another Look at “Provable Security”. II

This page was built for publication: Provable security for public key schemes

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