Skip to Main content Skip to Navigation

Lossy trapdoor primitives, zero-knowledge proofs and applications

Chen Qian 1, 2, 3
Abstract : In this thesis, we study two different primitives: lossy trapdoor functions and zero-knwoledge proof systems. The lossy trapdoor functions (LTFs) are function families in which injective functions and lossy ones are computationally indistinguishable. Since their introduction, they have been found useful in constructing various cryptographic primitives. We give in this thesis efficient constructions of a variant of LTF : Lossy Algebraic Filter. Using this variant, we can improve the efficiency of the KDM-CCA (Key-Depended-Message Chosen-Ciphertext-Attack) encryption schemes and fuzzy extractors. In the second part of this thesis, we investigate on constructions of zero-knowledge proof systems. We give the first logarithmic-size ring-signature with tight security using a variant of Groth-Kolhweiz Σ-protocol in the random oracle model. We also propose one new construction of lattice-based Designated-Verifier Non-Interactive Zero-Knowledge arguments (DVNIZK). Using this new construction, we build a lattice-based voting scheme in the standard model.
Document type :
Complete list of metadatas

Cited literature [143 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Tuesday, July 7, 2020 - 10:32:13 AM
Last modification on : Wednesday, September 9, 2020 - 4:16:17 AM


Version validated by the jury (STAR)


  • HAL Id : tel-02888512, version 2


Chen Qian. Lossy trapdoor primitives, zero-knowledge proofs and applications. Cryptography and Security [cs.CR]. Université Rennes 1, 2019. English. ⟨NNT : 2019REN1S088⟩. ⟨tel-02888512v2⟩



Record views


Files downloads