Computational soundness of coinductive symbolic security under active attacks

DOI10.1007/978-3-642-36594-2_30MaRDI QIDQ4910297zbMATH OpenOpenAlexFDO

Authors Mohammad Hajiabadi, Bruce M. Kapron

Publication date 18 March 2013

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36594-2_30

zbMATH Keywords

active adversariesadaptive corruptionscircular securitycoinductioncomputational soundnesstrace-based protocol security

Mathematics Subject Classification ID

Network protocols (68M12) Cryptography (94A60)

Recommendations

• Computational soundness, co-induction, and encryption cycles
• Security proof with dishonest keys
• Theory of Cryptography
• Theory of Cryptography
• Soundness of Formal Encryption in the Presence of Key-Cycles

Cited in

(10)

• Moving the bar on computationally sound exclusive-or
• Security proof with dishonest keys
• Computational soundness of indistinguishability properties without computable parsing
• scientific article; zbMATH DE number 6678480 (Why is no real title available?)
• Separating Trace Mapping and Reactive Simulatability Soundness: The Case of Adaptive Corruption
• Computational soundness, co-induction, and encryption cycles
• Computationally Sound Symbolic Secrecy in the Presence of Hash Functions
• Theory of Cryptography
• Theory of Cryptography
• Circular insecure encryption: from long cycles to short cycles

This page was built for publication: Computational soundness of coinductive symbolic security under active attacks

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