A computational indistinguishability logic for the bounded storage model

DOI10.1007/978-3-642-27901-0_9MaRDI QIDQ2889822zbMATH OpenOpenAlexFDO

Authors Gilles Barthe, Mathilde Duclos, Yassine Lakhnech

Publication date 8 June 2012

Published in Foundations and Practice of Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-27901-0_9

zbMATH Keywords

formal verificationprovable cryptographycomputational modelbounded storage model

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Survey: leakage resilience and the bounded retrieval model
• Leakage-resilient circuits without computational assumptions
• Leakage-resilient symmetric cryptography under empirically verifiable assumptions
• Certified security proofs of cryptographic protocols in the computational model: an application to intrusion resilience
• Key-evolution schemes resilient to space-bounded leakage

Cited in

(4)

• scientific article; zbMATH DE number 647706 (Why is no real title available?)
• Advances in Cryptology - CRYPTO 2003
• Certified security proofs of cryptographic protocols in the computational model: an application to intrusion resilience
• From operational models to information theory; side channels in pGCL with Isabelle

This page was built for publication: A computational indistinguishability logic for the bounded storage model

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