Non interference for the analysis of cryptographic protocols

DOI10.1007/3-540-45022-X_31MaRDI QIDQ2754157zbMATH OpenFDO

Authors Riccardo Focardi, Roberto Gorrieri, Fabio Martinelli

Publication date 9 December 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45022-X_31

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1497862
• Foundations of Security Analysis and Design II
• Context-sensitive equivalences for non-interference based protocol analysis.
• scientific article; zbMATH DE number 2090701
• scientific article; zbMATH DE number 3965967

Cited in

(28)

• Formal models and analysis of secure multicast in wired and wireless networks
• Primitives for authentication in process algebras.
• Noninterference for concurrent programs and thread systems
• The security pi-calculus and non-interference
• Analysis of security protocols as open systems
• A comparison of three authentication properties.
• Checking noninterference in timed CSP
• Gaining trust by tracing security protocols
• Secure non-interactive reduction and spectral analysis of correlations
• System-level non-interference of constant-time cryptography. I: Model
• A general language-based framework for specifying and verifying notions of opacity
• scientific article; zbMATH DE number 1696894 (Why is no real title available?)
• A formalization of credit and responsibility within the GNDC schema
• Bisimulation-based non-deterministic admissible interference and its application to the analysis of cryptographic protocols
• Techniques for security checking: non-interference vs control flow analysis
• Formal models of timing attacks on web privacy
• Dynamics security policies and process opacity for timed process algebras
• A new mutually undeniable cryptographic protocol and its formal analysis
• scientific article; zbMATH DE number 1497862 (Why is no real title available?)
• scientific article; zbMATH DE number 1839448 (Why is no real title available?)
• scientific article; zbMATH DE number 2090701 (Why is no real title available?)
• Persistent stochastic non-interference
• Cryptographic defense against traffic analysis
• Weakening the perfect encryption assumption in Dolev-Yao adversaries
• Context-sensitive equivalences for non-interference based protocol analysis.
• Reachability results for timed automata with unbounded data structures
• Decidability issues for extended ping-pong protocols
• Linearity and bisimulation

This page was built for publication: Non interference for the analysis of cryptographic protocols

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