Fundamental problems in provable security and cryptography

DOI10.1098/RSTA.2006.1895zbMATH Open1152.94301OpenAlexW2110142351WikidataQ51929329 ScholiaQ51929329MaRDI QIDQ5301903FDOQ5301903

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

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

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)

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
• A “proof-reading” of Some Issues in Cryptography
• A Brief History of Provably-Secure Public-Key Encryption
• Exploring confusion in product ciphers through regression analysis
• Information Security
• Chasing diagrams in cryptography
• Title not available (Why is that?)
• A unified approach to idealized model separations via indistinguishability obfuscation
• Limits of Constructive Security Proofs
• Title not available (Why is that?)
• 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)