Algorithmic problems in the symbolic approach to the verification of automatically synthesized cryptosystems
From MaRDI portal
Publication:831949
DOI10.1007/978-3-030-86205-3_14OpenAlexW3197956099MaRDI QIDQ831949FDOQ831949
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
Cites Work
- Mobile values, new names, and secure communication
- Deciding knowledge in security protocols under equational theories
- On the Automatic Analysis of Recursive Security Protocols with XOR
- Characterizing collision and second-preimage resistance in Linicrypt
- Linicrypt: a model for practical cryptography
- Static equivalence \textit{is} harder than knowledge
- Title not available (Why is that?)
- Fast Software Encryption
Cited In (5)
- Moving the bar on computationally sound exclusive-or
- CryptoSolve: towards a tool for the symbolic analysis of cryptographic algorithms
- Title not available (Why is that?)
- 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)
