Computationally Sound Secrecy Proofs by Mechanized Flow Analysis

Computationally Sound Secrecy Proofs by Mechanized Flow Analysis (2006)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Michael Backes , Peeter Laud

Venue:	13th ACM Conference on Computer and Communications Security (CCS 2006
Citations:	8 - 2 self

BibTeX

@INPROCEEDINGS{Backes06computationallysound,
    author = {Michael Backes and Peeter Laud},
    title = {Computationally Sound Secrecy Proofs by Mechanized Flow Analysis},
    booktitle = {13th ACM Conference on Computer and Communications Security (CCS 2006},
    year = {2006},
    pages = {370--379},
    publisher = {ACM}
}

Bookmark

OpenURL

Abstract

We present a novel approach for proving secrecy properties of security protocols by mechanized flow analysis. In contrast to existing tools for proving secrecy by abstract interpretation, our tool enjoys cryptographic soundness in the strong sense of blackbox reactive simulatability /UC which entails that secrecy properties proven by our tool are automatically guaranteed to hold for secure cryptographic implementations of the analyzed protocol, with respect to the more fine-grained cryptographic secrecy definitions and adversary models.

Citations

1040	R.: A logic for authentication - Burrows, Abadi, et al. - 1989
872	A.C.-C.: On the security of public key protocols - Dolev, Yao - 1983
783	Using encryption for authentication in large networks of computers - Needham, Schroeder - 1978
699	A.D.: A calculus for cryptographic protocols: The Spi calculus - Abadi, Gordon - 1997
548	Breaking and fixing the Needham-Schroeder public-key protocol using CSP and FDR - Lowe
484	Universally composable security: A new paradigm for cryptographic protocols - Canetti - 2005
368	The inductive approach to verifying cryptographic protocols - Paulson - 1998
267	P.: Reconciling two views of cryptography (the computational soundness of formal encryption - Abadi, Rogaway - 2002
221	Secrecy by typing in security protocols - Abadi - 1999
130	A Model for Asynchronous Reactive Systems and its Application to Secure Message Transmission - Pfitzmann, Waidner - 2001
128	Three systems for cryptographic protocol analysis - Kemmerer, Meadows, et al. - 1994
117	Composition and integrity preservation of secure reactive systems - Pfitzmann, Waidner
112	E cient and Timely Mutual Authentication - Otway, Rees - 1987
107	A probabilistic poly-time framework for protocol analysis - Lincoln, Mitchell, et al. - 1998
104	A composable cryptographic library with nested operations - Backes, Pfitzmann, et al. - 2003
103	Security properties and CSP - Schneider - 1996
97	Authenticity by typing for security protocols - Gordon, Jeffrey - 2003
83	Analyzing security protocols with secrecy types and logic programs - Abadi, Blanchet - 2002
78	A taxonomy of replay attacks - Syverson - 1994
65	Semantics and program analysis of computationally secure information flow - Laud - 2001
64	Soundness of formal encryption in the presence of active adversaries - Micciancio, Warinschi - 2004
58	Types and effects for asymmetric cryptographic protocols - Gordon, Jeffrey - 2004
55	OFMC: A symbolic model checker for security protocols - Basin, Mödersheim, et al. - 2005
53	A computationally sound mechanized prover for security protocols - Blanchet - 2006
52	Cryptographic Protocols - Merritt - 1983
51	On the security of multi-party pingpong protocols - Even, Goldreich - 1983
51	Typing correspondence assertions for communication protocols - Gordon, Jeffrey
50	Shape analysis - Wilhelm, Sagiv, et al. - 2000
48	Secrecy types for asymmetric communication - Abadi, Blanchet
45	Symmetric encryption in a simulatable DolevYao style cryptographic library - Backes, Pfitzmann
44	Computationally sound implementations of equational theories against passive adversaries, in - Baudet, Cortier, et al.
43	Symmetric encryption in automatic analyses for confidentiality against active adversaries, in - Laud
41	A Universally Composable Cryptographic Library, IACR Cryptology ePrint Archive - Backes, Pfitzmann, et al. - 2003
41	Computationally Sound, Automated Proofs for Security Protocols - Cortier, Warinschi - 2005
32	Relating symbolic and cryptographic secrecy - Backes, Pfitzmann
32	Universally composable symbolic analysis of mutual authentication and key-exchange protocols - Canetti, Herzog - 2006
30	Symmetric authentication within simulatable cryptographic library - Backes, Pfitzmann, et al.
28	Probabilistic polynomial-time semantics for a protocol security logic - Datta, Derek, et al. - 2005
26	A cryptographically sound security proof of the needham-schroeder-lowe public-key protocol - Backes, Pfitzmann - 2003
26	The faithfulness of abstract protocol analysis: message authentication - Guttman, Thayer, et al. - 2001
25	Plaintext awareness via key registration - Herzog, Liskov, et al. - 2003
25	A linguistic characterization of bounded oracle computation and probabilistic polynomial - Mitchell, Mitchell, et al. - 1998
24	Universally composable symbolic analysis of cryptographic protocols - Canetti, Herzog - 2006
24	H.R.: Static validation of security protocols - Bodei, Buchholtz, et al. - 2005
24	Logics for reasoning about cryptographic constructions - Impagliazzo, Kapron
22	Secrecy types for a simulatable cryptographic library - Laud - 2005
20	A cryptographically sound Dolev-Yao style security proof of the Otway-Rees protocol - Backes - 2004
18	A type system for computationally secure information flow - Laud, Vene - 2005
17	An even faster solver for general systems of equations - Fecht, Seidl - 1996
15	Cryptographically sound theorem proving - Sprenger, Backes, et al. - 2006