AbstractProtocols are given for allowing a “prover” to convince a “verifier” that the prover knows some verifiable secret information, without allowing the verifier to learn anything about the secret. The secret can be probabilistically or deterministically verifiable, and only one of the prover or the verifier need have constrained resources. This paper unifies and extends models and techniques previously put forward by the authors, and compares some independent related work
In a proof of partial knowledge, introduced by Cramer, Damgård and Schoenmakers (CRYPTO 1994), a pro...
This paper explores the complexity-theoretic approach to the transmission of knowledge that was intr...
email ivandaimiaaudk Suppose we are given a proof of knowledge P in which a prover demonstrates that...
Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution ...
Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution ...
Abstract. We introduce a new notion called ℓ-isolated proofs of knowledge (ℓ-IPoK). These are proofs...
For various well-known proofs of knowledge, we address the problem of how much information a cheatin...
Abstract This note points out a gap between two natural formulations of the concept of a proof of kn...
Since their introduction in 1985, by Goldwasser, Micali and Rackoff, followed by Feige, Fiat and Sha...
In a Conditional Disclosure of Secrets (CDS) a verifier V wants to reveal a message m to a prover P...
International audienceWe consider opacity questions where an observation function provides to an ext...
this paper a practical computationally secure solution. This solution is inspired by our work on zer...
We study interactive communication of knowledge from the point of view of resource-bounded computati...
Interactive communication of knowledge from the point of view of resource-bounded computational comp...
Zero-knowledge set is a primitive introduced by Micali, Rabin, and Kilian (FOCS 2003) which enables ...
In a proof of partial knowledge, introduced by Cramer, Damgård and Schoenmakers (CRYPTO 1994), a pro...
This paper explores the complexity-theoretic approach to the transmission of knowledge that was intr...
email ivandaimiaaudk Suppose we are given a proof of knowledge P in which a prover demonstrates that...
Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution ...
Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution ...
Abstract. We introduce a new notion called ℓ-isolated proofs of knowledge (ℓ-IPoK). These are proofs...
For various well-known proofs of knowledge, we address the problem of how much information a cheatin...
Abstract This note points out a gap between two natural formulations of the concept of a proof of kn...
Since their introduction in 1985, by Goldwasser, Micali and Rackoff, followed by Feige, Fiat and Sha...
In a Conditional Disclosure of Secrets (CDS) a verifier V wants to reveal a message m to a prover P...
International audienceWe consider opacity questions where an observation function provides to an ext...
this paper a practical computationally secure solution. This solution is inspired by our work on zer...
We study interactive communication of knowledge from the point of view of resource-bounded computati...
Interactive communication of knowledge from the point of view of resource-bounded computational comp...
Zero-knowledge set is a primitive introduced by Micali, Rabin, and Kilian (FOCS 2003) which enables ...
In a proof of partial knowledge, introduced by Cramer, Damgård and Schoenmakers (CRYPTO 1994), a pro...
This paper explores the complexity-theoretic approach to the transmission of knowledge that was intr...
email ivandaimiaaudk Suppose we are given a proof of knowledge P in which a prover demonstrates that...
DOI
Add to ORKG