Bogdan Warinschi, Ph.D. - Publications

Affiliations: 
2004 University of California, San Diego, La Jolla, CA 
Area:
Computer Science

54 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Guilhem CDdS, Fischlin M, Warinschi B. Authentication in Key-Exchange: Definitions, Relations and Composition Cell Structure and Function. 288-303. DOI: 10.1109/Csf49147.2020.00028  0.517
2020 Cortier V, Lallemand J, Warinschi B. Fifty Shades of Ballot Privacy: Privacy against a Malicious Board Cell Structure and Function. 17-32. DOI: 10.1109/Csf49147.2020.00010  0.501
2018 Liu J, Jager T, Kakvi SA, Warinschi B. How to build time-lock encryption Designs, Codes and Cryptography. 86: 2549-2586. DOI: 10.1007/S10623-018-0461-X  0.464
2016 Fischlin M, Günther F, Schmidt B, Warinschi B. 2016 IEEE Symposium on Security and Privacy (S&P 2016) The Institute of Electrical and Electronics Engineers. DOI: 10.1109/Sp.2016.34  0.388
2016 Bernhard D, Fischlin M, Warinschi B. On the hardness of proving CCA-security of signed ElGamal Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9614: 47-69. DOI: 10.1007/978-3-662-49384-7_3  0.433
2015 Bernhard D, Cortier V, Galindo D, Pereira O, Warinschi B. SoK: A comprehensive analysis of game-based ballot privacy definitions Proceedings - Ieee Symposium On Security and Privacy. 2015: 499-516. DOI: 10.1109/SP.2015.37  0.44
2015 Bernhard D, Fischlin M, Warinschi B. Adaptive proofs of knowledge in the random oracle model Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9020: 629-649. DOI: 10.1049/Iet-Ifs.2015.0506  0.493
2015 Hazay C, Patra A, Warinschi B. Selective opening security for receivers Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9452: 443-469. DOI: 10.1007/978-3-662-48797-6_19  0.441
2014 Groza B, Warinschi B. Cryptographic puzzles and DoS resilience, revisited Designs, Codes, and Cryptography. 73: 177-207. DOI: 10.1007/S10623-013-9816-5  0.53
2014 Lee MF, Smart NP, Warinschi B, Watson GJ. Anonymity guarantees of the UMTS/LTE authentication and connection protocol International Journal of Information Security. 13: 513-527. DOI: 10.1007/S10207-014-0231-3  0.464
2014 Catalano D, Fiore D, Warinschi B. Homomorphic signatures with efficient verification for polynomial functions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8616: 371-389. DOI: 10.1007/978-3-662-44371-2_21  0.394
2014 Bernhard D, Warinschi B. Cryptographic voting — a gentle introduction Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8604: 167-211.  0.335
2013 Böhl F, Cortier V, Warinschi B. Deduction soundness: Prove one, get five for free Proceedings of the Acm Conference On Computer and Communications Security. 1261-1272. DOI: 10.1145/2508859.2516711  0.34
2013 Ferrara AL, Fuchsbauer G, Warinschi B. Cryptographically enforced RBAC Proceedings of the Computer Security Foundations Workshop. 115-129. DOI: 10.1109/CSF.2013.15  0.386
2013 Brzuska C, Fischlin M, Smart NP, Warinschi B, Williams SC. Less is more: Relaxed yet composable security notions for key exchange International Journal of Information Security. 12: 267-297. DOI: 10.1007/S10207-013-0192-Y  0.526
2012 Bernhard D, Cortier V, Pereira O, Warinschi B. Measuring vote privacy, revisited Proceedings of the Acm Conference On Computer and Communications Security. 941-952. DOI: 10.1145/2382196.2382295  0.325
2012 Boldyreva A, Palacio A, Warinschi B. Secure proxy signature schemes for delegation of signing rights Journal of Cryptology. 25: 57-115. DOI: 10.1007/S00145-010-9082-X  0.458
2012 Bernhard D, Pereira O, Warinschi B. How not to prove yourself: Pitfalls of the Fiat-Shamir heuristic and applications to Helios Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7658: 626-643. DOI: 10.1007/978-3-642-34961-4_38  0.415
2012 Groza B, Warinschi B. Revisiting difficulty notions for client puzzles and DoS resilience Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7483: 39-54. DOI: 10.1007/978-3-642-33383-5_3  0.462
2012 Chen L, Lee MF, Warinschi B. Security of the enhanced TCG privacy-CA solution Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7173: 121-141. DOI: 10.1007/978-3-642-30065-3_8  0.364
2011 Bresson E, Lakhnech Y, Mazaré L, Warinschi B. Computational soundness: The case of diffie-hellman keys Cryptology and Information Security Series. 5: 277-302. DOI: 10.3233/978-1-60750-714-7-277  0.402
2011 Cortier V, Warinschi B. A composable computational soundness notion Proceedings of the Acm Conference On Computer and Communications Security. 63-74. DOI: 10.1145/2046707.2046717  0.361
2011 Brzuska C, Fischlin M, Warinschi B, Williams SC. Composability of Bellare-Rogaway key exchange protocols Proceedings of the Acm Conference On Computer and Communications Security. 51-61. DOI: 10.1145/2046707.2046716  0.435
2011 Kremer S, Steel G, Warinschi B. Security for key management interfaces Proceedings - Ieee Computer Security Foundations Symposium. 266-280. DOI: 10.1109/CSF.2011.25  0.447
2011 Cortier V, Kremer S, Warinschi B. A survey of symbolic methods in computational analysis of cryptographic systems Journal of Automated Reasoning. 46: 225-259. DOI: 10.1007/S10817-010-9187-9  0.431
2011 Bernhard D, Cortier V, Pereira O, Smyth B, Warinschi B. Adapting helios for provable ballot privacy Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6879: 335-354. DOI: 10.1007/978-3-642-23822-2_19  0.448
2010 Baudet M, Warinschi B, Abadi M. Guessing attacks and the computational soundness of static equivalence Journal of Computer Security. 18: 909-968. DOI: 10.3233/Jcs-2009-0386  0.417
2010 Chen L, Warinschi B. Security of the TCG privacy-CA solution Proceedings - Ieee/Ifip International Conference On Embedded and Ubiquitous Computing, Euc 2010. 609-616. DOI: 10.1109/EUC.2010.98  0.415
2010 Barthe G, Heviay A, Luoz Z, Rezk T, Warinschi B. Robustness guarantees for anonymity Proceedings - Ieee Computer Security Foundations Symposium. 91-106. DOI: 10.1109/CSF.2010.14  0.356
2010 Morrissey P, Smart NP, Warinschi B. The TLS handshake protocol: A modular analysis Journal of Cryptology. 23: 187-223. DOI: 10.1007/S00145-009-9052-3  0.511
2010 Bichsel P, Camenisch J, Neven G, Smart NP, Warinschi B. Get shorty via group signatures without encryption Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6280: 381-398. DOI: 10.1007/978-3-642-15317-4_24  0.428
2010 Lee MF, Smart NP, Warinschi B. The fiat-shamir transform for group and ring signature schemes Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6280: 363-380. DOI: 10.1007/978-3-642-15317-4_23  0.386
2009 Neven G, Smart NP, Warinschi B. Hash function requirements for Schnorr signatures Journal of Mathematical Cryptology. 3: 69-87. DOI: 10.1515/Jmc.2009.004  0.5
2009 Chen L, Morrissey P, Smart NP, Warinschi B. Security notions and generic constructions for client puzzles Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5912: 505-523. DOI: 10.1007/978-3-642-10366-7_30  0.45
2009 Mazaré L, Warinschi B. Separating trace mapping and reactive simulatability soundness: The case of adaptive corruption Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5511: 193-210. DOI: 10.1007/978-3-642-03459-6_13  0.384
2009 Smart NP, Warinschi B. Identity based group signatures from hierarchical identity-based encryption Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5671: 150-170. DOI: 10.1007/978-3-642-03298-1_11  0.36
2009 Farshim P, Warinschi B. Certified encryption revisited Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5580: 179-197. DOI: 10.1007/978-3-642-02384-2_12  0.454
2008 Morrissey P, Smart NP, Warinschi B. A modular security analysis of the TLS handshake protocol Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5350: 55-73. DOI: 10.1007/978-3-540-89255-7_5  0.429
2007 Cortier V, Hördegen H, Warinschi B. Explicit Randomness is not Necessary when Modeling Probabilistic Encryption Electronic Notes in Theoretical Computer Science. 186: 49-65. DOI: 10.1016/j.entcs.2006.11.044  0.392
2007 Boldyreva A, Fischlin M, Palacio A, Warinschi B. A closer look at PKI: Security and efficiency Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4450: 458-475.  0.335
2007 Bresson E, Lakhnech Y, Mazaré L, Warinschi B. A generalization of DDH with applications to protocol analysis and computational soundness Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4622: 482-499.  0.38
2007 Cortier V, Warinschi B, Zǎlinescu E. Synthesizing secure protocols Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4734: 406-421.  0.413
2006 Datta A, Derek A, Mitchell JC, Warinschi B. Computationally sound compositional logic for key exchange protocols Proceedings of the Computer Security Foundations Workshop. 2006: 321-334. DOI: 10.1109/CSFW.2006.9  0.465
2005 Abadi M, Warinschi B. Security analysis of cryptographically controlled access to XML documents Proceedings of the Acm Sigact-Sigmod-Sigart Symposium On Principles of Database Systems. 108-117. DOI: 10.1145/1346330.1346331  0.516
2005 Cortier V, Warinschi B. Computationally sound, automated proofs for security protocols Lecture Notes in Computer Science. 3444: 157-171.  0.425
2005 Camenisch J, Koprowski M, Warinschi B. Efficient blind signatures without random oracles Lecture Notes in Computer Science. 3352: 134-148.  0.467
2005 Abadi M, Warinschi B. Password-based encryption analyzed Lecture Notes in Computer Science. 3580: 664-676.  0.482
2004 Micciancio D, Warinschi B. Completeness theorems for the Abadi-Rogaway language of encrypted expressions Journal of Computer Security. 12: 99-129. DOI: 10.3233/Jcs-2004-12105  0.655
2004 Micciancio D, Warinschi B. Theory of Cryptography Conference - TCC 2004 Lecture Notes in Computer Science. DOI: 10.1007/B95566  0.542
2004 Abdalla M, Warinschi B. On the minimal assumptions of group signature schemes Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3269: 1-13.  0.427
2004 Micciancio D, Warinschi B. Soundness of formal encryption in the presence of active adversaries Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2951: 133-151.  0.646
2003 Warinschi B. A computational analysis of the Needham-Schröeder-(Lowe) protocol Proceedings of the Computer Security Foundations Workshop. 2003: 248-262. DOI: 10.3233/Jcs-2005-13307  0.539
2003 Bellare M, Micciancio D, Warinschi B. Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2656: 614-629.  0.606
2001 Micciancio D, Warinschi B. A linear space algorithm for computing the Hermite Normal Form Proceedings of the International Symposium On Symbolic and Algebraic Computation, Issac. 231-236.  0.521
Show low-probability matches.