Results 1  10
of
192,718
NonMalleable NonInteractive Zero Knowledge and Adaptive ChosenCiphertext Security
, 1999
"... We introduce the notion of nonmalleable noninteractive zeroknowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong nonmalleability properties. We then show that the elegant encryption scheme of Naor and Yung [NY] can be made secure against ..."
Abstract

Cited by 190 (19 self)
 Add to MetaCart
We introduce the notion of nonmalleable noninteractive zeroknowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong nonmalleability properties. We then show that the elegant encryption scheme of Naor and Yung [NY] can be made secure against
Noninteractive ZeroKnowledge
 SIAM J. COMPUTING
, 1991
"... This paper investigates the possibility of disposing of interaction between prover and verifier in a zeroknowledge proof if they share beforehand a short random string. Without any assumption, it is proven that noninteractive zeroknowledge proofs exist for some numbertheoretic languages for which ..."
Abstract

Cited by 216 (19 self)
 Add to MetaCart
This paper investigates the possibility of disposing of interaction between prover and verifier in a zeroknowledge proof if they share beforehand a short random string. Without any assumption, it is proven that noninteractive zeroknowledge proofs exist for some numbertheoretic languages
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
Noninteractive zeroknowledge arguments for voting
 In proceedings of ACNS ’05, LNCS series
, 2005
"... Abstract. In voting based on homomorphic threshold encryption, the voter encrypts his vote and sends it in to the authorities that tally the votes. If voters can send in arbitrary plaintexts then they can cheat. It is therefore important that they attach an argument of knowledge of the plaintext bei ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
being a correctly formed vote. Typically, these arguments are honest verifier zeroknowledge arguments that are made noninteractive using the FiatShamir heuristic. Security is argued in the random oracle model. The simplest case is where each voter has a single vote to cast. Practical solutions have
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
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
Concurrent ZeroKnowledge
 IN 30TH STOC
, 1999
"... Concurrent executions of a zeroknowledge protocol by a single prover (with one or more verifiers) may leak information and may not be zeroknowledge in toto. In this paper, we study the problem of maintaining zeroknowledge We introduce the notion of an (; ) timing constraint: for any two proces ..."
Abstract

Cited by 177 (18 self)
 Add to MetaCart
interactive proofs and perfect concurrent zeroknowledge arguments for every language in NP . We also address the more specific problem of Deniable Authentication, for which we propose several particularly efficient solutions. Deniable Authentication is of independent interest, even in the sequential case
Noninteractive ZeroKnowledge from Homomorphic Encryption
 In TCC 2006
"... Abstract. We propose a method for compiling a class of Σprotocols (3move publiccoin protocols) into noninteractive zeroknowledge arguments. The method is based on homomorphic encryption and does not use random oracles. It only requires that a private/public key pair is set up for the verifier. ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
Abstract. We propose a method for compiling a class of Σprotocols (3move publiccoin protocols) into noninteractive zeroknowledge arguments. The method is based on homomorphic encryption and does not use random oracles. It only requires that a private/public key pair is set up for the verifier
Publickey Cryptosystems Provably Secure against Chosen Ciphertext Attacks
 In Proc. of the 22nd STOC
, 1995
"... We show how to construct a publickey cryptosystem (as originally defined by Diffie and Hellman) secure against chosen ciphertext attacks, given a publickey cryptosystem secure against passive eavesdropping and a noninteractive zeroknowledge proof system in the shared string model. No such secure ..."
Abstract

Cited by 284 (20 self)
 Add to MetaCart
We show how to construct a publickey cryptosystem (as originally defined by Diffie and Hellman) secure against chosen ciphertext attacks, given a publickey cryptosystem secure against passive eavesdropping and a noninteractive zeroknowledge proof system in the shared string model
Short Noninteractive ZeroKnowledge Proofs
, 2010
"... Abstract. We show that probabilistically checkable proofs can be used to shorten noninteractive zeroknowledge proofs. We obtain publicly verifiable noninteractive zeroknowledge proofs for circuit satisfiability with adaptive and unconditional soundness where the size grows quasilinearly in the ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract. We show that probabilistically checkable proofs can be used to shorten noninteractive zeroknowledge proofs. We obtain publicly verifiable noninteractive zeroknowledge proofs for circuit satisfiability with adaptive and unconditional soundness where the size grows quasi
Minimizing Noninteractive ZeroKnowledge Proofs Using Fully Homomorphic Encryption
, 2011
"... A noninteractive zeroknowledge proof can be used to demonstrate the truth of a statement without revealing anything else. It has been shown under standard cryptographic assumptions that noninteractive zeroknowledge proofs of membership exist for all languages in NP. However, known noninteractiv ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
A noninteractive zeroknowledge proof can be used to demonstrate the truth of a statement without revealing anything else. It has been shown under standard cryptographic assumptions that noninteractive zeroknowledge proofs of membership exist for all languages in NP. However, known noninteractive
Results 1  10
of
192,718