Moving the bar on computationally sound exclusive-or

DOI10.1007/978-3-030-88428-4_14zbMATH Open1499.94048OpenAlexW3203992497MaRDI QIDQ2148759FDOQ2148759

Authors: Catherine Meadows 

Publication date: 24 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-88428-4_14

Recommendations

• Computational soundness of symbolic analysis for protocols using hash functions
• Limits of the cryptographic realization of Dolev-Yao-style XOR
• Security proof with dishonest keys
• Computational soundness of coinductive symbolic security under active attacks
• Theory of Cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• Mobile values, new names, and secure communication
• Term Rewriting and All That
• Automated proofs of block cipher modes of operation
• On the security of public key protocols
• Automata, Languages and Programming
• Title not available (Why is that?)
• A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Theory of Cryptography
• Characterizing collision and second-preimage resistance in Linicrypt
• Linicrypt: A Model for Practical Cryptography
• Title not available (Why is that?)
• Algorithmic problems in the symbolic approach to the verification of automatically synthesized cryptosystems
• Blockwise-Adaptive Chosen-Plaintext Attack and Online Modes of Encryption

Cited In (3)

• Computational soundness, co-induction, and encryption cycles
• Title not available (Why is that?)
• Local XOR unification: definitions, algorithms and application to cryptography

This page was built for publication: Moving the bar on computationally sound exclusive-or

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