 | 2009 |
| 26 |  | Pooya Farshim,
Bogdan Warinschi:
Certified Encryption Revisited.
AFRICACRYPT 2009: 179-197 |
| 25 |  | Laurent Mazaré,
Bogdan Warinschi:
Separating Trace Mapping and Reactive Simulatability Soundness: The Case of Adaptive Corruption.
ARSPA-WITS 2009: 193-210 |
| 24 |  | Nigel P. Smart,
Bogdan Warinschi:
Identity Based Group Signatures from Hierarchical Identity-Based Encryption.
Pairing 2009: 150-170 |
| 2008 |
| 23 |  | Paul Morrissey,
Nigel P. Smart,
Bogdan Warinschi:
A Modular Security Analysis of the TLS Handshake Protocol.
ASIACRYPT 2008: 55-73 |
| 22 |  | Martín Abadi,
Bogdan Warinschi:
Security analysis of cryptographically controlled access to XML documents.
J. ACM 55(2): (2008) |
| 2007 |
| 21 |  | 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 |  | Véronique Cortier,
Bogdan Warinschi,
Eugen Zalinescu:
Synthesizing Secure Protocols.
ESORICS 2007: 406-421 |
| 19 |  | 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 |  | Alexandra Boldyreva,
Marc Fischlin,
Adriana Palacio,
Bogdan Warinschi:
A Closer Look at PKI: Security and Efficiency.
Public Key Cryptography 2007: 458-475 |
| 17 |  | 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 |  | Anupam Datta,
Ante Derek,
John C. Mitchell,
Bogdan Warinschi:
Computationally Sound Compositional Logic for Key Exchange Protocols.
CSFW 2006: 321-334 |
| 15 |  | 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 |  | Martín Abadi,
Mathieu Baudet,
Bogdan Warinschi:
Guessing Attacks and the Computational Soundness of Static Equivalence.
FoSSaCS 2006: 398-412 |
| 13 |  | Véronique Cortier,
Heinrich Hördegen,
Bogdan Warinschi:
Explicit Randomness is not Necessary when Modeling Probabilistic Encryption
CoRR abs/cs/0606030: (2006) |
| 2005 |
| 12 |  | Véronique Cortier,
Bogdan Warinschi:
Computationally Sound, Automated Proofs for Security Protocols.
ESOP 2005: 157-171 |
| 11 |  | Martín Abadi,
Bogdan Warinschi:
Password-Based Encryption Analyzed.
ICALP 2005: 664-676 |
| 10 |  | Martín Abadi,
Bogdan Warinschi:
Security analysis of cryptographically controlled access to XML documents.
PODS 2005: 108-117 |
| 9 |  | Bogdan Warinschi:
A computational analysis of the Needham-Schroeder-(Lowe) protocol.
Journal of Computer Security 13(3): 565-591 (2005) |
| 2004 |
| 8 |  | Michel Abdalla,
Bogdan Warinschi:
On the Minimal Assumptions of Group Signature Schemes.
ICICS 2004: 1-13 |
| 7 |  | Jan Camenisch,
Maciej Koprowski,
Bogdan Warinschi:
Efficient Blind Signatures Without Random Oracles.
SCN 2004: 134-148 |
| 6 |  | 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 |  | Bogdan Warinschi:
A Computational Analysis of the Needham-Schröeder-(Lowe) Protocol.
CSFW 2003: 248- |
| 3 |  | 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 |  | Daniele Micciancio,
Bogdan Warinschi:
A linear space algorithm for computing the herite normal form.
ISSAC 2001: 231-236 |
| 2000 |
| 1 |  | Daniele Micciancio,
Bogdan Warinschi:
A Linear Space Algorithm for Computing the Hermite Normal Form
Electronic Colloquium on Computational Complexity (ECCC) 7(74): (2000) |