Unifying Simulatability Definitions in Cryptographic Systems under Different Timing Assumptions

Unifying Simulatability Definitions in Cryptographic Systems under Different Timing Assumptions (2003)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Michael Backes

Venue:	Concurrency Theory, Proceedings of CONCUR 2003
Citations:	8 - 2 self

BibTeX

@INPROCEEDINGS{Backes03unifyingsimulatability,
    author = {Michael Backes},
    title = {Unifying Simulatability Definitions in Cryptographic Systems under Different Timing Assumptions},
    booktitle = {Concurrency Theory, Proceedings of CONCUR 2003},
    year = {2003},
    pages = {350--365},
    publisher = {Springer-Verlag}
}

Bookmark

OpenURL

Abstract

The cryptographic concept of simulatability has become a salient technique for faithfully analyzing and proving security properties of arbitrary cryptographic protocols. We investigate the relationship between simulatability in synchronous and asynchronous frameworks by means of the formal models of Pfitzmann et. al., which are seminal in using this concept in order to bridge the gap between the formal-methods and the cryptographic community. We show that the synchronous model can be seen as a special case of the asynchronous one with respect to simulatability, i.e., we present an embedding between both models that we show to preserve simulatability.

Citations

1311	Distributed Algorithms - Lynch - 1996
1040	R.: A logic for authentication - Burrows, Abadi, et al. - 1989
893	The knowledge complexity of interactive proof systems - Goldwasser, Micali, et al. - 1989
872	A.C.-C.: On the security of public key protocols - Dolev, Yao - 1983
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
490	PVS: A prototype verification system - Owre, Rushby, et al. - 1992
484	Universally composable security: A new paradigm for cryptographic protocols - Canetti - 2005
453	Theory and applications of trapdoor functions - Yao - 1982
407	Protocols for secure computation - Yao - 1982
368	The inductive approach to verifying cryptographic protocols - Paulson - 1998
331	Security and Composition of Multiparty Cryptographic Protocols - Canetti - 2000
326	Kerberos: An authentication service for computer networks - Neuman, Ts’o - 1994
267	P.: Reconciling two views of cryptography (the computational soundness of formal encryption - Abadi, Rogaway - 2002
233	N.A.: Probabilistic simulations for probabilistic processes - Segala, Lynch - 1994
193	A modular approach to the design and analysis of authentication and key exchange protocols (extended abstract - Bellare, Canetti, et al. - 1998
140	Concurrent zero-knowledge - Dwork, Naor, et al. - 1998
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
126	Secure Multiparty Protocols and Zero-knowledge proof Systems Tolerating a Faulty Minority - Beaver - 1991
117	Composition and integrity preservation of secure reactive systems - Pfitzmann, Waidner
107	A probabilistic poly-time framework for protocol analysis - Lincoln, Mitchell, et al. - 1998
107	Universally composable two-party and multiparty secure computation - Canetti, Lindell, et al. - 2002
104	A composable cryptographic library with nested operations - Backes, Pfitzmann, et al. - 2003
97	Secure computation - Micali, Rogaway - 1991
91	Formal verification of cryptographic protocols: A survey - Meadows - 1995
88	Formal eavesdropping and its computational interpretation - Abadi, Jürjens - 2001
85	Strand spaces: Why is a security protocol correct - Guttman, Herzog, et al. - 1998
82	Universally Composable Notions of Key Exchange and Secure Channels - Canetti, Krawczyk - 2002
79	Fair computation of general functions in presence of immoral majority - Goldwasser, Levin - 1990
72	Studies in Secure Multiparty Computation and Applications - Canetti - 1995
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
59	Player simulation and general adversary structures in perfect multiparty computation - Hirt, Maurer - 2000
56	Analyzing encryption protocols using formal verification techniques - Kemmerer - 1989
48	Verifying secrets and relative secrecy - Volpano, Smith - 2000
47	E.W.: Composition and behaviors of probabilistic I/O automata - Wu, Smolka, et al. - 1997
46	A general composition theorem for secure reactive systems - Backes, Pfitzmann, et al. - 2004
45	Symmetric encryption in a simulatable DolevYao style cryptographic library - Backes, Pfitzmann
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
39	Cryptographic security of reactive systems - Pfitzmann, Schunter, et al.
30	Symmetric authentication within simulatable cryptographic library - Backes, Pfitzmann, et al.
26	The faithfulness of abstract protocol analysis: message authentication - Guttman, Thayer, et al. - 2001
26	A cryptographically sound security proof of the needham-schroeder-lowe public-key protocol - Backes, Pfitzmann - 2003
25	A linguistic characterization of bounded oracle computation and probabilistic polynomial - Mitchell, Mitchell, et al. - 1998
25	Plaintext awareness via key registration - Herzog, Liskov, et al. - 2003
24	Logics for reasoning about cryptographic constructions - Impagliazzo, Kapron
23	Cryptographically Sound and Machine-Assisted Verification of Security Protocols - Backes, Jacobi - 2003
21	Deriving cryptographically sound implementations using composition and formally verified bisimulation - Backes, Jacobi, et al. - 2002