Algorithmic problems in the symbolic approach to the verification of automatically synthesized cryptosystems

DOI10.1007/978-3-030-86205-3_14OpenAlexW3197956099MaRDI QIDQ831949

Andrew M. Marshall, Paliath Narendran, Veena Ravishankar, Catherine A. Meadows, Brandon Rozek, Christopher Lynch, Hai Lin

Publication date: 24 March 2022

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

zbMATH Keywords

unificationequational theoriessymbolic reasoningcryptographic modes of operation

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Related Items (3)

Moving the bar on computationally sound exclusive-or ⋮ Local XOR unification: definitions, algorithms and application to cryptography ⋮ Unnamed Item

Cites Work

• Deciding knowledge in security protocols under equational theories
• Characterizing collision and second-preimage resistance in Linicrypt
• Linicrypt: A Model for Practical Cryptography
• On the Automatic Analysis of Recursive Security Protocols with XOR
• Mobile values, new names, and secure communication
• Fast Software Encryption
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithmic problems in the symbolic approach to the verification of automatically synthesized cryptosystems