Results 1  10
of
821,689
An Efficient NonInteractive ZeroKnowledge Proof System for NP with General Assumptions
 Journal of Cryptology
, 1995
"... We consider noninteractive zeroknowledge proofs in the shared random string model proposed by Blum, Feldman and Micali [BFM88]. Until recently there was a sizable polynomial gap between the most efficient noninteractive proofs for NP based on general complexity assumptions [FLS90] versus those base ..."
Abstract

Cited by 25 (1 self)
 Add to MetaCart
We consider noninteractive zeroknowledge proofs in the shared random string model proposed by Blum, Feldman and Micali [BFM88]. Until recently there was a sizable polynomial gap between the most efficient noninteractive proofs for NP based on general complexity assumptions [FLS90] versus those
Increasing the Power of the Dealer in Noninteractive ZeroKnowledge Proof Systems
 In ASIACRYPT ’00: Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security
, 2000
"... Abstract. We introduce weaker models for noninteractive zero knowledge, in which the dealer is not restricted to deal a truly random string and may also have access to the input to the protocol (i.e. the statement to prove). We show in these models a noninteractive statistical zeroknowledge proof ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
proof for every language that has (interactive) statistical zeroknowledge proof, and a computational zeroknowledge proof for every language in NP. We also show how to change the latter proof system to fit the model of noninteractive computational zeroknowledge with preprocessingto improve
SuperPerfect ZeroKnowledge Proofs
, 2014
"... We initiate a study of superperfect zeroknowledge proof systems. Loosely speaking, these are proof systems for which the interaction can be perfectly simulated in strict probabilistic polynomialtime. In contrast, the standard definition of perfect zeroknowledge only requires that the interaction ..."
Abstract
 Add to MetaCart
proof system for Graph Isomorphism and other systems of the same form, including perfect zeroknowledge arguments for NP. The second type refers to perfect noninteractive zeroknowledge proof systems. We also present a superperfect noninteractive zeroknowledge proof system for the set
Efficient NonInteractive ZeroKnowledge Proofs of Circuit Satisfiability
 Institut for Matematik og Datalogi, Odense Universitet, Preprints 1994, Nr. 1, ISSN
, 1994
"... We show how to construct a "zeroknowledge proof" that a circuit of size m is satisfiable. The proof is a string of length O(m lg m) which is constructed (and can be verified) using a trusted random string of length O(m lg m). The probability of failure or of cheating is exponentially smal ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
. 1 Introduction A noninteractive zeroknowledge proof system is a protocol that allows a prover to convince a verifier tha...
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
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
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure PublicKey Encryption
, 2001
"... We present several new and fairly practical publickey encryption schemes and prove them secure against adaptive chosen ciphertext attack. One scheme is based on Paillier's Decision Composite Residuosity (DCR) assumption [7], while another is based in the classical Quadratic Residuosity (QR) ..."
Abstract

Cited by 191 (7 self)
 Add to MetaCart
) assumption. The analysis is in the standard cryptographic model, i.e., the security of our schemes does not rely on the Random Oracle model. We also introduce the notion of a universal hash proof system. Essentially, this is a special kind of noninteractive zeroknowledge proof system for an NP language
On the Composition of ZeroKnowledge Proof Systems
 SIAM Journal on Computing
, 1990
"... : The wide applicability of zeroknowledge interactive proofs comes from the possibility of using these proofs as subroutines in cryptographic protocols. A basic question concerning this use is whether the (sequential and/or parallel) composition of zeroknowledge protocols is zeroknowledge too. We ..."
Abstract

Cited by 214 (15 self)
 Add to MetaCart
: The wide applicability of zeroknowledge interactive proofs comes from the possibility of using these proofs as subroutines in cryptographic protocols. A basic question concerning this use is whether the (sequential and/or parallel) composition of zeroknowledge protocols is zeroknowledge too
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
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
Results 1  10
of
821,689