Relating two standard notions of secrecy

DOI10.4230/OASICS.TRUSTWORTHYSW.2006.691MaRDI QIDQ2917407zbMATH OpenFDO

Authors Eugen Zălinescu, Véronique Cortier, Michaël Rusinowitch

Publication date 28 September 2012

Full work available at URL https://doi.org/10.4230/OASICS.TRUSTWORTHYSW.2006.691

zbMATH Keywords

applied-pi calculussecrecysecurity protocolsverification

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Cryptography (94A60)

Recommendations

• Relating Two Standard Notions of Secrecy
• Relating two standard notions of secrecy
• Static equivalence \textit{is} harder than knowledge
• Preserving Secrecy Under Refinement
• Secrecy by typing in security protocols

Cited in

(3)

• Static equivalence \textit{is} harder than knowledge
• Relating Two Standard Notions of Secrecy
• Relating two standard notions of secrecy

Describes a project that uses

Uses Software

• simpleAPL
• HERMES
• Isabelle/ZF

This page was built for publication: Relating two standard notions of secrecy

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