Probabilistic polynomial-time equivalence and security analysis

DOI10.1007/3-540-48119-2_43MaRDI QIDQ4493893zbMATH OpenFDO

Authors P. Lincoln, John Mitchell, Andre Scedrov, M. Mitchell

Publication date 1999

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

Full work available at URL https://doi.org/10.1007/3-540-48119-2_43

zbMATH Keywords

authenticationobservational equivalenceprobabilistic process calculus

Mathematics Subject Classification ID

Logic in computer science (03B70) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 1692932
• Automata, Languages and Programming
• A probabilistic polynomial-time calculus for analysis of cryptographic protocols (preliminary report)
• A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
• The Hitchhiker's guide to decidability and complexity of equivalence properties in security protocols
• Generalized probabilistic satisfiability and applications to modelling attackers with side-channel capabilities
• Random polynomial-time attacks and Dolev-Yao models
• scientific article; zbMATH DE number 503346
• A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
• Composition of cryptographic protocols in a probabilistic polynomial-time process calculus.

Cited in

(19)

• On the relationships between notions of simulation-based security
• A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
• Universally composable symbolic security analysis
• The reactive simulatability (RSIM) framework for asynchronous systems
• Automated verification of selected equivalences for security protocols
• Unifying simulatability definitions in cryptographic systems under different timing assumptions
• scientific article; zbMATH DE number 1692932 (Why is no real title available?)
• Protocol composition logic (PCL)
• On equivalences, metrics, and polynomial time
• On the equality of probabilistic terms
• Polynomial-Space Approximation of No-Signaling Provers
• A probabilistic polynomial-time calculus for analysis of cryptographic protocols (preliminary report)
• Universal Equivalence and Majority of Probabilistic Programs over Finite Fields
• scientific article; zbMATH DE number 7300321 (Why is no real title available?)
• Proving more observational equivalences with ProVerif
• A computational interpretation of Dolev-Yao adversaries
• Machine-checked security proofs of cryptographic signature schemes
• Composition of cryptographic protocols in a probabilistic polynomial-time process calculus.
• scientific article; zbMATH DE number 7758323 (Why is no real title available?)

This page was built for publication: Probabilistic polynomial-time equivalence and security analysis

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