Bogdan Warinschi

Cited by

	All	Since 2018
Citations	6189	2493
h-index	39	24
i10-index	72	50

540

270

135

405

20032004200520062007200820092010201120122013201420152016201720182019202020212022202323 84 168 219 190 216 200 271 208 296 280 337 322 390 373 404 462 432 539 477 177

Public access

View all

29 articles

1 article

available

not available

Based on funding mandates

Co-authors

Véronique CortierCNRS, LORIAVerified email at loria.fr
Nigel SmartKU LeuvenVerified email at kuleuven.be
Daniele MicciancioProfessor of computer science, UCSDVerified email at eng.ucsd.edu
Alexandra BoldyrevaProfessor, School of Cybersecurity and Privacy, Georgia Institute of TechnologyVerified email at gatech.edu
Marc FischlinProfessor of Computer Science, Technische Universität Darmstadt, GermanyVerified email at tu-darmstadt.de
Olivier PereiraUCLouvainVerified email at uclouvain.be
Steve KremerInriaVerified email at inria.fr
Manuel BarbosaUniversidade do Porto (FCUP) and INESC TECVerified email at fc.up.pt
Dario CatalanoProfessor of Computer Science, University of CataniaVerified email at dmi.unict.it
Martin AbadiResearch Scientist, Google, and Professor Emeritus, UC Santa CruzVerified email at cs.ucsc.edu
Dario FioreAssociate Research Professor, IMDEA Software InstituteVerified email at imdea.org
Bernardo PortelaINESC TEC, FCUPVerified email at fc.up.pt
Guillaume ScerriMaître de conférences, Université Versailles Saint-Quentin en YvelinesVerified email at lsv.ens-cachan.fr
Laurent MazareVerified email at polytechnique.org
Chris BrzuskaAalto UniversityVerified email at aalto.fi
Essam GhadafiSenior Lecturer, Newcastle UniversityVerified email at ncl.ac.uk
Georg FuchsbauerTU WienVerified email at ist.ac.at
Jan CamenischDFINITYVerified email at dfinity.org
Gregory NevenDFINITYVerified email at dfinity.org
Anupam DattaProfessor, Electrical and Computer Engineering & Computer Science Departments, CMUVerified email at cmu.edu

Bogdan Warinschi

University of Bristol and Dfinity

Verified email at cs.bris.ac.uk

Cryptography Security


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions M Bellare, D Micciancio, B Warinschi Advances in Cryptology—Eurocrypt 2003, 614-629, 2003	967	2003
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) M Okada, R Takemura Remarks on semantic completeness for proof-terms with Laird's dual affine …, 2007	453*	2007
Secure proxy signature schemes for delegation of signing rights A Boldyreva, A Palacio, B Warinschi Journal of cryptology 25 (1), 57-115, 2012	377	2012
Soundness of formal encryption in the presence of active adversaries D Micciancio, B Warinschi Theory of Cryptography: First Theory of Cryptography Conference, TCC 2004 …, 2004	280	2004
How not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios D Bernhard, O Pereira, B Warinschi Advances in Cryptology–ASIACRYPT 2012, 626-643, 2012	263	2012
Computationally sound, automated proofs for security protocols V Cortier, B Warinschi European Symposium on Programming, 157-171, 2005	193	2005
Computationally sound, automated proofs for security protocols V Cortier, B Warinschi European Symposium on Programming, 157-171, 2005	193	2005
SoK: A comprehensive analysis of game-based ballot privacy definitions D Bernhard, V Cortier, D Galindo, O Pereira, B Warinschi 2015 IEEE Symposium on Security and Privacy, 499-516, 2015	146	2015
Completeness theorems for the Abadi-Rogaway language of encrypted expressions D Micciancio, B Warinschi Journal of Computer Security 12 (1), 99-129, 2004	146	2004
Get Shorty via Group Signatures without Encryption. P Bichsel, J Camenisch, G Neven, NP Smart, B Warinschi SCN 10, 381-398, 2010	132	2010
A survey of symbolic methods in computational analysis of cryptographic systems V Cortier, S Kremer, B Warinschi Journal of Automated Reasoning 46, 225-259, 2011	130	2011
Homomorphic Signatures with Efficient Verification for Polynomial Functions D Catalano, D Fiore, B Warinschi Advances in Cryptology–CRYPTO 2014, 371-389, 2014	121	2014
Efficient blind signatures without random oracles J Camenisch, M Koprowski, B Warinschi Security in Communication Networks, 134-148, 2005	115	2005
Efficient Network Coding Signatures in the Standard Model. D Catalano, D Fiore, B Warinschi Public Key Cryptography, 680-696, 2012	112	2012
Adapting Helios for Provable Ballot Privacy. D Bernhard, V Cortier, O Pereira, B Smyth, B Warinschi ESORICS 11, 335-354, 2011	112	2011
A modular security analysis of the TLS handshake protocol P Morrissey, N Smart, B Warinschi Advances in Cryptology-ASIACRYPT 2008, 55-73, 2008	105	2008
Secure multiparty computation from SGX R Bahmani, M Barbosa, F Brasser, B Portela, AR Sadeghi, G Scerri, ... Financial Cryptography and Data Security: 21st International Conference, FC …, 2017	99	2017
How to build time-lock encryption J Liu, T Jager, SA Kakvi, B Warinschi Designs, Codes and Cryptography 86, 2549-2586, 2018	94*	2018
Computationally sound compositional logic for key exchange protocols A Datta, A Derek, JC Mitchell, B Warinschi 19th IEEE Computer Security Foundations Workshop (CSFW'06), 14 pp.-334, 2006	92	2006
A computational analysis of the Needham-Schroeder-(Lowe) protocol B Warinschi Journal of Computer Security 13 (3), 565-591, 2005	90	2005

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors