Bogdan Warinschi

2008
23	EE	Paul Morrissey, Nigel P. Smart, Bogdan Warinschi: A Modular Security Analysis of the TLS Handshake Protocol. ASIACRYPT 2008: 55-73
22	EE	Martín Abadi, Bogdan Warinschi: Security analysis of cryptographically controlled access to XML documents. J. ACM 55(2): (2008)
2007
21	EE	Emmanuel Bresson, Yassine Lakhnech, Laurent Mazaré, Bogdan Warinschi: A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness. CRYPTO 2007: 482-499
20	EE	Véronique Cortier, Bogdan Warinschi, Eugen Zalinescu: Synthesizing Secure Protocols. ESORICS 2007: 406-421
19	EE	Véronique Cortier, Ralf Küsters, Bogdan Warinschi: A Cryptographic Model for Branching Time Security Properties - The Case of Contract Signing Protocols. ESORICS 2007: 422-437
18	EE	Alexandra Boldyreva, Marc Fischlin, Adriana Palacio, Bogdan Warinschi: A Closer Look at PKI: Security and Efficiency. Public Key Cryptography 2007: 458-475
17	EE	Véronique Cortier, Heinrich Hördegen, Bogdan Warinschi: Explicit Randomness is not Necessary when Modeling Probabilistic Encryption. Electr. Notes Theor. Comput. Sci. 186: 49-65 (2007)
2006
16	EE	Anupam Datta, Ante Derek, John C. Mitchell, Bogdan Warinschi: Computationally Sound Compositional Logic for Key Exchange Protocols. CSFW 2006: 321-334
15	EE	Véronique Cortier, Steve Kremer, Ralf Küsters, Bogdan Warinschi: Computationally Sound Symbolic Secrecy in the Presence of Hash Functions. FSTTCS 2006: 176-187
14	EE	Martín Abadi, Mathieu Baudet, Bogdan Warinschi: Guessing Attacks and the Computational Soundness of Static Equivalence. FoSSaCS 2006: 398-412
13	EE	Véronique Cortier, Heinrich Hördegen, Bogdan Warinschi: Explicit Randomness is not Necessary when Modeling Probabilistic Encryption CoRR abs/cs/0606030: (2006)
2005
12	EE	Véronique Cortier, Bogdan Warinschi: Computationally Sound, Automated Proofs for Security Protocols. ESOP 2005: 157-171
11	EE	Martín Abadi, Bogdan Warinschi: Password-Based Encryption Analyzed. ICALP 2005: 664-676
10	EE	Martín Abadi, Bogdan Warinschi: Security analysis of cryptographically controlled access to XML documents. PODS 2005: 108-117
9	EE	Bogdan Warinschi: A computational analysis of the Needham-Schroeder-(Lowe) protocol. Journal of Computer Security 13(3): 565-591 (2005)
2004
8	EE	Michel Abdalla, Bogdan Warinschi: On the Minimal Assumptions of Group Signature Schemes. ICICS 2004: 1-13
7	EE	Jan Camenisch, Maciej Koprowski, Bogdan Warinschi: Efficient Blind Signatures Without Random Oracles. SCN 2004: 134-148
6	EE	Daniele Micciancio, Bogdan Warinschi: Soundness of Formal Encryption in the Presence of Active Adversaries. TCC 2004: 133-151
5		Daniele Micciancio, Bogdan Warinschi: Completeness Theorems for the Abadi-Rogaway Language of Encrypted Expressions. Journal of Computer Security 12(1): 99-130 (2004)
2003
4	EE	Bogdan Warinschi: A Computational Analysis of the Needham-Schröeder-(Lowe) Protocol. CSFW 2003: 248-
3	EE	Mihir Bellare, Daniele Micciancio, Bogdan Warinschi: Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions. EUROCRYPT 2003: 614-629
2001
2	EE	Daniele Micciancio, Bogdan Warinschi: A linear space algorithm for computing the herite normal form. ISSAC 2001: 231-236
2000
1	EE	Daniele Micciancio, Bogdan Warinschi: A Linear Space Algorithm for Computing the Hermite Normal Form Electronic Colloquium on Computational Complexity (ECCC) 7(74): (2000)

Coauthor Index

1	Martín Abadi	[10] [11] [14] [22]
2	Michel Abdalla	[8]
3	Mathieu Baudet	[14]
4	Mihir Bellare	[3]
5	Alexandra Boldyreva	[18]
6	Emmanuel Bresson	[21]
7	Jan Camenisch	[7]
8	Véronique Cortier	[12] [13] [15] [17] [19] [20]
9	Anupam Datta	[16]
10	Ante Derek	[16]
11	Marc Fischlin	[18]
12	Heinrich Hördegen	[13] [17]
13	Maciej Koprowski	[7]
14	Steve Kremer	[15]
15	Ralf Küsters	[15] [19]
16	Yassine Lakhnech	[21]
17	Laurent Mazaré	[21]
18	Daniele Micciancio	[1] [2] [3] [5] [6]
19	John C. Mitchell	[16]
20	Paul Morrissey	[23]
21	Adriana Palacio	[18]
22	Nigel P. Smart	[23]
23	Eugen Zalinescu	[20]

Colors in the list of coauthors