Results 1  10
of
98,362
Blind, Auditable Membership Proofs
, 1999
"... Auditability is an important property in financial systems and architectures. Here we define the primitive of "blind auditable membership proofs" (BAMP) which combines public auditability with privacy (i.e. user anonymity). In particular, one can view it as an auditable alternative to a ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Auditability is an important property in financial systems and architectures. Here we define the primitive of "blind auditable membership proofs" (BAMP) which combines public auditability with privacy (i.e. user anonymity). In particular, one can view it as an auditable alternative to a
Supporting Nonmembership Proofs with Bilinearmap Accumulators
, 2008
"... In this short note, we present an extension of Nguyen’s bilinearmap based accumulator scheme [8] to support nonmembership witnesses and corresponding nonmembership proofs, i.e., cryptographic proofs that an element has not been accumulated to a given set. This complements the nonmembership proof ..."
Abstract
 Add to MetaCart
In this short note, we present an extension of Nguyen’s bilinearmap based accumulator scheme [8] to support nonmembership witnesses and corresponding nonmembership proofs, i.e., cryptographic proofs that an element has not been accumulated to a given set. This complements the nonmembership
PrimarySecondaryResolver Membership Proof Systems
, 2014
"... We consider PrimarySecondaryResolver Membership Proof Systems (PSR for short) and show different constructions of that primitive. A PSR system is a 3party protocol, where we have a primary, which is a trusted party which commits to a set of members and their values, then generates a public and se ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We consider PrimarySecondaryResolver Membership Proof Systems (PSR for short) and show different constructions of that primitive. A PSR system is a 3party protocol, where we have a primary, which is a trusted party which commits to a set of members and their values, then generates a public
Proof verification and hardness of approximation problems
 IN PROC. 33RD ANN. IEEE SYMP. ON FOUND. OF COMP. SCI
, 1992
"... We show that every language in NP has a probablistic verifier that checks membership proofs for it using logarithmic number of random bits and by examining a constant number of bits in the proof. If a string is in the language, then there exists a proof such that the verifier accepts with probabilit ..."
Abstract

Cited by 797 (39 self)
 Add to MetaCart
We show that every language in NP has a probablistic verifier that checks membership proofs for it using logarithmic number of random bits and by examining a constant number of bits in the proof. If a string is in the language, then there exists a proof such that the verifier accepts
Probabilistic checking of proofs: a new characterization of NP
 JOURNAL OF THE ACM
, 1998
"... We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilistically in polynomial time using logarithmic number of random bits and by reading sublogarithmic number of bits from the proof ..."
Abstract

Cited by 414 (26 self)
 Add to MetaCart
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilistically in polynomial time using logarithmic number of random bits and by reading sublogarithmic number of bits from
Proofs that Yield Nothing but Their Validity or All Languages in NP Have ZeroKnowledge Proof Systems
 JOURNAL OF THE ACM
, 1991
"... In this paper the generality and wide applicability of Zeroknowledge proofs, a notion introduced by Goldwasser, Micali, and Rackoff is demonstrated. These are probabilistic and interactive proofs that, for the members of a language, efficiently demonstrate membership in the language without convey ..."
Abstract

Cited by 426 (43 self)
 Add to MetaCart
In this paper the generality and wide applicability of Zeroknowledge proofs, a notion introduced by Goldwasser, Micali, and Rackoff is demonstrated. These are probabilistic and interactive proofs that, for the members of a language, efficiently demonstrate membership in the language without
On the Degree of Ideal Membership Proofs From Uniform Families of Polynomials Over a Finite Field
"... Let f0 ; f1 ; : : : ; fk be nvariable polynomials over a finite prime field Fp . A proof of the ideal membership f0 2 hf1 ; : : : ; fk i in polynomial calculus is a sequence of polynomials h1 ; : : : ; h t such that h t = f0 , and such that every h i is either an f j , j 1, or obtained from h1 ..."
Abstract

Cited by 14 (5 self)
 Add to MetaCart
Let f0 ; f1 ; : : : ; fk be nvariable polynomials over a finite prime field Fp . A proof of the ideal membership f0 2 hf1 ; : : : ; fk i in polynomial calculus is a sequence of polynomials h1 ; : : : ; h t such that h t = f0 , and such that every h i is either an f j , j 1, or obtained from h1
NonDeterministic Exponential Time has TwoProver Interactive Protocols
"... We determine the exact power of twoprover interactive proof systems introduced by BenOr, Goldwasser, Kilian, and Wigderson (1988). In this system, two allpowerful noncommunicating provers convince a randomizing polynomial time verifier in polynomial time that the input z belongs to the language ..."
Abstract

Cited by 416 (37 self)
 Add to MetaCart
are strictly stronger than without, since NEXP # NP. In particular, for the first time, provably polynomial time intractable languages turn out to admit “efficient proof systems’’ since NEXP # P. We show that to prove membership in languages in EXP, the honest provers need the power of EXP only. A consequence
Specification and Proof in Membership Equational Logic
 THEORETICAL COMPUTER SCIENCE
, 1996
"... This paper is part of a longterm effort to increase expressiveness of algebraic specification languages while at the same time having a simple semantic basis on which efficient execution by rewriting and powerful theoremproving tools can be based. In particular, our rewriting techniques provide s ..."
Abstract

Cited by 129 (52 self)
 Add to MetaCart
semantic foundations for Maude's functional sublanguage, where they have been efficiently implemented. Membership equational logic is quite simple, and yet quite powerful. Its atomic formulae are equations and sort membership assertions, and its sentences are Horn clauses. It extends in a conservative
Trading Group Theory for Randomness
, 1985
"... In a previous paper [BS] we proved, using the elements of the Clwory of nilyotenf yroupu, that some of the /undamcnla1 computational problems in mat & proup, belong to NP. These problems were also ahown to belong to CONP, assuming an unproven hypofhedi.9 concerning finilc simple Q ’ oup,. The a ..."
Abstract

Cited by 353 (9 self)
 Add to MetaCart
,. The aim of this paper is t.o replace most of the (proven and unproven) group theory of IBS] by elementary combinatorial argumenls. The rev & we prove is that relative to a random oracle f3, tbc meutioned matrix group problems belong to (NPncoNP)L! Thr problems we consider arr membership in and order
Results 1  10
of
98,362