On the symbolic reduction of processes with cryptographic functions.
From MaRDI portal
Publication:1853612
DOI10.1016/S0304-3975(02)00090-7zbMath1051.68054MaRDI QIDQ1853612
Denis Lugiez, Roberto M. Amadio, Vincent Vanackère
Publication date: 21 January 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
68P25: Data encryption (aspects in computer science)
Related Items
Key Substitution in the Symbolic Analysis of Cryptographic Protocols, Symbolic Bisimulation for the Applied Pi Calculus, A method for symbolic analysis of security protocols, Decidability issues for extended ping-pong protocols, Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures, Transducer-based analysis of cryptographic protocols, Symbolic protocol analysis for monoidal equational theories, Hierarchical combination of intruder theories, A static analysis of cryptographic processes: the denotational approach, Verifying Cryptographic Protocols with Subterms Constraints
Cites Work
- On the regular structure of prefix rewriting
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
- Proof Techniques for Cryptographic Processes
- On the security of ping-pong protocols
- On the security of public key protocols
- A logic of authentication
- Regular canonical systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item