Towards a Formal Treatment of Secrecy Against Computational Adversaries
- 1 January 2005
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 77-92
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Approximating Imperfect Cryptography in a Formal ModelElectronic Notes in Theoretical Computer Science, 2004
- A Note on the Perfect Encryption Assumption in a Process CalculusLecture Notes in Computer Science, 2004
- Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols2004
- Two Formal Approaches for Approximating Noninterference PropertiesLecture Notes in Computer Science, 2004
- Computational Probabilistic Non-interference2002
- A compiler for analyzing cryptographic protocols using noninterferenceACM Transactions on Software Engineering and Methodology, 2000
- Reconciling Two Views of Cryptography2000
- A Calculus for Cryptographic Protocols: The Spi CalculusInformation and Computation, 1999
- Analyzing encryption protocols using formal verification techniquesIEEE Journal on Selected Areas in Communications, 1989
- On the security of public key protocolsIEEE Transactions on Information Theory, 1983