M. Backes and C. Jacobi. Cryptographically sound and machine-assisted verification of security protocols. In Proc. 20th STACS, pages 675--686. Springer LNCS 2607, 2003. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Cryptographically Sound Security Proofs for - Basic And Public-Key Self-citation (Backes) (Correct)
No context found.
M. Backes and C. Jacobi. Cryptographically sound and machine-assisted verification of security protocols. In Proc. 20th STACS, pages 675--686. Springer LNCS 2607, 2003.
Cryptographically Sound and Machine-Assisted Verification of.. - Backes, Jacobi (2002) (7 citations) Self-citation (Backes Jacobi) (Correct)
No context found.
M. Backes and C. Jacobi. Cryptographically sound and machine-assisted verification of security protocols. Research Report RZ 3468, IBM Research, 2002.
A Cryptographically Sound Dolev-Yao Style Security Proof of the.. - Backes (2004) Self-citation (Backes) (Correct)
No context found.
M. Backes and C. Jacobi. Cryptographically sound and machine-assisted verification of security protocols. In Proc. 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 2607 of LNCS, pages 675--686. Springer, 2003.
A Cryptographically Sound Security Proof of the.. - Backes, Pfitzmann (2003) (9 citations) Self-citation (Backes) (Correct)
No context found.
M. Backes and C. Jacobi. Cryptographically sound and machine-assisted verification of security protocols. In Proc. 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 2607 of Lecture Notes in Computer Science, pages 675--686. Springer, 2003.
Polynomial Liveness - Backes, Pfitzmann, Waidner, Steiner (2003) Self-citation (Backes) (Correct)
No context found.
M. Backes and C. Jacobi. Cryptographically sound and machine-assisted verification of security protocols. In 20th Symposium on Theoretical Aspects of Computer Science (STACS'03), Lecture Notes in Computer Science. Springer-Verlag, Berlin Germany, 2003.
A General Composition Theorem for Secure Reactive Systems - Backes, Pfitzmann, Waidner (2004) (25 citations) Self-citation (Backes) (Correct)
No context found.
M. Backes and C. Jacobi. Cryptographically sound and machine-assisted verification of security protocols. In Proc. 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 2607 of LNCS, pages 675--686. Springer, 2003.
Security in Business Process Engineering - Backes, Pfitzmann, Waidner (2003) Self-citation (Backes) (Correct)
No context found.
M. Backes and C. Jacobi. Cryptographically sound and machine-assisted verification of security protocols. In Proc. 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 2607 of Lecture Notes in Computer Science, pages 675--686. Springer, 2003.
Cryptographically Sound and Machine-Assisted - Verification Of Security Self-citation (Backes Jacobi) (Correct)
No context found.
M. Backes and C. Jacobi. Cryptographically sound and machine-assisted verification of security protocols. Research Report RZ 3468, IBM Research, 2002.
Security in Business Process Engineering - Backes, Pfitzmann, Waidner (2003) Self-citation (Backes) (Correct)
No context found.
M. Backes and C. Jacobi. Cryptographically sound and machine-assisted verification of security protocols. In Proc. 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 2607 of Lecture Notes in Computer Science, pages 675--686. Springer, 2003.
Cryptographically Sound and Machine-Assisted Verification of.. - Backes, Jacobi (2003) (7 citations) Self-citation (Backes Jacobi) (Correct)
No context found.
M. Backes and C. Jacobi. Cryptographically sound and machine-assisted verification of security protocols. Research Report RZ 3468, IBM Research, 2002.
Polynomial Liveness - Backes, Pfitzmann, Waidner, Steiner (2003) Self-citation (Backes) (Correct)
No context found.
M. Backes and C. Jacobi. Cryptographically sound and machine-assisted verification of security protocols. In 20th Symposium on Theoretical Aspects of Computer Science (STACS'03), Lecture Notes in Computer Science. Springer-Verlag, Berlin Germany, 2003.
Secure Asynchronous Reactive Systems - Backes, Pfitzmann, Waidner (2004) (7 citations) Self-citation (Backes) (Correct)
No context found.
M. Backes and C. Jacobi. Cryptographically sound and machine-assisted verification of security protocols. In Proc. 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 2607 of Lecture Notes in Computer Science, pages 675--686. Springer, 2003.
A General Composition Theorem for Secure Reactive Systems - Backes, Pfitzmann, Waidner (2004) (25 citations) Self-citation (Backes) (Correct)
No context found.
M. Backes and C. Jacobi. Cryptographically sound and machine-assisted verification of security protocols. In Proc. 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 2607 of Lecture Notes in Computer Science, pages 675--686. Springer, 2003.
Unifying Simulatability Definitions in Cryptographic Systems.. - Backes (2003) (2 citations) Self-citation (Backes) (Correct)
....et al. we can state that Canetti s work enjoys a more general composition theorem and has moreover addressed more cryptographic primitives so far. On the other hand, the models of Pfitzmann et al. are more rigorously defined and early examples of tool supported proofs in their models exist [5, 4], using PVS [32] Moreover, the recently published universally composable cryptographic library [6] may pave the way to formal verification of large security protocols within their models. Outline. In Section 2 we review the reactive models for synchronous and asynchronous time. In Section 3, we ....
....subsequent remarks (stating that the theorem holds as well for the restricted version async,H of simulatability) yielding Sys 1 sync Sys 3 . This proof technique is applicable to almost all theorems that rely on simulatability. As the most important example, we name the preservation theorem [36, 4], which states that integrity properties expressed in lineartime logic are preserved under simulatability. The proof of this theorem is difficult and comprises several pages for both models. Using our work, the synchronous proof could as well be omitted. However, this proof techniques is ....
M. Backes and C. Jacobi. Cryptographically sound and machine-assisted verification of security protocols. In Proc. 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 2607 of Lecture Notes in Computer Science, pages 675--686. Springer, 2003.
A Cryptographically Sound Security Proof of the.. - Backes, Pfitzmann (2003) (9 citations) Self-citation (Backes) (Correct)
.... : EA out v (ok, u) r t 1 # If v believes to speak with u at time t 1 # #t 0 t 1 : # then there exists a past time t 0 EA in u (new prot, v) r t 0 # in which u started a protocol with v The notion of a system Sys fulfilling an integrity property Req essentially comes in two flavors [4]. Perfect fulfillment, Sys Req , means that the integrity property holds for all traces arising in runs of Sys (a well defined notion from the underlying model [22] Computational fulfillment, Sys Req , means that the property only holds for polynomially bounded users and adversaries, and ....
....u . 5 Proof of the Cryptographic Realization If Theorem 4.1 has been proven, it follows easily that the Needham Schroeder Lowe protocol based on the real cryptographic library computationally fulfills the integrity requirement Req . The main tool is the following preservation theorem from [4]. Theorem 5.1 (Preservation of Integrity Properties (Sketch) Let two systems Sys 1 , Sys 2 be given such that Sys 1 is at least as secure as Sys 2 (written Sys 1 sec Sys 2 ) Let Req be an integrity requirement for both Sys 1 and Sys 2 , and let Sys 2 Req . Then also Sys 1 Req . # Let ....
M. Backes and C. Jacobi. Cryptographically sound and machine-assisted verification of security protocols. In Proc. 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 2607 of Lecture Notes in Computer Science, pages 675--686. Springer, 2003.
Universally Composable Cryptographic Library - Backes, Pfitzmann, Waidner (2003) (14 citations) Self-citation (Backes) (Correct)
....where participants can make new inputs many times, e.g. start new sessions like key exchanges, was first fully defined in [33] with extensions to asynchronous systems in [34, 10] We use the IO automata model of Pfitzmann Waidner. First examples of tool supported proofs in that model exists [6, 5], using PVS [31] Earlier, but less complete or less abstract reactive simulatability notions exist in [26, 23] The reactive simulatability papers already had the goal of bridging the gap between abstract and concrete cryptographic systems. However, so far they abstracted from cryptography so ....
M. Backes and C. Jacobi. Cryptographically sound and machine-assisted veri- fication of security protocols. In Proc. 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS), 2003. To appear.
Computationally Sound Symbolic Secrecy in the - Presence Of Hash (2006) (Correct)
No context found.
M. Backes and I. Christian Jacobi. Cryptographically sound and machine-assisted verification of security protocols. In STACS 2003, pages 675--686, 2003.
Unifying Simulatability Definitions in Cryptographic Systems.. - Backes (2003) (2 citations) (Correct)
No context found.
M. Backes and C. Jacobi. Cryptographically sound and machine-assisted verification of security protocols. In Proc. 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 2607 of LNCS, pages 675--686. Springer, 2003.
A Composable Cryptographic Library with Nested.. - Backes, Pfitzmann.. (2003) (23 citations) (Correct)
No context found.
M. Backes and C. Jacobi. Cryptographically sound and machine-assisted verification of security protocols. In Proc. 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 2607 of Lecture Notes in Computer Science, pages 675--686. Springer, 2003.
Unifying Simulatability Definitions in Cryptographic Systems.. - Backes (2003) (2 citations) (Correct)
No context found.
M. Backes and C. Jacobi. Cryptographically sound and machine-assisted verification of security protocols. In Proc. 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 2607 of LNCS, pages 675--686. Springer, 2003.
A Composable Cryptographic Library with Nested.. - Backes, Pfitzmann.. (2003) (23 citations) (Correct)
No context found.
M. Backes and C. Jacobi. Cryptographically sound and machine-assisted verification of security protocols. In Proc. 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 2607 of Lecture Notes in Computer Science, pages 675--686. Springer, 2003.
Symmetric Encryption in Automatic Analyses for Confidentiality.. - Laud (2004) (18 citations) (Correct)
No context found.
Michael Backes and Christian Jacobi II. Cryptographically Sound and MachineAssisted Verification of Security Protocols. In Helmut Alt and Michel Habib, editors, STACS 2003.
Symmetric Encryption in Automatic Analyses for Confidentiality.. - Laud (2004) (18 citations) (Correct)
No context found.
M. Backes and C. Jacobi II, "Cryptographically Sound and MachineAssisted Verification of Security Protocols," in STACS 2003.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC