Deciding the security of protocols with commuting public key encryption

MaRDI QIDQ2848035zbMATH OpenFDO

Authors Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani

Publication date 25 September 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066105000745

Mathematics Subject Classification ID

Network protocols (68M12) Cryptography (94A60)

Recommendations

• On the security of public key protocols
• Deciding security properties for cryptographic protocols. application to key cycles
• scientific article; zbMATH DE number 4053510
• Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption
• Deniable-encryption protocols based on commutative ciphers
• Deciding Key Cycles for Security Protocols
• On the Communication Complexity of Key-Agreement Protocols.
• Towards tightly secure deterministic public key encryption
• Secure composition of cryptographic protocols. (Abstract)

Cited in

(7)

• Transducer-based analysis of cryptographic protocols
• On the relative soundness of the free algebra model for public key encryption
• Challenges in the Automated Verification of Security Protocols
• Authentication in trusted subsystem model using commutative encryption
• Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption
• An NP decision procedure for protocol insecurity with XOR
• Simulation relations for alternating Büchi automata

This page was built for publication: Deciding the security of protocols with commuting public key encryption

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