Bogdan Warinschi

According to our database1, Bogdan Warinschi authored at least 91 papers between 2000 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Lifting Standard Model Reductions to Common Setup Assumptions.
IACR Cryptol. ePrint Arch., 2021

2020
SWiSSSE: System-Wide Security for Searchable Symmetric Encryption.
IACR Cryptol. ePrint Arch., 2020

Fifty Shades of Ballot Privacy: Privacy against a Malicious Board.
IACR Cryptol. ePrint Arch., 2020

Provable Security Analysis of FIDO2.
IACR Cryptol. ePrint Arch., 2020

2019
Authentication in Key-Exchange: Definitions, Relations and Composition.
IACR Cryptol. ePrint Arch., 2019

Encrypted Databases: New Volume Attacks against Range Queries.
IACR Cryptol. ePrint Arch., 2019

Masking Fuzzy-Searchable Public Databases.
IACR Cryptol. ePrint Arch., 2019

Efficient Function-Hiding Functional Encryption: From Inner-Products to Orthogonality.
Proceedings of the Topics in Cryptology - CT-RSA 2019, 2019

2018
Verifiability Analysis of CHVote.
IACR Cryptol. ePrint Arch., 2018

How to build time-lock encryption.
Des. Codes Cryptogr., 2018

Safe cryptography for all: towards visual metaphor driven cryptography building blocks.
Proceedings of the 1st International Workshop on Security Awareness from Design to Deployment, 2018

Machine-Checked Proofs for Electronic Voting: Privacy and Verifiability for Belenios.
Proceedings of the 31st IEEE Computer Security Foundations Symposium, 2018

2017
Multi-Key Authenticated Encryption with Corruptions: Reductions are Lossy.
IACR Cryptol. ePrint Arch., 2017

Generic Forward-Secure Key Agreement Without Signatures.
IACR Cryptol. ePrint Arch., 2017

Machine-Checked Proofs of Privacy for Electronic Voting Protocols.
Proceedings of the 2017 IEEE Symposium on Security and Privacy, 2017

Secure Composition of PKIs with Public Key Protocols.
Proceedings of the 30th IEEE Computer Security Foundations Symposium, 2017

Adaptive Proofs Have Straightline Extractors (in the Random Oracle Model).
Proceedings of the Applied Cryptography and Network Security, 2017

2016
Adaptive proofs of knowledge in the random oracle model.
IET Inf. Secur., 2016

A Modular Treatment of Cryptographic APIs: The Symmetric-Key Case.
IACR Cryptol. ePrint Arch., 2016

Universally Composable Cryptographic Role-Based Access Control.
IACR Cryptol. ePrint Arch., 2016

Cryptographic Voting - A Gentle Introduction.
IACR Cryptol. ePrint Arch., 2016

How not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios.
IACR Cryptol. ePrint Arch., 2016

Adapting Helios for provable ballot privacy.
IACR Cryptol. ePrint Arch., 2016

Foundations of Hardware-Based Attested Computation and Application to SGX.
IACR Cryptol. ePrint Arch., 2016

Secure Multiparty Computation from SGX.
IACR Cryptol. ePrint Arch., 2016

Key Confirmation in Key Exchange: A Formal Treatment and Implications for TLS 1.3.
Proceedings of the IEEE Symposium on Security and Privacy, 2016

Provably-Secure Remote Memory Attestation for Heap Overflow Protection.
Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

Secure Software Licensing: Models, Constructions, and Proofs.
Proceedings of the IEEE 29th Computer Security Foundations Symposium, 2016

2015
Extractable Witness Encryption and Timed-Release Encryption from Bitcoin.
IACR Cryptol. ePrint Arch., 2015

Selective Opening Security for Receivers.
IACR Cryptol. ePrint Arch., 2015

Towards Provably-Secure Remote Memory Attestation.
IACR Cryptol. ePrint Arch., 2015

On Limitations of the Fiat­ - Shamir Transformation.
IACR Cryptol. ePrint Arch., 2015

On the Hardness of Proving CCA-security of Signed ElGamal.
IACR Cryptol. ePrint Arch., 2015

A comprehensive analysis of game-based ballot privacy definitions.
IACR Cryptol. ePrint Arch., 2015

SoK: A Comprehensive Analysis of Game-Based Ballot Privacy Definitions.
Proceedings of the 2015 IEEE Symposium on Security and Privacy, 2015

Policy Privacy in Cryptographic Access Control.
Proceedings of the IEEE 28th Computer Security Foundations Symposium, 2015

2014
Anonymity guarantees of the UMTS/LTE authentication and connection protocol.
Int. J. Inf. Sec., 2014

Homomorphic Signatures with Efficient Verification for Polynomial Functions.
IACR Cryptol. ePrint Arch., 2014

Cryptographic puzzles and DoS resilience, revisited.
Des. Codes Cryptogr., 2014

2013
Less is more: relaxed yet composable security notions for key exchange.
Int. J. Inf. Sec., 2013

Anonymous attestation with user-controlled linkability.
Int. J. Inf. Sec., 2013

Cryptographically Enforced RBAC.
IACR Cryptol. ePrint Arch., 2013

An Analysis of the EMV Channel Establishment Protocol.
IACR Cryptol. ePrint Arch., 2013

Deduction Soundness: Prove One, Get Five for Free.
IACR Cryptol. ePrint Arch., 2013

2012
Secure Proxy Signature Schemes for Delegation of Signing Rights.
J. Cryptol., 2012

On Necessary and Sufficient Conditions for Private Ballot Submission.
IACR Cryptol. ePrint Arch., 2012

Revisiting Difficulty Notions for Client Puzzles and DoS Resilience.
Proceedings of the Information Security - 15th International Conference, 2012

Measuring vote privacy, revisited.
Proceedings of the ACM Conference on Computer and Communications Security, 2012

2011
A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems.
J. Autom. Reason., 2011

Efficient Network Coding Signatures in the Standard Model.
IACR Cryptol. ePrint Arch., 2011

Adaptive Pseudo-Free Groups and Applications.
IACR Cryptol. ePrint Arch., 2011

Security of the Enhanced TCG Privacy-CA Solution.
Proceedings of the Trustworthy Global Computing - 6th International Symposium, 2011

Security for Key Management Interfaces.
Proceedings of the 24th IEEE Computer Security Foundations Symposium, 2011

A composable computational soundness notion.
Proceedings of the 18th ACM Conference on Computer and Communications Security, 2011

Composability of bellare-rogaway key exchange protocols.
Proceedings of the 18th ACM Conference on Computer and Communications Security, 2011

Computational Soundness - The Case of Diffie-Hellman Keys.
Proceedings of the Formal Models and Techniques for Analyzing Security Protocols, 2011

2010
The TLS Handshake Protocol: A Modular Analysis.
J. Cryptol., 2010

Guessing attacks and the computational soundness of static equivalence.
J. Comput. Secur., 2010

The Fiat-Shamir Transform for Group and Ring Signature Schemes.
IACR Cryptol. ePrint Arch., 2010

Get Shorty via Group Signatures without Encryption.
Proceedings of the Security and Cryptography for Networks, 7th International Conference, 2010

Security of the TCG Privacy-CA Solution.
Proceedings of the IEEE/IFIP 8th International Conference on Embedded and Ubiquitous Computing, 2010

Robustness Guarantees for Anonymity.
Proceedings of the 23rd IEEE Computer Security Foundations Symposium, 2010

2009
Hash function requirements for Schnorr signatures.
J. Math. Cryptol., 2009

Identity Based Group Signatures from Hierarchical Identity-Based Encryption.
IACR Cryptol. ePrint Arch., 2009

Groth-Sahai proofs revisited.
IACR Cryptol. ePrint Arch., 2009

Security Notions and Generic Constructions for Client Puzzles.
IACR Cryptol. ePrint Arch., 2009

Foundations of Non-Malleable Hash and One-Way Functions.
IACR Cryptol. ePrint Arch., 2009

Symbolic Methods for Provable Security.
Proceedings of the Provable Security, Third International Conference, 2009

Practical Zero-Knowledge Proofs for Circuit Evaluation.
Proceedings of the Cryptography and Coding, 2009

Separating Trace Mapping and Reactive Simulatability Soundness: The Case of Adaptive Corruption.
Proceedings of the Foundations and Applications of Security Analysis, 2009

Certified Encryption Revisited.
Proceedings of the Progress in Cryptology, 2009

2008
Security analysis of cryptographically controlled access to XML documents.
J. ACM, 2008

A Modular Security Analysis of the TLS Handshake Protocol.
IACR Cryptol. ePrint Arch., 2008

2007
A Cryptographic Model for Branching Time Security Properties - the Case of Contract Signing Protocols.
IACR Cryptol. ePrint Arch., 2007

Explicit Randomness is not Necessary when Modeling Probabilistic Encryption.
Electron. Notes Theor. Comput. Sci., 2007

A Closer Look at PKI: Security and Efficiency.
Proceedings of the Public Key Cryptography, 2007

Synthesizing Secure Protocols.
Proceedings of the Computer Security, 2007

A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness.
Proceedings of the Advances in Cryptology, 2007

2006
Key Exchange Protocols: Security Definition, Proof Method and Applications.
IACR Cryptol. ePrint Arch., 2006

Computationally Sound Symbolic Secrecy in the Presence of Hash Functions.
IACR Cryptol. ePrint Arch., 2006

Computationally Sound Compositional Logic for Key Exchange Protocols.
Proceedings of the 19th IEEE Computer Security Foundations Workshop, 2006

2005
A computational analysis of the Needham-Schroeder-(Lowe) protocol.
J. Comput. Secur., 2005

Password-Based Encryption Analyzed.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Computationally Sound, Automated Proofs for Security Protocols.
Proceedings of the Programming Languages and Systems, 2005

2004
Completeness Theorems for the Abadi-Rogaway Language of Encrypted Expressions.
J. Comput. Secur., 2004

Soundness of Formal Encryption in the Presence of Active Adversaries.
Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

Efficient Blind Signatures Without Random Oracles.
Proceedings of the Security in Communication Networks, 4th International Conference, 2004

On the Minimal Assumptions of Group Signature Schemes.
Proceedings of the Information and Communications Security, 6th International Conference, 2004

2003
Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions.
Proceedings of the Advances in Cryptology, 2003

2001
A linear space algorithm for computing the herite normal form.
Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, 2001

2000
A Linear Space Algorithm for Computing the Hermite Normal Form
Electron. Colloquium Comput. Complex., 2000


  Loading...