A computational indistinguishability logic for the bounded storage model

DOI10.1007/978-3-642-27901-0_9zbMATH Open1302.94035OpenAlexW2100902610MaRDI QIDQ2889822FDOQ2889822

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

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

zbMATH Keywords

formal verificationprovable cryptographycomputational modelbounded storage model

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (4)

• Title not available (Why is that?)
• 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)