Bogdan Warinschi
Bogdan Warinschi
University of Bristol and Dfinity
Verifierad e-postadress på cs.bris.ac.uk
Citeras av
Citeras av
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
Secure proxy signature schemes for delegation of signing rights
A Boldyreva, A Palacio, B Warinschi
Journal of cryptology 25 (1), 57-115, 2012
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
Soundness of formal encryption in the presence of active adversaries
D Micciancio, B Warinschi
Theory of Cryptography Conference, 133-151, 2004
Computationally sound, automated proofs for security protocols
V Cortier, B Warinschi
European Symposium on Programming, 157-171, 2005
Computationally sound, automated proofs for security protocols
V Cortier, B Warinschi
European Symposium on Programming, 157-171, 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
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
Completeness theorems for the Abadi-Rogaway language of encrypted expressions
D Micciancio, B Warinschi
Journal of Computer Security 12 (1), 99-129, 2004
Get Shorty via Group Signatures without Encryption.
P Bichsel, J Camenisch, G Neven, NP Smart, B Warinschi
SCN 10, 381-398, 2010
Homomorphic Signatures with Efficient Verification for Polynomial Functions
D Catalano, D Fiore, B Warinschi
Advances in Cryptology–CRYPTO 2014, 371-389, 2014
Secure multiparty computation from SGX
R Bahmani, M Barbosa, F Brasser, B Portela, AR Sadeghi, G Scerri, ...
International Conference on Financial Cryptography and Data Security, 477-497, 2017
Efficient blind signatures without random oracles
J Camenisch, M Koprowski, B Warinschi
Security in Communication Networks, 134-148, 2005
Adapting Helios for Provable Ballot Privacy.
D Bernhard, V Cortier, O Pereira, B Smyth, B Warinschi
ESORICS 11, 335-354, 2011
Efficient Network Coding Signatures in the Standard Model.
D Catalano, D Fiore, B Warinschi
Public Key Cryptography, 680-696, 2012
How to build time-lock encryption
J Liu, T Jager, SA Kakvi, B Warinschi
Designs, Codes and Cryptography 86, 2549-2586, 2018
A modular security analysis of the TLS handshake protocol
P Morrissey, N Smart, B Warinschi
Advances in Cryptology-ASIACRYPT 2008, 55-73, 2008
Anonymous attestation with user-controlled linkability
D Bernhard, G Fuchsbauer, E Ghadafi, NP Smart, B Warinschi
International Journal of Information Security 12, 219-249, 2013
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
Composability of Bellare-Rogaway key exchange protocols
C Brzuska, M Fischlin, B Warinschi, SC Williams
Proceedings of the 18th ACM conference on Computer and communications …, 2011
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20