Abstract. Even though Zero-knowledge has existed for more than 30 years, few generic constructions for Zero-knowledge exist. In this paper we present a new kind of commitment scheme on which we build a novel and efficient Zero-knowledge protocol for circuit satisfiability.
There has been a lot of recent progress in constructing efficient zero-knowledge proofs for showing ...
Since their introduction in 1985, by Goldwasser, Micali and Rackoff, followed by Feige, Fiat and Sha...
We extend a commitment scheme based on the learning with errors over rings (RLWE) problem, and prese...
We give computationally efficient zero-knowledge proofs of knowledge for arithmetic circuit satisfia...
Abstract. We design an efficient commitment scheme, and companion zero-knowledge proofs of knowledge...
Zero-knowledge proofs for NP statements are an essential tool for building various cryptographic pri...
Showing that a circuit is satisfiable without revealing information is a key problem in modern crypt...
With the recent emergence of efficient zero-knowledge (ZK) proofs for general circuits, while effici...
Abstract. We study the question whether the number of rounds in public-coin perfect zero-knowledge (...
This article is an introduction to two fundamental primitives in cryptographic protocol theory: comm...
Abstract. We show that a language in NP has a zero-knowledge proto-col if and only if the language h...
We extend a commitment scheme based on the learning with errors over rings (RLWE) problem, and prese...
International audienceZero knowledge sets (ZKS), introduced by Micali, Rabin, and Kilian in 2003, al...
Zero-knowledge protocols are one of the fundamental con-cepts in modern cryptography and have countl...
We introduce a new flavor of commitment schemes, which we call mercurial commitments. Infor-mally, m...
There has been a lot of recent progress in constructing efficient zero-knowledge proofs for showing ...
Since their introduction in 1985, by Goldwasser, Micali and Rackoff, followed by Feige, Fiat and Sha...
We extend a commitment scheme based on the learning with errors over rings (RLWE) problem, and prese...
We give computationally efficient zero-knowledge proofs of knowledge for arithmetic circuit satisfia...
Abstract. We design an efficient commitment scheme, and companion zero-knowledge proofs of knowledge...
Zero-knowledge proofs for NP statements are an essential tool for building various cryptographic pri...
Showing that a circuit is satisfiable without revealing information is a key problem in modern crypt...
With the recent emergence of efficient zero-knowledge (ZK) proofs for general circuits, while effici...
Abstract. We study the question whether the number of rounds in public-coin perfect zero-knowledge (...
This article is an introduction to two fundamental primitives in cryptographic protocol theory: comm...
Abstract. We show that a language in NP has a zero-knowledge proto-col if and only if the language h...
We extend a commitment scheme based on the learning with errors over rings (RLWE) problem, and prese...
International audienceZero knowledge sets (ZKS), introduced by Micali, Rabin, and Kilian in 2003, al...
Zero-knowledge protocols are one of the fundamental con-cepts in modern cryptography and have countl...
We introduce a new flavor of commitment schemes, which we call mercurial commitments. Infor-mally, m...
There has been a lot of recent progress in constructing efficient zero-knowledge proofs for showing ...
Since their introduction in 1985, by Goldwasser, Micali and Rackoff, followed by Feige, Fiat and Sha...
We extend a commitment scheme based on the learning with errors over rings (RLWE) problem, and prese...