30 citations found. Retrieving documents...
Michael Backes, Birgit Pfitzmann, and Michael Waidner. A general composition theorem for secure reactive systems. In Moni Naor, editor, Theory of Cryptography, Proceedings of TCC 2004, number 2951 in Lecture Notes in Computer Science, pages 336--354. Springer-Verlag, 2004. Online available at http://www.zurich.ibm.com/security/publications/2004/ BaPfWa2004MoreGeneralComposition.pdf.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:

First 50 documents

Cryptographically Sound Theorem Proving - Sprenger, Backes, Basin.. (2006)   (2 citations)  Self-citation (Backes Pfitzmann Waidner)   (Correct)

No context found.

M. Backes, B. Pfitzmann, and M. Waidner. A general composition theorem for secure reactive systems. In Proc. 1st Theory of Cryptography Conference (TCC), volume 2951 of Lecture Notes in Computer Science, pages 336--354. Springer, 2004.


Conditional Reactive Simulatability - Backes, Dürmuth, Hofheinz, Küsters (2006)   Self-citation (Backes)   (Correct)

No context found.

Michael Backes, Birgit Pfitzmann, and Michael Waidner. A general composition theorem for secure reactive systems. In Moni Naor, editor, Theory of Cryptography, Proceedings of TCC


Comparing Two Notions of Simulatability - Dennis Hofheinz And   (Correct)

No context found.

Michael Backes, Birgit Pfitzmann, and Michael Waidner. A general composition theorem for secure reactive systems. In Moni Naor, editor, Theory of Cryptography, Proceedings of TCC 2004, number 2951 in Lecture Notes in Computer Science, pages 336--354. Springer-Verlag, 2004. Online available at http://www.zurich.ibm.com/security/publications/2004/ BaPfWa2004MoreGeneralComposition.pdf.


Layered Specifications Framework for Analysis of.. - Bar-Ilan University..   (Correct)

No context found.

M. Backes, B. Pfitzmann, and M. Waidner. A General Composition Theorem for Secure Reactive Systems. In Theory of Cryptography, First Theory of Cryptography Conference, TCC 2004, volume 2951 of Lecture Notes in Computer Science, pages 336--354. Springer, 2004.


On the Relationships between Notions of.. - Datta, Küsters.. (2006)   (1 citation)  (Correct)

No context found.

M. Backes, B. Pfitzmann, and M. Waidner. A General Composition Theorem for Secure Reactive Systems. In Proceedings of the 1st Theory of Cryptography Conference (TCC 2004.


Key Confirmation and Adaptive Corruptions - In The Protocol (2006)   (Correct)

No context found.

M. Backes, B. Pfitzmann, and M. Waidner. A general composition theorem for secure reactive systems. In Proc. 1st Theory of Cryptography Conference (TCC), volume 3378 of LNCS, pages 336--354. Springer, 2004.


Relations among Statistical Security Notions or Why Exponential.. - Unruh (2005)   (Correct)

No context found.

Michael Backes, Birgit Pfitzmann, and Michael Waidner. A general composition theorem for secure reactive systems. In Moni Naor, editor, Theory of Cryptography, Proceedings of TCC


The Full Abstraction of the UC Framework - Almansa (2004)   (Correct)

No context found.

M. Backes, B. Pfitzmann, and M. Waidner. A general composition theorem for secure reactive systems. In LNCS, volume 2951, pages 336--354, 2004. TCC'04.


The Full Abstraction of the UC Framework - Almansa (2004)   (Correct)

No context found.

M. Backes, B. Pfitzmann, and M. Waidner. A general composition theorem for secure reactive systems. In LNCS, volume 2951, pages 336--354, 2004. TCC'04.


The Full Abstraction of the UC Framework - Almansa (2004)   (Correct)

No context found.

M. Backes, B. Pfitzmann, and M. Waidner. A general composition theorem for secure reactive systems. In LNCS, volume 2951, pages 336--354, 2004. TCC'04.


The Full Abstraction of the UC Framework - Almansa (2004)   (Correct)

No context found.

M. Backes, B. Pfitzmann, and M. Waidner. A general composition theorem for secure reactive systems. In LNCS, volume 2951, pages 336--354, 2004. TCC'04. [Can01] R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, page 136, 2001. [DKM


The Full Abstraction of the UC Framework - Almansa (2004)   (Correct)

No context found.

M. Backes, B. Pfitzmann, and M. Waidner. A general composition theorem for secure reactive systems. In LNCS, volume 2951, pages 336--354, 2004. TCC'04. [Can01] R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, page 136, 2001. [DKM


The Full Abstraction of the UC Framework - Almansa (2004)   (Correct)

No context found.

M. Backes, B. Pfitzmann, and M. Waidner. A general composition theorem for secure reactive systems. In LNCS, volume 2951, pages 336--354, 2004. TCC'04. [Can01] R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, page 136, 2001. [DKM


The Full Abstraction of the UC Framework - Almansa (2004)   (Correct)

No context found.

M. Backes, B. Pfitzmann, and M. Waidner. A general composition theorem for secure reactive systems. In LNCS, volume 2951, pages 336--354, 2004. TCC'04. [Can01] R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, page 136, 2001. [DKM


The Full Abstraction of the UC Framework - Almansa (2004)   (Correct)

No context found.

M. Backes, B. Pfitzmann, and M. Waidner. A general composition theorem for secure reactive systems. In LNCS, volume 2951, pages 336--354, 2004. TCC'04. [Can01] R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, page 136, 2001. [DKM


Towards Computationally Sound Symbolic Analysis of Key.. - Gupta, Shmatikov (2005)   (2 citations)  (Correct)

No context found.

M. Backes, B. Pfitzmann, and M. Waidner. A general composition theorem for secure reactive systems. In Proc. 1st TCC, pages 336--354, 2004.


The Full Abstraction of the UC Framework - Almansa (2005)   (Correct)

No context found.

M. Backes, B. Pfitzmann, and M. Waidner. A general composition theorem for secure reactive systems. In LNCS, volume 2951, pages 336--354, 2004. TCC'04.


The Full Abstraction of the UC Framework - Almansa (2005)   (Correct)

No context found.

M. Backes, B. Pfitzmann, and M. Waidner. A general composition theorem for secure reactive systems. In LNCS, volume 2951, pages 336--354, 2004. TCC'04.


The Full Abstraction of the UC Framework - Almansa (2005)   (Correct)

No context found.

M. Backes, B. Pfitzmann, and M. Waidner. A general composition theorem for secure reactive systems. In LNCS, volume 2951, pages 336--354, 2004. TCC'04.


The Full Abstraction of the UC Framework - Almansa (2005)   (Correct)

No context found.

M. Backes, B. Pfitzmann, and M. Waidner. A general composition theorem for secure reactive systems. In LNCS, volume 2951, pages 336--354, 2004. TCC'04. [Can01] R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, page 136, 2001. [DKM


The Full Abstraction of the UC Framework - Almansa (2005)   (Correct)

No context found.

M. Backes, B. Pfitzmann, and M. Waidner. A general composition theorem for secure reactive systems. In LNCS, volume 2951, pages 336--354, 2004. TCC'04. [Can01] R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, page 136, 2001. [DKM


The Full Abstraction of the UC Framework - Almansa (2005)   (Correct)

No context found.

M. Backes, B. Pfitzmann, and M. Waidner. A general composition theorem for secure reactive systems. In LNCS, volume 2951, pages 336--354, 2004. TCC'04. [Can01] R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, page 136, 2001. [DKM


The Full Abstraction of the UC Framework - Almansa (2005)   (Correct)

No context found.

M. Backes, B. Pfitzmann, and M. Waidner. A general composition theorem for secure reactive systems. In LNCS, volume 2951, pages 336--354, 2004. TCC'04. [Can01] R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, page 136, 2001. [DKM


The Full Abstraction of the UC Framework - Almansa (2005)   (Correct)

No context found.

M. Backes, B. Pfitzmann, and M. Waidner. A general composition theorem for secure reactive systems. In LNCS, volume 2951, pages 336--354, 2004. TCC'04. [Can01] R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, page 136, 2001. [DKM


Comparing Two Notions of Simulatability - Hofheinz, Unruh (2005)   (1 citation)  (Correct)

No context found.

Michael Backes, Birgit Pfitzmann, and Michael Waidner. A general composition theorem for secure reactive systems. In Moni Naor, editor, Theory of Cryptography, Proceedings of TCC 2004, number 2951 in Lecture Notes in Computer Science, pages 336--354. Springer-Verlag, 2004. Online available at http://www.zurich.ibm.com/security/publications/2004/ BaPfWa2004MoreGeneralComposition.pdf.

First 50 documents

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