Quasi-adaptive non-interactive zero-knowledge proof (QA-NIZK) systems and structure-preserving signature (SPS) schemes are two powerful tools for constructing practical pairing-based cryptographic schemes. Their efficiency directly affects the efficiency of the derived advanced protocols. We construct more efficient QA-NIZK and SPS schemes with tight security reductions. Our QA-NIZK scheme is the first one that achieves both tight simulation soundness and constant proof size (in terms of number of group elements) at the same time, while the recent scheme from Abe et al. (ASIACRYPT 2018) achieved tight security with proof size linearly depending on the size of the language and the witness. Assuming the hardness of the Symmetric eXternal Diff...
This habilitation thesis deals with cryptographic primitives that preserve the algebraic structure o...
We construct the first public-key encryption scheme whose chosen-ciphertext (i.e., IND-CCA) security...
We put forward a new technique to construct very efficient and compact signature schemes. Our techni...
Abstract. Quasi-adaptive non-interactive zero-knowledge (QA-NIZK) proofs is a powerful paradigm, sug...
Abstract. Quasi-adaptive non-interactive zero-knowledge (QA-NIZK) proofs is a recent paradigm, sugge...
International audienceQuasi-adaptive non-interactive zero-knowledge (QA-NIZK) proofs is a powerful p...
Verifiability is central to building protocols and systems with integrity. Initially, efficient meth...
We define a novel notion of quasi-adaptive non-interactive zero knowledge (NIZK) proofs for probabil...
Abstract. Non-interactive zero-knowledge (NIZK) proofs for algebraic relations in a group, such as t...
Abstract. Verifiability is central to building protocols and systems with integrity. Initially, effi...
International audienceWe provide a structure-preserving signature (SPS) scheme with an (almost) tigh...
International audienceWe put forth a new framework for building pairing-based non-interactive zerokn...
In structure-preserving cryptography, every building block shares the same bilinear groups. These gr...
Non-interactive zero-knowledge (NIZK) proof systems are fundamental primitives used in many cryptogr...
The notion of non-interactive zero-knowledge (NIZK) is of fundamental importance in cryptography. De...
This habilitation thesis deals with cryptographic primitives that preserve the algebraic structure o...
We construct the first public-key encryption scheme whose chosen-ciphertext (i.e., IND-CCA) security...
We put forward a new technique to construct very efficient and compact signature schemes. Our techni...
Abstract. Quasi-adaptive non-interactive zero-knowledge (QA-NIZK) proofs is a powerful paradigm, sug...
Abstract. Quasi-adaptive non-interactive zero-knowledge (QA-NIZK) proofs is a recent paradigm, sugge...
International audienceQuasi-adaptive non-interactive zero-knowledge (QA-NIZK) proofs is a powerful p...
Verifiability is central to building protocols and systems with integrity. Initially, efficient meth...
We define a novel notion of quasi-adaptive non-interactive zero knowledge (NIZK) proofs for probabil...
Abstract. Non-interactive zero-knowledge (NIZK) proofs for algebraic relations in a group, such as t...
Abstract. Verifiability is central to building protocols and systems with integrity. Initially, effi...
International audienceWe provide a structure-preserving signature (SPS) scheme with an (almost) tigh...
International audienceWe put forth a new framework for building pairing-based non-interactive zerokn...
In structure-preserving cryptography, every building block shares the same bilinear groups. These gr...
Non-interactive zero-knowledge (NIZK) proof systems are fundamental primitives used in many cryptogr...
The notion of non-interactive zero-knowledge (NIZK) is of fundamental importance in cryptography. De...
This habilitation thesis deals with cryptographic primitives that preserve the algebraic structure o...
We construct the first public-key encryption scheme whose chosen-ciphertext (i.e., IND-CCA) security...
We put forward a new technique to construct very efficient and compact signature schemes. Our techni...