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

DOI10.1007/978-3-030-86205-3_14MaRDI QIDQ831949zbMATH OpenOpenAlexFDO

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

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)

Cites work

• scientific article; zbMATH DE number 1942410 (Why is no real title available?)
• Characterizing collision and second-preimage resistance in Linicrypt
• Deciding knowledge in security protocols under equational theories
• Fast Software Encryption
• Linicrypt: a model for practical cryptography
• Mobile values, new names, and secure communication
• On the Automatic Analysis of Recursive Security Protocols with XOR
• Static equivalence \textit{is} harder than knowledge

Cited in

(5)

• Moving the bar on computationally sound exclusive-or
• CryptoSolve: towards a tool for the symbolic analysis of cryptographic algorithms
• scientific article; zbMATH DE number 7199588 (Why is no real title available?)
• Local XOR unification: definitions, algorithms and application to cryptography
• Proof producing synthesis of arithmetic and cryptographic hardware

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

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