Results 1  10
of
1,100,524
On the design and implementation of efficient zeroknowledge proofs of knowledge
 In Software Performance Enhancements for Encryption and Decryption and Cryptographic Compilers – SPEEDCC 09
"... Abstract. Zeroknowledge proofs of knowledge (ZKPoK) play an important role in many cryptographic applications. Direct anonymous attestation (DAA) and the identity mixer anonymous authentication system are first real world applications using ZKPoK as building blocks. But although being used for ma ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract. Zeroknowledge proofs of knowledge (ZKPoK) play an important role in many cryptographic applications. Direct anonymous attestation (DAA) and the identity mixer anonymous authentication system are first real world applications using ZKPoK as building blocks. But although being used
Commitments and Efficient ZeroKnowledge Proofs from Learning Parity with Noise ⋆
"... Abstract. We construct a perfectly binding string commitment scheme whose security is based on the learning parity with noise (LPN) assumption, or equivalently, the hardness of decoding random linear codes. Our scheme not only allows for a simple and efficient zeroknowledge proof of knowledge for c ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. We construct a perfectly binding string commitment scheme whose security is based on the learning parity with noise (LPN) assumption, or equivalently, the hardness of decoding random linear codes. Our scheme not only allows for a simple and efficient zeroknowledge proof of knowledge
A note on efficient zeroknowledge proofs and arguments (Extended Abstract)
, 1992
"... In this note, we present new zeroknowledge interactive proofs and arguments for languages in NP. To show that z G L, with an error probability of at most 2k, our zeroknowledge proof system requires O(lzlc’) + O(lg ” l~l)k ideal bit commitments, where c1 and cz depend only on L. This construction ..."
Abstract

Cited by 176 (2 self)
 Add to MetaCart
. This construction is the first in the ideal bit commitment model that achieves large values of k more efficiently than by running k independent iterations of the base interactive proof system. Under suitable complexity assumptions, we exhibit a zeroknowledge arguments that require O(lg ’ Izl)ki bits
Linear ZeroKnowledge  A Note on Efficient ZeroKnowledge Proofs and Arguments
, 1996
"... We present a zeroknowledge proof system [19] for any NP language L, which allows showing that x 2 L with error probability less than 2 using communication corresponding to O(jxj ) + k bit commitments, where c is a constant depending only on L. The proof can be based on any bit commitment s ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
We present a zeroknowledge proof system [19] for any NP language L, which allows showing that x 2 L with error probability less than 2 using communication corresponding to O(jxj ) + k bit commitments, where c is a constant depending only on L. The proof can be based on any bit commitment
Efficient ZeroKnowledge Proofs of Knowledge Without Intractability Assumptions
, 2000
"... We initiate the investigation of the class of relations that admit extremely efficient perfect zero knowledge proofs of knowledge: constant number of rounds, communication linear in the length of the statement and the witness, and negligible knowledge error. In its most general incarnation, our ..."
Abstract

Cited by 41 (0 self)
 Add to MetaCart
essentially for free, even when proving statements on several instances combined under under monotone function composition. In addition, perfect zeroknowledge is achieved with an optimal 4moves. Instantiations of our main protocol lead to efficient perfect ZK proofs of knowledge of discrete logarithms
Efficient ZeroKnowledge Proofs for Commitments from Learning With Errors over Rings?
"... Abstract. We design an efficient commitment scheme, and companion zeroknowledge proofs of knowledge, based on the learning with errors over rings (RLWE) problem. In particular, for rings in which almost all elements have inverses, we construct a perfectly binding commitment scheme whose hiding prop ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. We design an efficient commitment scheme, and companion zeroknowledge proofs of knowledge, based on the learning with errors over rings (RLWE) problem. In particular, for rings in which almost all elements have inverses, we construct a perfectly binding commitment scheme whose hiding
Efficient ZeroKnowledge Proofs for Some Practical Graph Problems
"... From a cryptographic aspect zeroknowledge protocols for graph isomorphisms, graph nonisomorphisms, and graphcoloring are artificial problems, that received lots of attention. Due to recent work in network security in a broadcast setting, it seems important to design efficient zeroknowledge proto ..."
Abstract
 Add to MetaCart
From a cryptographic aspect zeroknowledge protocols for graph isomorphisms, graph nonisomorphisms, and graphcoloring are artificial problems, that received lots of attention. Due to recent work in network security in a broadcast setting, it seems important to design efficient zeroknowledge
Efficient ZeroKnowledge Proofs of NonAlgebraic Statements with Sublinear Amortized Cost∗
, 2015
"... We describe a zeroknowledge proof system in which a prover holds a large dataset M and can repeatedly prove NP relations about that dataset. That is, for any (public) relation R and x, the prover can prove that ∃w: R(M,x,w) = 1. After an initial setup phase (which depends only on M), each proof re ..."
Abstract
 Add to MetaCart
We describe a zeroknowledge proof system in which a prover holds a large dataset M and can repeatedly prove NP relations about that dataset. That is, for any (public) relation R and x, the prover can prove that ∃w: R(M,x,w) = 1. After an initial setup phase (which depends only on M), each proof
ZKPDL: A LanguageBased System for Efficient ZeroKnowledge Proofs and Electronic Cash
"... In recent years, many advances have been made in cryptography, as well as in the performance of communication networks and processors. As a result, many advanced cryptographic protocols are now efficient enough to be considered practical, yet research in the area remains largely theoretical and litt ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
and little work has been done to use these protocols in practice, despite a wealth of potential applications. This paper introduces a simple description language, ZKPDL, and an interpreter for this language. ZKPDL implements noninteractive zeroknowledge proofs of knowledge, a primitive which has received
Bringing zeroknowledge proofs of knowledge to practice
 In 17th International Workshop on Security Protocols
, 2009
"... Abstract. Efficient zeroknowledge proofs of knowledge (ZKPoK) are basic building blocks of many practical cryptographic applications such as identification schemes, group signatures, and secure multiparty computation. Currently, first applications that critically rely on ZKPoKs are being deployed ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
Abstract. Efficient zeroknowledge proofs of knowledge (ZKPoK) are basic building blocks of many practical cryptographic applications such as identification schemes, group signatures, and secure multiparty computation. Currently, first applications that critically rely on ZKPoKs are being
Results 1  10
of
1,100,524