Proof Techniques for Cryptographic Processes
From MaRDI portal
Publication:2784489
DOI10.1137/S0097539700377864zbMath1017.68050OpenAlexW2063608931WikidataQ57650900 ScholiaQ57650900MaRDI QIDQ2784489
Rocco De Nicola, Rosario Pugliese, Michele Boreale
Publication date: 23 April 2002
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539700377864
Data encryption (aspects in computer science) (68P25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (20)
Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity ⋮ Formalising Observer Theory for Environment-Sensitive Bisimulation ⋮ Unnamed Item ⋮ Deciding equivalence-based properties using constraint solving ⋮ When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus ⋮ Implementing Spi Calculus Using Nominal Techniques ⋮ Decidability of equivalence of symbolic derivations ⋮ Efficient representation of the attacker's knowledge in cryptographic protocols analysis ⋮ A Testing Theory for a Higher-Order Cryptographic Language ⋮ A bisimulation for dynamic sealing ⋮ A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols ⋮ Automated verification of selected equivalences for security protocols ⋮ Unnamed Item ⋮ Encoding cryptographic primitives in a calculus with polyadic synchronisation ⋮ Bisimulations in the join-calculus ⋮ EXPLOITING SYMMETRIES FOR TESTING EQUIVALENCE VERIFICATION IN THE SPI CALCULUS ⋮ Modal Logics for Cryptographic Processes ⋮ Analysis of security protocols as open systems ⋮ On the symbolic reduction of processes with cryptographic functions. ⋮ A Logical Characterisation of Static Equivalence
This page was built for publication: Proof Techniques for Cryptographic Processes
