Fundamental problems in provable security and cryptography

DOI10.1098/RSTA.2006.1895MaRDI QIDQ5301903zbMATH OpenOpenAlexWikidataFDO

Authors Alexander W. Dent

Publication date 20 January 2009

Published in Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1098/rsta.2006.1895

zbMATH Keywords

cryptographyprovable securityrandom oracle model

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 2242698
• Cryptanalysis vs. provable security
• Another look at ``provable security
• scientific article; zbMATH DE number 5005844
• Intractable problems in cryptography

Cites work

• A Mathematical Theory of Communication
• Communication Theory of Secrecy Systems*

Cited in

(12)

• Intractable problems in cryptography
• Computer-Aided Security Proofs for the Working Cryptographer
• Exploring confusion in product ciphers through regression analysis
• A Brief History of Provably-Secure Public-Key Encryption
• A “proof-reading” of Some Issues in Cryptography
• Information Security
• Chasing diagrams in cryptography
• scientific article; zbMATH DE number 2242698 (Why is no real title available?)
• A unified approach to idealized model separations via indistinguishability obfuscation
• Limits of Constructive Security Proofs
• scientific article; zbMATH DE number 17388 (Why is no real title available?)
• Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali

This page was built for publication: Fundamental problems in provable security and cryptography

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