D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In Proc. TCC, pages 133--151. Springer LNCS 2951, 2004. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Computationally Sound Symbolic Secrecy in the - Presence Of Hash (2006) Self-citation (Warinschi) (Correct)
No context found.
D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In TCC 2004, volume 2951 of LNCS, pages 133--151, 2004.
Key Exchange Protocols: Security Definition, Proof.. - Datta, Derek.. (2006) Self-citation (Warinschi) (Correct)
No context found.
Micciancio, D., Warinschi, B.: Soundness of formal encryption in the presence of active adversaries. In: Theory of Cryptography Conference - Proceedings of TCC 2004. Volume 2951 of Lecture Notes in Computer Science., Springer-Verlag (2004) 133--151
Cryptographically Sound Security Proofs for - Basic And Public-Key (Correct)
No context found.
D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In Proc. TCC, pages 133--151. Springer LNCS 2951, 2004.
Key Confirmation and Adaptive Corruptions - In The Protocol (2006) (Correct)
No context found.
D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In Proc. 1st Theory of Cryptography Conference (TCC), volume 3378 of LNCS, pages 133--151. Springer, 2004.
Computationally Sound Secrecy Proofs by Mechanized Flow Analysis - Backes, Laud (2006) (Correct)
No context found.
Daniele Micciancio and Bogdan Warinschi. Soundness of formal encryption in the presence of active adversaries. In Proc. 1st Theory of Cryptography Conference (TCC), volume 2951 of Lecture Notes in Computer Science, pages 133--151. Springer, 2004.
Computational Soundness of Formal Indistinguishability.. - Bana, Mohassel, Stegers (2006) (Correct)
No context found.
D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In M. Naor, editor, Proceedings of the 1st Theory of Cryptography Conference (TCC), volume 2951 of Lecture Notes in Computer Science, pages 133--151, Cambridge, MA, USA, February 19--21 2004. Springer. A Proofs
Using Probabilistic I/O Automata to Analyze an.. - Canetti, Cheung.. (2005) (Correct)
No context found.
D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In the 1st Theory of Cryptography Conference (TCC), LNCS 2951, pp. 133--151. 2004.
Cryptographically Sound Theorem Proving - Sprenger, Backes, Basin.. (2006) (2 citations) (Correct)
No context found.
D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In Proc. 1st Theory of Cryptography Conference (TCC), volume 2951 of Lecture Notes in Computer Science, pages 133--151. Springer, 2004.
Automated Security Proofs with Sequences of Games - Blanchet, Pointcheval (2006) (Correct)
No context found.
D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In TCC'04, LNCS 2951, pages 133--151. Springer, Feb. 2004.
Limits of the Reactive Simulatability/UC of Dolev-Yao.. - Backes, Pfitzmann.. (2006) (3 citations) (Correct)
No context found.
D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In Proc. 1st Theory of Cryptography Conference (TCC), volume 2951 of LNCS, pages 133--151. Springer, 2004.
A Computationally Sound Mechanized Prover for Security Protocols - Blanchet (2005) (3 citations) (Correct)
No context found.
D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In M. Naor, editor, Theory of Cryptography Conference (TCC'04), volume 2951 of Lecture Notes on Computer Science, pages 133--151, Cambridge, MA, USA, Feb. 2004. Springer.
Towards Computationally Sound Symbolic Analysis of Key.. - Gupta, Shmatikov (2005) (2 citations) (Correct)
No context found.
D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In Proc. 1st TCC, pages 133--151, 2004.
Limits of the Cryptographic Realization of Dolev-Yao-style XOR - Backes, Pfitzmann (2005) (Correct)
No context found.
D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In Proc. 1st Theory of Cryptography Conference (TCC), volume 2951 of Lecture Notes in Computer Science, pages 133--151. Springer, 2004.
(De)Compositions of Cryptographic Schemes and their.. - Janvier, Lakhnech.. (2005) (Correct)
No context found.
D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In Proceedings of the Theory of Cryptography Conference, pages 133--151, 2004. (document), 4.3, 4.3
Guessing Attacks in the pi-calculus with a Computational.. - Chothia (2005) (Correct)
No context found.
D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In Proceedings of the Theory of Cryptography Conference, pages 133--155. Springer, 2004.
Guessing Attacks in the pi-calculus with a Computational.. - Chothia (Correct)
No context found.
D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In Proceedings of the Theory of Cryptography Conference, pages 133--155. Springer, 2004.
A Cryptographically Sound Dolev-Yao Style Security Proof of the.. - Backes (2004) (Correct)
No context found.
D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In Proc. 1st Theory of Cryptography Conference (TCC), volume 2951 of LNCS, pages 133--151. Springer, 2004.
Universally Composable Symbolic Analysis of Cryptographic.. - Canetti, Herzog (2005) (7 citations) (Correct)
No context found.
Daniele Micciancio and Bogdan Warinschi. Soundness of formal encryption in the presence of active adversaries. In Proceedings, Theory of Cryptography Conference, number 2951 in Lecture Notes in Computer Science, pages 133--151. Springer, February 2004.
Low-level Ideal Signatures and General Integrity Idealization - Backes, Pfitzmann, Waidner (2004) (1 citation) (Correct)
No context found.
D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In Proc. 1st Theory of Cryptography Conference (TCC), volume 2951 of LNCS, pages 133--151. Springer, 2004.
Computational Soundness for Standard Assumptions of Formal.. - Herzog (2004) (3 citations) (Correct)
No context found.
Daniele Micciancio and Bogdan Warinschi. Soundness of formal encryption in the presence of active adversaries. In Proceedings, Theory of Cryptography Conference, number 2951 in Lecture Notes in Computer Science, pages 133--151. Springer, February 2004.
New Tools in Cryptography: Mutually Independent Commitments.. - Liskov (2004) (Correct)
No context found.
Daniele Micciancio and Bogdan Warinschi. Soundness of formal encryption in the presence of active adversaries. In Moni Naor, editor, Theory of Cryptography -- TCC 2004.
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