Results 1  10
of
569,892
New Techniques for Noninteractive ZeroKnowledge
"... Noninteractive zeroknowledge (NIZK) proof systems are fundamental primitives used in many cryptographic constructions, including CCA2secure cryptosystems, digital signatures, and various cryptographic protocols. We introduce new techniques for constructing NIZK proofs based on groups with a bilin ..."
Abstract
 Add to MetaCart
assumption. Keywords: Noninteractive zeroknowledge, witness indistinguishability, universal composability, groups with bilinear map, decision subgroup assumption, decisional linear assumption.
Efficient Cryptographic Primitives for NonInteractive ZeroKnowledge Proofs and Applications
, 2011
"... Noninteractive zeroknowledge (NIZK) proofs have enjoyed much interest in cryptography since they were introduced more than twenty years ago by Blum et al. [BFM88]. While quite useful when designing modular cryptographic schemes, until recently NIZK could be realized efficiently only using certain ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Noninteractive zeroknowledge (NIZK) proofs have enjoyed much interest in cryptography since they were introduced more than twenty years ago by Blum et al. [BFM88]. While quite useful when designing modular cryptographic schemes, until recently NIZK could be realized efficiently only using certain
On the complexity of BoundedInteraction and Noninteractive ZeroKnowledge Proofs
"... Abstract We consider the basic cryptographic primitive known as zeroknowledge proofs on committed bits. In this primitive, a prover P commits to a set of bits, and then at a later time convinces a verifier V that some property P holds for a subset of these bits. It is known how to implement this pr ..."
Abstract
 Add to MetaCart
Abstract We consider the basic cryptographic primitive known as zeroknowledge proofs on committed bits. In this primitive, a prover P commits to a set of bits, and then at a later time convinces a verifier V that some property P holds for a subset of these bits. It is known how to implement
Sublinear Size Pairingbased Noninteractive ZeroKnowledge Arguments
"... Abstract. We construct noninteractive zeroknowledge arguments for circuit satisfiability and arithmetic circuits with perfect completeness, perfect zeroknowledge and computational (co)soundness. The noninteractive zeroknowledge arguments have sublinear size and very efficient public verificati ..."
Abstract
 Add to MetaCart
verification. Our construction uses bilinear groups and is only proven secure in the generic group model, but does not rely on random oracles. Keywords: Sublinear size noninteractive zeroknowledge arguments, circuit satisfiability, pairingbased cryptography, generic group model. 1
Lower Bounds For Noninteractive Zeroknowledge
, 2007
"... We establish new lower bounds and impossibility results for noninteractive zeroknowledge proofs and arguments with setup assumptions. – For the common random string model, we exhibit a lower bound for the tradeoff between hardness assumptions and the length of the random string for noninteract ..."
Abstract
 Add to MetaCart
We establish new lower bounds and impossibility results for noninteractive zeroknowledge proofs and arguments with setup assumptions. – For the common random string model, we exhibit a lower bound for the tradeoff between hardness assumptions and the length of the random string for noninteractive
NonInteractive ZeroKnowledge Proofs of NonMembership
"... Abstract. Often, in privacysensitive cryptographic protocols, a party commits to a secret message m and later needs to prove thatm belongs to a language L or thatm does not belong to L (but does not want to reveal any further information). We present a method to prove in a noninteractive way that ..."
Abstract
 Add to MetaCart
introduced zeroknowledge proofs with witness elimination which enable to prove that a committed messagem belongs to a setL in such a way that the verifier accepts the interaction only ifm does not belong to a set determined by a public relation Q and some private input m ′ of the verifier. We show
A More Efficient Computationally Sound NonInteractive ZeroKnowledge Shuffle Argument
 SCN 2012, volume ? of LNCS
, 2012
"... Abstract. We propose a new noninteractive (perfect) zeroknowledge (NIZK) shuffle argument that, when compared the only previously known efficient NIZK shuffle argument by Groth and Lu, has a small constant factor times smaller computation and communication, and is based on more standard computatio ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. We propose a new noninteractive (perfect) zeroknowledge (NIZK) shuffle argument that, when compared the only previously known efficient NIZK shuffle argument by Groth and Lu, has a small constant factor times smaller computation and communication, and is based on more standard
New NonInteractive ZeroKnowledge Subset Sum, Decision Knapsack And Range Arguments
, 2013
"... Abstract. We propose several new efficient noninteractive zero knowledge (NIZK) arguments in the common reference string model. The final arguments are based on two building blocks, a more efficient version of Lipmaa’s Hadamard product argument from TCC 2012, and a novel shift argument. Based on th ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We propose several new efficient noninteractive zero knowledge (NIZK) arguments in the common reference string model. The final arguments are based on two building blocks, a more efficient version of Lipmaa’s Hadamard product argument from TCC 2012, and a novel shift argument. Based
Alternative Variants of ZeroKnowledge Proofs
, 2004
"... Zeroknowledge proofs are one of the most important cryptographic notions. Since their introduction in the early 80's by Goldwasser, Micali and Racko, they have proven very useful in the design of cryptographic protocols. Nevertheless, many limitations (in terms of e ciency and robustness under ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Zeroknowledge proofs are one of the most important cryptographic notions. Since their introduction in the early 80's by Goldwasser, Micali and Racko, they have proven very useful in the design of cryptographic protocols. Nevertheless, many limitations (in terms of e ciency and robustness
Subquadratic ZeroKnowledge
, 1995
"... We improve on the communication complexity of zeroknowledge proof systems. Let C be a boolean circuit of size n. Previous zeroknowledge proof systems for the satisfiability of C require the use of \Omega\Gamma kn) bit commitments in order to achieve a probability of undetected cheating below 2 \G ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
We improve on the communication complexity of zeroknowledge proof systems. Let C be a boolean circuit of size n. Previous zeroknowledge proof systems for the satisfiability of C require the use of \Omega\Gamma kn) bit commitments in order to achieve a probability of undetected cheating below 2
Results 1  10
of
569,892