- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| i19 |      | Ming-Feng Lee, Nigel P. Smart, Bogdan Warinschi, Gaven J. Watson: Anonymity Guarantees of the UMTS/LTE Authentication and Connection Protocol. IACR Cryptology ePrint Archive 2013: 27 (2013) |
| i18 | | Christina Brzuska, Nigel P. Smart, Bogdan Warinschi, Gaven J. Watson: An Analysis of the EMV Channel Establishment Protocol. IACR Cryptology ePrint Archive 2013: 31 (2013) |
| 2012 | ||
| j9 | | Alexandra Boldyreva, Adriana Palacio, Bogdan Warinschi: Secure Proxy Signature Schemes for Delegation of Signing Rights. J. Cryptology 25(1): 57-115 (2012) |
| c39 | | David Bernhard, Olivier Pereira, Bogdan Warinschi: How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios. ASIACRYPT 2012: 626-643 |
| c38 | | David Bernhard, Véronique Cortier, Olivier Pereira, Bogdan Warinschi: Measuring vote privacy, revisited. ACM Conference on Computer and Communications Security 2012: 941-952 |
| c37 | | Bogdan Groza, Bogdan Warinschi: Revisiting Difficulty Notions for Client Puzzles and DoS Resilience. ISC 2012: 39-54 |
| c36 | | Dario Catalano, Dario Fiore, Bogdan Warinschi: Efficient Network Coding Signatures in the Standard Model. Public Key Cryptography 2012: 680-696 |
| i17 | | David Bernhard, Olivier Pereira, Bogdan Warinschi: On Necessary and Sufficient Conditions for Private Ballot Submission. IACR Cryptology ePrint Archive 2012: 236 (2012) |
| i16 | | Christina Brzuska, Marc Fischlin, Nigel P. Smart, Bogdan Warinschi, Stephen C. Williams: Less is More: Relaxed yet Composable Security Notions for Key Exchange. IACR Cryptology ePrint Archive 2012: 242 (2012) |
| 2011 | ||
| j8 | | Véronique Cortier, Steve Kremer, Bogdan Warinschi: A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems. J. Autom. Reasoning 46(3-4): 225-259 (2011) |
| c35 | | Christina Brzuska, Marc Fischlin, Bogdan Warinschi, Stephen C. Williams: Composability of bellare-rogaway key exchange protocols. ACM Conference on Computer and Communications Security 2011: 51-62 |
| c34 | | Véronique Cortier, Bogdan Warinschi: A composable computational soundness notion. ACM Conference on Computer and Communications Security 2011: 63-74 |
| c33 | | Steve Kremer, Graham Steel, Bogdan Warinschi: Security for Key Management Interfaces. CSF 2011: 266-280 |
| c32 | | David Bernhard, Véronique Cortier, Olivier Pereira, Ben Smyth, Bogdan Warinschi: Adapting Helios for Provable Ballot Privacy. ESORICS 2011: 335-354 |
| c31 | | Dario Catalano, Dario Fiore, Bogdan Warinschi: Adaptive Pseudo-free Groups and Applications. EUROCRYPT 2011: 207-223 |
| c30 | | Liqun Chen, Ming-Feng Lee, Bogdan Warinschi: Security of the Enhanced TCG Privacy-CA Solution. TGC 2011: 121-141 |
| i15 | | Dario Catalano, Dario Fiore, Bogdan Warinschi: Adaptive Pseudo-Free Groups and Applications. IACR Cryptology ePrint Archive 2011: 53 (2011) |
| i14 | | David Bernhard, Georg Fuchsbauer, Essam Ghadafi, Nigel P. Smart, Bogdan Warinschi: Anonymous attestation with user-controlled linkability. IACR Cryptology ePrint Archive 2011: 658 (2011) |
| i13 | | Dario Catalano, Dario Fiore, Bogdan Warinschi: Efficient Network Coding Signatures in the Standard Model. IACR Cryptology ePrint Archive 2011: 696 (2011) |
| 2010 | ||
| j7 | | Mathieu Baudet, Bogdan Warinschi, Martín Abadi: Guessing attacks and the computational soundness of static equivalence. Journal of Computer Security 18(5): 909-968 (2010) |
| j6 | | Paul Morrissey, Nigel P. Smart, Bogdan Warinschi: The TLS Handshake Protocol: A Modular Analysis. J. Cryptology 23(2): 187-223 (2010) |
| c29 | | Gilles Barthe, Alejandro Hevia, Zhengqin Luo, Tamara Rezk, Bogdan Warinschi: Robustness Guarantees for Anonymity. CSF 2010: 91-106 |
| c28 | | |
| c27 | | Essam Ghadafi, Nigel P. Smart, Bogdan Warinschi: Groth-Sahai Proofs Revisited. Public Key Cryptography 2010: 177-192 |
| c26 | | Ming-Feng Lee, Nigel P. Smart, Bogdan Warinschi: The Fiat-Shamir Transform for Group and Ring Signature Schemes. SCN 2010: 363-380 |
| c25 | | Patrik Bichsel, Jan Camenisch, Gregory Neven, Nigel P. Smart, Bogdan Warinschi: Get Shorty via Group Signatures without Encryption. SCN 2010: 381-398 |
| i12 | | Ming-Feng Lee, Nigel P. Smart, Bogdan Warinschi: The Fiat-Shamir Transform for Group and Ring Signature Schemes. IACR Cryptology ePrint Archive 2010: 358 (2010) |
| 2009 | ||
| j5 | | Gregory Neven, Nigel P. Smart, Bogdan Warinschi: Hash function requirements for Schnorr signatures. J. Mathematical Cryptology 3(1): 69-87 (2009) |
| c24 | | |
| c23 | | Liqun Chen, Paul Morrissey, Nigel P. Smart, Bogdan Warinschi: Security Notions and Generic Constructions for Client Puzzles. ASIACRYPT 2009: 505-523 |
| c22 | | Alexandra Boldyreva, David Cash, Marc Fischlin, Bogdan Warinschi: Foundations of Non-malleable Hash and One-Way Functions. ASIACRYPT 2009: 524-541 |
| c21 | | Laurent Mazaré, Bogdan Warinschi: Separating Trace Mapping and Reactive Simulatability Soundness: The Case of Adaptive Corruption. ARSPA-WITS 2009: 193-210 |
| c20 | | Essam Ghadafi, Nigel P. Smart, Bogdan Warinschi: Practical Zero-Knowledge Proofs for Circuit Evaluation. IMA Int. Conf. 2009: 469-494 |
| c19 | | Nigel P. Smart, Bogdan Warinschi: Identity Based Group Signatures from Hierarchical Identity-Based Encryption. Pairing 2009: 150-170 |
| c18 | | |
| i11 | | Alexandra Boldyreva, David Cash, Marc Fischlin, Bogdan Warinschi: Foundations of Non-Malleable Hash and One-Way Functions. IACR Cryptology ePrint Archive 2009: 65 (2009) |
| i10 | | Nigel P. Smart, Bogdan Warinschi: Identity Based Group Signatures from Hierarchical Identity-Based Encryption. IACR Cryptology ePrint Archive 2009: 313 (2009) |
| i9 | | Liqun Chen, Paul Morrissey, Nigel P. Smart, Bogdan Warinschi: Security Notions and Generic Constructions for Client Puzzles. IACR Cryptology ePrint Archive 2009: 331 (2009) |
| i8 | | Essam Ghadafi, Nigel P. Smart, Bogdan Warinschi: Groth-Sahai proofs revisited. IACR Cryptology ePrint Archive 2009: 599 (2009) |
| 2008 | ||
| j4 | | Martín Abadi, Bogdan Warinschi: Security analysis of cryptographically controlled access to XML documents. J. ACM 55(2) (2008) |
| c17 | | Paul Morrissey, Nigel P. Smart, Bogdan Warinschi: A Modular Security Analysis of the TLS Handshake Protocol. ASIACRYPT 2008: 55-73 |
| i7 | | Paul Morrissey, Nigel P. Smart, Bogdan Warinschi: A Modular Security Analysis of the TLS Handshake Protocol. IACR Cryptology ePrint Archive 2008: 236 (2008) |
| 2007 | ||
| j3 | | 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) |
| c16 | | Emmanuel Bresson, Yassine Lakhnech, Laurent Mazaré, Bogdan Warinschi: A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness. CRYPTO 2007: 482-499 |
| c15 | | Véronique Cortier, Bogdan Warinschi, Eugen Zalinescu: Synthesizing Secure Protocols. ESORICS 2007: 406-421 |
| c14 | | 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 |
| c13 | | Alexandra Boldyreva, Marc Fischlin, Adriana Palacio, Bogdan Warinschi: A Closer Look at PKI: Security and Efficiency. Public Key Cryptography 2007: 458-475 |
| i6 | | Véronique Cortier, Ralf Küsters, Bogdan Warinschi: A Cryptographic Model for Branching Time Security Properties - the Case of Contract Signing Protocols. IACR Cryptology ePrint Archive 2007: 251 (2007) |
| 2006 | ||
| c12 | | Anupam Datta, Ante Derek, John C. Mitchell, Bogdan Warinschi: Computationally Sound Compositional Logic for Key Exchange Protocols. CSFW 2006: 321-334 |
| c11 | | Martín Abadi, Mathieu Baudet, Bogdan Warinschi: Guessing Attacks and the Computational Soundness of Static Equivalence. FoSSaCS 2006: 398-412 |
| c10 | | Véronique Cortier, Steve Kremer, Ralf Küsters, Bogdan Warinschi: Computationally Sound Symbolic Secrecy in the Presence of Hash Functions. FSTTCS 2006: 176-187 |
| i5 | | Véronique Cortier, Heinrich Hördegen, Bogdan Warinschi: Explicit Randomness is not Necessary when Modeling Probabilistic Encryption. CoRR abs/cs/0606030 (2006) |
| i4 | | Anupam Datta, Ante Derek, John C. Mitchell, Bogdan Warinschi: Key Exchange Protocols: Security Definition, Proof Method and Applications. IACR Cryptology ePrint Archive 2006: 56 (2006) |
| i3 | | Véronique Cortier, Steve Kremer, Ralf Küsters, Bogdan Warinschi: Computationally Sound Symbolic Secrecy in the Presence of Hash Functions. IACR Cryptology ePrint Archive 2006: 218 (2006) |
| 2005 | ||
| j2 | | Bogdan Warinschi: A computational analysis of the Needham-Schroeder-(Lowe) protocol. Journal of Computer Security 13(3): 565-591 (2005) |
| c9 | | Véronique Cortier, Bogdan Warinschi: Computationally Sound, Automated Proofs for Security Protocols. ESOP 2005: 157-171 |
| c8 | | |
| c7 | | Martín Abadi, Bogdan Warinschi: Security analysis of cryptographically controlled access to XML documents. PODS 2005: 108-117 |
| 2004 | ||
| j1 | | Daniele Micciancio, Bogdan Warinschi: Completeness Theorems for the Abadi-Rogaway Language of Encrypted Expressions. Journal of Computer Security 12(1): 99-130 (2004) |
| c6 | | Michel Abdalla, Bogdan Warinschi: On the Minimal Assumptions of Group Signature Schemes. ICICS 2004: 1-13 |
| c5 | | Jan Camenisch, Maciej Koprowski, Bogdan Warinschi: Efficient Blind Signatures Without Random Oracles. SCN 2004: 134-148 |
| c4 | | Daniele Micciancio, Bogdan Warinschi: Soundness of Formal Encryption in the Presence of Active Adversaries. TCC 2004: 133-151 |
| 2003 | ||
| c3 | | Bogdan Warinschi: A Computational Analysis of the Needham-Schröeder-(Lowe) Protocol. CSFW 2003: 248- |
| c2 | | 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 |
| i2 | | Alexandra Boldyreva, Adriana Palacio, Bogdan Warinschi: Secure Proxy Signature Schemes for Delegation of Signing Rights. IACR Cryptology ePrint Archive 2003: 96 (2003) |
| 2001 | ||
| c1 | | Daniele Micciancio, Bogdan Warinschi: A linear space algorithm for computing the herite normal form. ISSAC 2001: 231-236 |
| 2000 | ||
| i1 | | Daniele Micciancio, Bogdan Warinschi: A Linear Space Algorithm for Computing the Hermite Normal Form. Electronic Colloquium on Computational Complexity (ECCC) 7(74) (2000) |
Data released under the ODC-BY 1.0 license — See also our legal information page