Eike Kiltz

Julian Loss

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017

The Algebraic Group Model and its Applications.

[BibT_eX]

[DOI]

Julian Loss

IACR Cryptol. ePrint Arch., 2017

CRYSTALS - Kyber: a CCA-secure module-lattice-based KEM.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

A Modular Analysis of the Fujisaki-Okamoto Transformation.

[BibT_eX]

[DOI]

Kathrin Hövelmanns

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

On the One-Per-Message Unforgeability of (EC)DSA and Its Variants.

[BibT_eX]

[DOI]

Manuel Fersch

Bertram Poettering

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Memory-Tight Reductions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Tightly-Secure Signatures from Five-Move Identification Protocols.

[BibT_eX]

[DOI]

Julian Loss

Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016

Tightly Secure CCA-Secure Encryption without Pairings.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Standard Security Does Imply Security Against Selective Opening for Markov Distributions.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Two-Round Man-in-the-Middle Security from LPN.

[BibT_eX]

[DOI]

Stefano Tessaro

Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Tightly CCA-Secure Encryption Without Pairings.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

Optimal Security Proofs for Signatures from Identification Schemes.

[BibT_eX]

[DOI]

Daniel Masny

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

On the Provable Security of (EC)DSA Signatures.

[BibT_eX]

[DOI]

Manuel Fersch

Bertram Poettering

Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015

Standard Security Does Imply Security Against Selective Opening for Markov Distributions.

[BibT_eX]

[DOI]

Felix Heuer

IACR Cryptol. ePrint Arch., 2015

Tightly-Secure Authenticated Key Exchange.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

On the Selective Opening Security of Practical Public-Key Encryption Schemes.

[BibT_eX]

[DOI]

Proceedings of the Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30, 2015

Digital Signatures from Strong RSA without Prime Generation.

[BibT_eX]

[DOI]

Rafael Dowsley

Proceedings of the Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30, 2015

Tightly-Secure Signatures from Chameleon Hash Functions.

[BibT_eX]

[DOI]

Proceedings of the Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30, 2015

Quasi-Adaptive NIZK for Linear Subspaces Revisited.

[BibT_eX]

[DOI]

Hoeteck Wee

Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

Structure-Preserving Signatures from Standard Assumptions, Revisited.

[BibT_eX]

[DOI]

Hoeteck Wee

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014

Simple Chosen-Ciphertext Security from Low-Noise LPN.

[BibT_eX]

[DOI]

Daniel Masny

Proceedings of the Public-Key Cryptography - PKC 2014, 2014

(Hierarchical) Identity-Based Encryption from Affine Message Authentication.

[BibT_eX]

[DOI]

Olivier Blazy

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

2013

Practical Chosen Ciphertext Secure Encryption from Factoring.

[BibT_eX]

[DOI]

Victor Shoup

J. Cryptol., 2013

Non-Interactive Key Exchange.

[BibT_eX]

[DOI]

Proceedings of the Public-Key Cryptography - PKC 2013 - 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26, 2013

Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions.

[BibT_eX]

[DOI]

Mario Szegedy

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

An Algebraic Framework for Diffie-Hellman Assumptions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012

Digital Signatures with Minimal Overhead.

[BibT_eX]

[DOI]

Mario Szegedy

IACR Cryptol. ePrint Arch., 2012

DDH-Like Assumptions Based on Extension Rings.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography - PKC 2012, 2012

Lapin: An Efficient Authentication Protocol Based on Ring-LPN.

[BibT_eX]

[DOI]

Proceedings of the Fast Software Encryption - 19th International Workshop, 2012

Optimal Security Proofs for Full Domain Hash, Revisited.

[BibT_eX]

[DOI]

Saqib A. Kakvi

Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

Message Authentication, Revisited.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

Identity-Based (Lossy) Trapdoor Functions and Applications.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

Certifying RSA.

[BibT_eX]

[DOI]

Saqib A. Kakvi

Alexander May

Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

2011

Efficient Authentication from Hard Learning Problems.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

Short Signatures from Weaker Assumptions.

[BibT_eX]

[DOI]

Tibor Jager

Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

2010

Leakage-Resilient Signatures.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

Cryptographic Protocols from Lattices.

[BibT_eX]

[DOI]

Proceedings of the Provable Security - 4th International Conference, 2010

Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model.

[BibT_eX]

[DOI]

Kristiyan Haralambiev

Tibor Jager

Victor Shoup

Proceedings of the Public Key Cryptography, 2010

More Constructions of Lossy and Correlation-Secure Trapdoor Functions.

[BibT_eX]

[DOI]

David Mandell Freeman

Proceedings of the Public Key Cryptography, 2010

Adaptive Trapdoor Functions and Chosen-Ciphertext Security.

[BibT_eX]

[DOI]

Payman Mohassel

Adam O'Neill

Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

Bonsai Trees, or How to Delegate a Lattice Basis.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

Instantiability of RSA-OAEP under Chosen-Plaintext Attack.

[BibT_eX]

[DOI]

Adam O'Neill

Adam D. Smith

Proceedings of the Advances in Cryptology, 2010

Leakage Resilient ElGamal Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

2009

Identity-Based Signatures.

[BibT_eX]

[DOI]

Gregory Neven

Proceedings of the Identity-Based Cryptography, 2009

The Kurosawa-Desmedt key encapsulation is not chosen-ciphertext secure.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Chosen-ciphertext Secure Encryption from Hard Algebraic Set Systems.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

How to Delegate a Lattice Basis.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Subtleties in the Definition of IND-CCA: When and How Should Challenge-Decryption be Disallowed?

[BibT_eX]

[DOI]

Mihir Bellare

IACR Cryptol. ePrint Arch., 2009

Compact CCA-Secure Encryption for Messages of Arbitrary Length.

[BibT_eX]

[DOI]

Masayuki Abe

Tatsuaki Okamoto

Proceedings of the Public Key Cryptography, 2009

A New Randomness Extraction Paradigm for Hybrid Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2009

On the Security of Padding-Based Encryption Schemes - or - Why We Cannot Prove OAEP Secure in the Standard Model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2009

Practical Chosen Ciphertext Secure Encryption from Factoring.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2009

The Group of Signed Quadratic Residues and Applications.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2009

2008

Generalised key delegation for hierarchical identity-based encryption.

[BibT_eX]

[DOI]

Michel Abdalla

Gregory Neven

IET Inf. Secur., 2008

The Twin Diffie-Hellman Problem and Applications.

[BibT_eX]

[DOI]

Victor Shoup

Proceedings of the Advances in Cryptology, 2008

CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption.

[BibT_eX]

[DOI]

Yevgeniy Vahlis

Proceedings of the Topics in Cryptology, 2008

Public-Key Encryption with Non-interactive Opening.

[BibT_eX]

[DOI]

Proceedings of the Topics in Cryptology, 2008

Programmable Hash Functions and Their Applications.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2008

Chosen Ciphertext Security with Optimal Ciphertext Overhead.

[BibT_eX]

[DOI]

Masayuki Abe

Tatsuaki Okamoto

Proceedings of the Advances in Cryptology, 2008

2007

From Selective-ID to Full Security: The Case of the Inversion-Based Boneh-Boyen IBE Scheme.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2007

Efficient Hybrid Encryption from ID-Based Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2007

Secure Linear Algebra Using Linearly Recurrent Sequences.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007

Chosen-Ciphertext Secure Key-Encapsulation Based on Gap Hashed Diffie-Hellman.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography, 2007

Generalized Key Delegation for Hierarchical Identity-Based Encryption.

[BibT_eX]

[DOI]

Michel Abdalla

Gregory Neven

Proceedings of the Computer Security, 2007

Secure Hybrid Encryption from Weakened Key Encapsulation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2007

A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra.

[BibT_eX]

[DOI]

Carles Padró

Proceedings of the Advances in Cryptology, 2007

Bounded CCA2-Secure Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2007

2006

Chosen-Ciphertext Secure Identity-Based Encryption in the Standard Model with short Ciphertexts.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2006

Some (in)sufficient conditions for secure hybrid encryption.

[BibT_eX]

[DOI]

Javier Herranz

IACR Cryptol. ePrint Arch., 2006

The Kurosawa-Desmedt Key Encapsulation is not Chosen-Ciphertext Secure.

[BibT_eX]

[DOI]

Javier Herranz

IACR Cryptol. ePrint Arch., 2006

A Note on Bounded Chosen Ciphertext Security from Black-box Semantical Security.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2006

Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem.

[BibT_eX]

[DOI]

Arne Winterhof

Discret. Appl. Math., 2006

Chosen-Ciphertext Security from Tag-Based Encryption.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

Chosen-Ciphertext Secure Threshold Identity-Based Key Encapsulation Without Random Oracles.

[BibT_eX]

[DOI]

David Galindo

Proceedings of the Security and Cryptography for Networks, 5th International Conference, 2006

On the Limitations of the Spread of an IBE-to-PKE Transformation.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography, 2006

Secure Linear Algebra Using Linearly Recurrent Sequences.

[BibT_eX]

[DOI]

Enav Weinreb

Proceedings of the Complexity of Boolean Functions, 12.03. - 17.03.2006, 2006

On the Generic Construction of Identity-Based Signatures with Additional Properties.

[BibT_eX]

[DOI]

David Galindo

Javier Herranz

Proceedings of the Advances in Cryptology, 2006

Direct Chosen-Ciphertext Secure Identity-Based Key Encapsulation Without Random Oracles.

[BibT_eX]

[DOI]

David Galindo

Proceedings of the Information Security and Privacy, 11th Australasian Conference, 2006

2005

Threshold circuit lower bounds on cryptographic functions.

[BibT_eX]

[DOI]

Hans Ulrich Simon

J. Comput. Syst. Sci., 2005

Unconditionally Secure Constant Round Multi-Party Computation for Equality, Comparison, Bits and Exponentiation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2005

Secure Computation of the Mean and Related Statistics.

[BibT_eX]

[DOI]

Gregor Leander

John Malone-Lee

Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Append-Only Signatures.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2005

2003

On the Representation of Boolean Predicates of the Diffie-Hellman Function.

[BibT_eX]

[DOI]

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

A General Construction of IND-CCA2 Secure Public Key Encryption.

[BibT_eX]

[DOI]

John Malone-Lee

Proceedings of the Cryptography and Coding, 2003

Complexity Theoretic Aspects of Some Cryptographic Functions.

[BibT_eX]

[DOI]

Hans Ulrich Simon

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2001

A Tool Box of Cryptographic Functions Related to the Diffie-Hellman Function.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology, 2001

A Primitive for Proving the Security of Every Bit and About Universal Hash Functions & Hard Core Bits.

[BibT_eX]

[DOI]