(Hierarchical) Identity-Based Encryption from Affine Message Authentication

A General Construction of IND-CCA2 Secure Public Key Encryption

A Modular Analysis of the Fujisaki-Okamoto Transformation

A New Randomness Extraction Paradigm for Hybrid Encryption

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

scholarly article

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

A Thorough Treatment of Highly-Efficient NTRU Instantiations

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

article published in 2001

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

Adaptive Trapdoor Functions and Chosen-Ciphertext Security

An Algebraic Framework for Diffie-Hellman Assumptions

scholarly article by Alex Escala et al published 2013 in Lecture Notes in Computer Science

Append-Only Signatures

Authenticated Key Exchange and Signatures with Tight Security in the Standard Model

Bonsai Trees, or How to Delegate a Lattice Basis

scientific article

Bonsai Trees, or How to Delegate a Lattice Basis

Bounded CCA2-Secure Encryption

CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption

article

Certifying RSA

Chosen Ciphertext Security with Optimal Ciphertext Overhead

Chosen Ciphertext Security with Optimal Ciphertext Overhead

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

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

Chosen-Ciphertext Security from Tag-Based Encryption

Compact CCA-Secure Encryption for Messages of Arbitrary Length

Complexity Theoretic Aspects of Some Cryptographic Functions

DDH-Like Assumptions Based on Extension Rings

Digital Signatures from Strong RSA without Prime Generation

Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions

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

Direct chosen-ciphertext secure identity-based key encapsulation without random oracles

Efficient Authentication from Hard Learning Problems

article published in 2011

Efficient hybrid encryption from ID-based encryption

Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks

Generalised key delegation for hierarchical identity-based encryption

Generalized Key Delegation for Hierarchical Identity-Based Encryption

Hybrid Encryption in a Multi-user Setting, Revisited

Identity-Based (Lossy) Trapdoor Functions and Applications

Instantiability of RSA-OAEP under Chosen-Plaintext Attack

Lapin: An Efficient Authentication Protocol Based on Ring-LPN

Leakage Resilient ElGamal Encryption

article published in 2010

Leakage-Resilient Signatures

Memory-Tight Reductions

Message Authentication, Revisited

More Constructions of Lossy and Correlation-Secure Trapdoor Functions

More Constructions of Lossy and Correlation-Secure Trapdoor Functions

Non-Interactive Key Exchange

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

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

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

On the Provable Security of (EC)DSA Signatures

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

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

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

On the generic construction of identity-based signatures with additional properties

On the interpolation of bivariate polynomials related to the Diffie-Hellman mapping

Optimal Security Proofs for Full Domain Hash, Revisited

Optimal Security Proofs for Signatures from Identification Schemes

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

Post-Quantum Multi-Recipient Public Key Encryption

scientific article published on 21 November 2023

Practical Chosen Ciphertext Secure Encryption from Factoring

article published in 2011

Practical Chosen Ciphertext Secure Encryption from Factoring

Programmable Hash Functions and Their Applications

Programmable Hash Functions and Their Applications

Public-Key Encryption Resistant to Parameter Subversion and Its Realization from Efficiently-Embeddable Groups

Public-Key Encryption with Non-interactive Opening

Quasi-Adaptive NIZK for Linear Subspaces Revisited

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

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

article

Secure Computation of the Mean and Related Statistics

Secure Hybrid Encryption from Weakened Key Encapsulation

Secure Linear Algebra Using Linearly Recurrent Sequences

scholarly article

Selective opening security of practical public-key encryption schemes

Short Signatures from Weaker Assumptions

Simple Chosen-Ciphertext Security from Low-Noise LPN

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

article

Some (in)sufficient conditions for secure hybrid encryption

Standard Security Does Imply Security Against Selective Opening for Markov Distributions

article published in 2015

Structure-Preserving Signatures from Standard Assumptions, Revisited

article by Eike Kiltz et al published 2015 in Lecture Notes in Computer Science

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

The Group of Signed Quadratic Residues and Applications

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

The Twin Diffie-Hellman Problem and Applications

scholarly article

The Twin Diffie–Hellman Problem and Applications

article by David Cash et al published 11 April 2009 in Journal of Cryptology

Threshold circuit lower bounds on cryptographic functions

Tightly CCA-Secure Encryption Without Pairings

Tightly-Secure Authenticated Key Exchange

Tightly-Secure Signatures from Chameleon Hash Functions

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

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

article by Ivan Damgård et al published 2006 in Lecture Notes in Computer Science