Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDBogdan Warinschi
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[c68]Véronique Cortier, Joseph Lallemand, Bogdan Warinschi:
Fifty Shades of Ballot Privacy: Privacy against a Malicious Board. CSF 2020: 17-32- [c67]Cyprien Delpech de Saint Guilhem, Marc Fischlin, Bogdan Warinschi:
Authentication in Key-Exchange: Definitions, Relations and Composition. CSF 2020: 288-303 - [i45]Véronique Cortier, Joseph Lallemand, Bogdan Warinschi:
Fifty Shades of Ballot Privacy: Privacy against a Malicious Board. IACR Cryptol. ePrint Arch. 2020: 127 (2020) - [i44]Shan Chen, Manuel Barbosa, Alexandra Boldyreva, Bogdan Warinschi:
Provable Security Analysis of FIDO2. IACR Cryptol. ePrint Arch. 2020: 756 (2020) - [i43]Zichen Gui, Kenneth G. Paterson, Sikhar Patranabis, Bogdan Warinschi:
SWiSSSE: System-Wide Security for Searchable Symmetric Encryption. IACR Cryptol. ePrint Arch. 2020: 1328 (2020)
2010 – 2019
- 2019
- [c66]Alexandra Boldyreva, Tianxin Tang, Bogdan Warinschi:
Masking Fuzzy-Searchable Public Databases. ACNS 2019: 571-591 - [c65]Zichen Gui, Oliver Johnson
, Bogdan Warinschi:
Encrypted Databases: New Volume Attacks against Range Queries. CCS 2019: 361-378 - [c64]Manuel Barbosa, Dario Catalano, Azam Soleimanian, Bogdan Warinschi:
Efficient Function-Hiding Functional Encryption: From Inner-Products to Orthogonality. CT-RSA 2019: 127-148 - [i42]Alexandra Boldyreva, Tianxin Tang, Bogdan Warinschi:
Masking Fuzzy-Searchable Public Databases. IACR Cryptol. ePrint Arch. 2019: 434 (2019) - [i41]Zichen Gui, Oliver Johnson, Bogdan Warinschi:
Encrypted Databases: New Volume Attacks against Range Queries. IACR Cryptol. ePrint Arch. 2019: 1198 (2019) - [i40]Cyprien Delpech de Saint Guilhem, Marc Fischlin, Bogdan Warinschi:
Authentication in Key-Exchange: Definitions, Relations and Composition. IACR Cryptol. ePrint Arch. 2019: 1203 (2019) - 2018
- [j15]Jia Liu, Tibor Jager, Saqib A. Kakvi, Bogdan Warinschi:
How to build time-lock encryption. Des. Codes Cryptogr. 86(11): 2549-2586 (2018) - [c63]Véronique Cortier, Constantin Catalin Dragan, François Dupressoir, Bogdan Warinschi:
Machine-Checked Proofs for Electronic Voting: Privacy and Verifiability for Belenios. CSF 2018: 298-312 - [c62]Dirk van der Linden, Awais Rashid, Emma J. Williams, Bogdan Warinschi:
Safe cryptography for all: towards visual metaphor driven cryptography building blocks. SEAD@ICSE 2018: 41-44 - [i39]David Bernhard, Véronique Cortier, Pierrick Gaudry, Mathieu Turuani, Bogdan Warinschi:
Verifiability Analysis of CHVote. IACR Cryptol. ePrint Arch. 2018: 1052 (2018) - 2017
- [c61]David Bernhard, Ngoc Khanh Nguyen, Bogdan Warinschi:
Adaptive Proofs Have Straightline Extractors (in the Random Oracle Model). ACNS 2017: 336-353 - [c60]Vincent Cheval, Véronique Cortier, Bogdan Warinschi:
Secure Composition of PKIs with Public Key Protocols. CSF 2017: 144-158 - [c59]Raad Bahmani, Manuel Barbosa, Ferdinand Brasser, Bernardo Portela, Ahmad-Reza Sadeghi, Guillaume Scerri, Bogdan Warinschi:
Secure Multiparty Computation from SGX. Financial Cryptography 2017: 477-497 - [c58]Cyprien de Saint Guilhem, Nigel P. Smart, Bogdan Warinschi:
Generic Forward-Secure Key Agreement Without Signatures. ISC 2017: 114-133 - [c57]Véronique Cortier, Constantin Catalin Dragan, François Dupressoir, Benedikt Schmidt, Pierre-Yves Strub, Bogdan Warinschi:
Machine-Checked Proofs of Privacy for Electronic Voting Protocols. IEEE Symposium on Security and Privacy 2017: 993-1008 - [c56]Tibor Jager, Martijn Stam, Ryan Stanley-Oakes, Bogdan Warinschi:
Multi-key Authenticated Encryption with Corruptions: Reductions Are Lossy. TCC (1) 2017: 409-441 - [i38]Tibor Jager, Martijn Stam, Ryan Stanley-Oakes, Bogdan Warinschi:
Multi-Key Authenticated Encryption with Corruptions: Reductions are Lossy. IACR Cryptol. ePrint Arch. 2017: 495 (2017) - [i37]Cyprien de Saint Guilhem, Nigel P. Smart, Bogdan Warinschi:
Generic Forward-Secure Key Agreement Without Signatures. IACR Cryptol. ePrint Arch. 2017: 853 (2017) - 2016
- [j14]David Bernhard, Marc Fischlin, Bogdan Warinschi:
Adaptive proofs of knowledge in the random oracle model. IET Inf. Secur. 10(6): 319-331 (2016) - [c55]Thomas Shrimpton, Martijn Stam, Bogdan Warinschi:
A Modular Treatment of Cryptographic APIs: The Symmetric-Key Case. CRYPTO (1) 2016: 277-307 - [c54]Sergiu Costea, Bogdan Warinschi:
Secure Software Licensing: Models, Constructions, and Proofs. CSF 2016: 31-44 - [c53]Manuel Barbosa, Bernardo Portela, Guillaume Scerri, Bogdan Warinschi:
Foundations of Hardware-Based Attested Computation and Application to SGX. EuroS&P 2016: 245-260 - [c52]David Bernhard, Marc Fischlin, Bogdan Warinschi:
On the Hardness of Proving CCA-Security of Signed ElGamal. Public Key Cryptography (1) 2016: 47-69 - [c51]Bin Liu, Bogdan Warinschi:
Universally Composable Cryptographic Role-Based Access Control. ProvSec 2016: 61-80 - [c50]Alexandra Boldyreva, Taesoo Kim, Richard J. Lipton, Bogdan Warinschi:
Provably-Secure Remote Memory Attestation for Heap Overflow Protection. SCN 2016: 83-103 - [c49]Marc Fischlin, Felix Günther, Benedikt Schmidt, Bogdan Warinschi:
Key Confirmation in Key Exchange: A Formal Treatment and Implications for TLS 1.3. IEEE Symposium on Security and Privacy 2016: 452-469 - [i36]Manuel Barbosa, Bernardo Portela, Guillaume Scerri, Bogdan Warinschi:
Foundations of Hardware-Based Attested Computation and Application to SGX. IACR Cryptol. ePrint Arch. 2016: 14 (2016) - [i35]Thomas Shrimpton, Martijn Stam, Bogdan Warinschi:
A Modular Treatment of Cryptographic APIs: The Symmetric-Key Case. IACR Cryptol. ePrint Arch. 2016: 586 (2016) - [i34]David Bernhard, Véronique Cortier, Olivier Pereira, Ben Smyth, Bogdan Warinschi:
Adapting Helios for provable ballot privacy. IACR Cryptol. ePrint Arch. 2016: 756 (2016) - [i33]David Bernhard, Bogdan Warinschi:
Cryptographic Voting - A Gentle Introduction. IACR Cryptol. ePrint Arch. 2016: 765 (2016) - [i32]David Bernhard, Olivier Pereira, Bogdan Warinschi:
How not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios. IACR Cryptol. ePrint Arch. 2016: 771 (2016) - [i31]Bin Liu, Bogdan Warinschi:
Universally Composable Cryptographic Role-Based Access Control. IACR Cryptol. ePrint Arch. 2016: 902 (2016) - [i30]Raad Bahmani, Manuel Barbosa, Ferdinand Brasser, Bernardo Portela, Ahmad-Reza Sadeghi, Guillaume Scerri, Bogdan Warinschi:
Secure Multiparty Computation from SGX. IACR Cryptol. ePrint Arch. 2016: 1057 (2016) - 2015
- [c48]Carmit Hazay, Arpita Patra, Bogdan Warinschi:
Selective Opening Security for Receivers. ASIACRYPT (1) 2015: 443-469 - [c47]Anna Lisa Ferrara, Georg Fuchsbauer, Bin Liu, Bogdan Warinschi:
Policy Privacy in Cryptographic Access Control. CSF 2015: 46-60 - [c46]David Bernhard, Marc Fischlin, Bogdan Warinschi:
Adaptive Proofs of Knowledge in the Random Oracle Model. Public Key Cryptography 2015: 629-649 - [c45]David Bernhard, Véronique Cortier, David Galindo, Olivier Pereira, Bogdan Warinschi:
SoK: A Comprehensive Analysis of Game-Based Ballot Privacy Definitions. IEEE Symposium on Security and Privacy 2015: 499-516 - [i29]David Bernhard, Véronique Cortier, David Galindo, Olivier Pereira, Bogdan Warinschi:
A comprehensive analysis of game-based ballot privacy definitions. IACR Cryptol. ePrint Arch. 2015: 255 (2015) - [i28]Jia Liu, Saqib A. Kakvi, Bogdan Warinschi:
Extractable Witness Encryption and Timed-Release Encryption from Bitcoin. IACR Cryptol. ePrint Arch. 2015: 482 (2015) - [i27]David Bernhard, Marc Fischlin, Bogdan Warinschi:
Adaptive Proofs of Knowledge in the Random Oracle Model. IACR Cryptol. ePrint Arch. 2015: 648 (2015) - [i26]David Bernhard, Marc Fischlin, Bogdan Warinschi:
On the Hardness of Proving CCA-security of Signed ElGamal. IACR Cryptol. ePrint Arch. 2015: 649 (2015) - [i25]David Bernhard, Bogdan Warinschi:
On Limitations of the Fiat - Shamir Transformation. IACR Cryptol. ePrint Arch. 2015: 712 (2015) - [i24]Alexandra Boldyreva, Taesoo Kim, Richard J. Lipton, Bogdan Warinschi:
Towards Provably-Secure Remote Memory Attestation. IACR Cryptol. ePrint Arch. 2015: 729 (2015) - [i23]Carmit Hazay, Arpita Patra, Bogdan Warinschi:
Selective Opening Security for Receivers. IACR Cryptol. ePrint Arch. 2015: 860 (2015) - 2014
- [j13]Bogdan Groza, Bogdan Warinschi:
Cryptographic puzzles and DoS resilience, revisited. Des. Codes Cryptogr. 73(1): 177-207 (2014) - [j12]Ming-Feng Lee, Nigel P. Smart, Bogdan Warinschi, Gaven J. Watson:
Anonymity guarantees of the UMTS/LTE authentication and connection protocol. Int. J. Inf. Sec. 13(6): 513-527 (2014) - [c44]Dario Catalano, Dario Fiore, Bogdan Warinschi:
Homomorphic Signatures with Efficient Verification for Polynomial Functions. CRYPTO (1) 2014: 371-389 - [i22]Dario Catalano, Dario Fiore, Bogdan Warinschi:
Homomorphic Signatures with Efficient Verification for Polynomial Functions. IACR Cryptol. ePrint Arch. 2014: 469 (2014) - 2013
- [j11]David Bernhard, Georg Fuchsbauer, Essam Ghadafi, Nigel P. Smart, Bogdan Warinschi:
Anonymous attestation with user-controlled linkability. Int. J. Inf. Sec. 12(3): 219-249 (2013) - [j10]Christina Brzuska, Marc Fischlin, Nigel P. Smart, Bogdan Warinschi, Stephen C. Williams:
Less is more: relaxed yet composable security notions for key exchange. Int. J. Inf. Sec. 12(4): 267-297 (2013) - [c43]Christina Brzuska, Nigel P. Smart, Bogdan Warinschi, Gaven J. Watson:
An analysis of the EMV channel establishment protocol. CCS 2013: 373-386 - [c42]Florian Böhl, Véronique Cortier, Bogdan Warinschi:
Deduction soundness: prove one, get five for free. CCS 2013: 1261-1272 - [c41]Anna Lisa Ferrara, Georg Fuchsbauer, Bogdan Warinschi:
Cryptographically Enforced RBAC. CSF 2013: 115-129 - [c40]David Bernhard, Bogdan Warinschi:
Cryptographic Voting - A Gentle Introduction. FOSAD 2013: 167-211 - [i21]Ming-Feng Lee, Nigel P. Smart, Bogdan Warinschi, Gaven J. Watson:
Anonymity Guarantees of the UMTS/LTE Authentication and Connection Protocol. IACR Cryptol. ePrint Arch. 2013: 27 (2013) - [i20]Christina Brzuska, Nigel P. Smart, Bogdan Warinschi, Gaven J. Watson:
An Analysis of the EMV Channel Establishment Protocol. IACR Cryptol. ePrint Arch. 2013: 31 (2013) - [i19]Florian Böhl, Véronique Cortier, Bogdan Warinschi:
Deduction Soundness: Prove One, Get Five for Free. IACR Cryptol. ePrint Arch. 2013: 457 (2013) - [i18]Anna Lisa Ferrara, Georg Fuchsbauer, Bogdan Warinschi:
Cryptographically Enforced RBAC. IACR Cryptol. ePrint Arch. 2013: 492 (2013) - 2012
- [j9]Alexandra Boldyreva, Adriana Palacio, Bogdan Warinschi:
Secure Proxy Signature Schemes for Delegation of Signing Rights. J. Cryptol. 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. CCS 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 Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 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. Reason. 46(3-4): 225-259 (2011) - [c35]Christina Brzuska, Marc Fischlin, Bogdan Warinschi, Stephen C. Williams:
Composability of bellare-rogaway key exchange protocols. CCS 2011: 51-62 - [c34]Véronique Cortier, Bogdan Warinschi:
A composable computational soundness notion. CCS 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 - [p1]Emmanuel Bresson, Yassine Lakhnech, Laurent Mazaré, Bogdan Warinschi:
Computational Soundness - The Case of Diffie-Hellman Keys. Formal Models and Techniques for Analyzing Security Protocols 2011: 277-302 - [i15]Dario Catalano, Dario Fiore, Bogdan Warinschi:
Adaptive Pseudo-Free Groups and Applications. IACR Cryptol. ePrint Arch. 2011: 53 (2011) - [i14]David Bernhard, Georg Fuchsbauer, Essam Ghadafi, Nigel P. Smart, Bogdan Warinschi:
Anonymous attestation with user-controlled linkability. IACR Cryptol. ePrint Arch. 2011: 658 (2011) - [i13]Dario Catalano, Dario Fiore, Bogdan Warinschi:
Efficient Network Coding Signatures in the Standard Model. IACR Cryptol. ePrint Arch. 2011: 696 (2011) - 2010
- [j7]Mathieu Baudet, Bogdan Warinschi, Martín Abadi:
Guessing attacks and the computational soundness of static equivalence. J. Comput. Secur. 18(5): 909-968 (2010) - [j6]Paul Morrissey, Nigel P. Smart, Bogdan Warinschi:
The TLS Handshake Protocol: A Modular Analysis. J. Cryptol. 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]Liqun Chen, Bogdan Warinschi:
Security of the TCG Privacy-CA Solution. EUC 2010: 609-616 - [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 Cryptol. ePrint Arch. 2010: 358 (2010)
2000 – 2009
- 2009
- [j5]Gregory Neven, Nigel P. Smart, Bogdan Warinschi:
Hash function requirements for Schnorr signatures. J. Math. Cryptol. 3(1): 69-87 (2009) - [c24]Pooya Farshim, Bogdan Warinschi:
Certified Encryption Revisited. AFRICACRYPT 2009: 179-197 - [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. IMACC 2009: 469-494 - [c19]Nigel P. Smart, Bogdan Warinschi:
Identity Based Group Signatures from Hierarchical Identity-Based Encryption. Pairing 2009: 150-170 - [c18]Bogdan Warinschi:
Symbolic Methods for Provable Security. ProvSec 2009: 2 - [i11]Alexandra Boldyreva, David Cash, Marc Fischlin, Bogdan Warinschi:
Foundations of Non-Malleable Hash and One-Way Functions. IACR Cryptol. ePrint Arch. 2009: 65 (2009) - [i10]Nigel P. Smart, Bogdan Warinschi:
Identity Based Group Signatures from Hierarchical Identity-Based Encryption. IACR Cryptol. ePrint Arch. 2009: 313 (2009) - [i9]Liqun Chen, Paul Morrissey, Nigel P. Smart, Bogdan Warinschi:
Security Notions and Generic Constructions for Client Puzzles. IACR Cryptol. ePrint Arch. 2009: 331 (2009) - [i8]Essam Ghadafi, Nigel P. Smart, Bogdan Warinschi:
Groth-Sahai proofs revisited. IACR Cryptol. ePrint Arch. 2009: 599 (2009) - 2008
- [j4]Martín Abadi, Bogdan Warinschi:
Security analysis of cryptographically controlled access to XML documents. J. ACM 55(2): 6:1-6:29 (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 Cryptol. ePrint Arch. 2008: 236 (2008) - 2007
- [j3]Véronique Cortier, Heinrich Hördegen, Bogdan Warinschi:
Explicit Randomness is not Necessary when Modeling Probabilistic Encryption. Electron. 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 Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 2006: 218 (2006) - 2005
- [j2]Bogdan Warinschi:
A computational analysis of the Needham-Schroeder-(Lowe) protocol. J. Comput. Secur. 13(3): 565-591 (2005) - [c9]Véronique Cortier, Bogdan Warinschi:
Computationally Sound, Automated Proofs for Security Protocols. ESOP 2005: 157-171 - [c8]Martín Abadi, Bogdan Warinschi:
Password-Based Encryption Analyzed. ICALP 2005: 664-676 - [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. J. Comput. Secur. 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 Cryptol. ePrint Arch. 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. Electron. Colloquium Comput. Complex. 7(74) (2000)
Coauthor Index