Zero-knowledge proofs for secure computation

Abstract : In this thesis, we study zero-knowledge proofs, a cryptographic primitive that allows to prove a statement while yielding nothing beyond its truth, and their applications to secure computation. Specifically, we first introduce a new type of zero-knowledge proofs, called implicit zero-knowledge arguments, that stands between two existing notions, interactive zeroknowledge proofs and non-interactive zero-knowledge proofs. Our new notion provides the same efficiency benefits than the latter when used to design roundefficient secure computation protocols, but it can be built from essentially the same cryptographic assumptions than the former, which allows to get improved efficiency and security guarantees. Second, we revisit a zero-knowledge proof system that is particularly useful for secure computation protocols manipulating integers, and show that the known security analysis can be improved to base the proof system on a more wellstudied assumption. Eventually, we introduce a new method to build zero-knowledge proof systems over the integers, which particularly improves over existing methods in a client-server model, where a weak client executes a secure computation protocol with a powerful server.
Document type :
Complete list of metadatas

Cited literature [97 references]  Display  Hide  Download
Contributor : Abes Star <>
Submitted on : Friday, July 13, 2018 - 11:24:47 AM
Last modification on : Wednesday, March 13, 2019 - 1:21:35 AM


Version validated by the jury (STAR)


  • HAL Id : tel-01668125, version 2



Geoffroy Couteau. Zero-knowledge proofs for secure computation. Cryptography and Security [cs.CR]. PSL Research University, 2017. English. ⟨NNT : 2017PSLEE065⟩. ⟨tel-01668125v2⟩



Record views


Files downloads