Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(3)
monotonicity formula
Structural Properties
Zero Knowledge
Subscribe
Academic
Publications
On Monotone Formula Composition of Perfect ZeroKnowledge Languages
On Monotone Formula Composition of Perfect ZeroKnowledge Languages,10.1137/S0097539798346123,Siam Journal on Computing,Alfredo De Santis,Giovanni Di
Edit
On Monotone Formula Composition of Perfect ZeroKnowledge Languages
(
Citations: 1
)
BibTex

RIS

RefWorks
Download
Alfredo De Santis
,
Giovanni Di Crescenzo
,
Giuseppe Persiano
,
Moti Yung
We investigate
structural properties
of interactive perfect zeroknowledge (PZK) proofs. Specifically, we look into the closure properties of PZK languages under monotone boolean formula composition. This gives rise to new protocol techniques. We show that interactive PZK for random selfreducible languages (RSR) (and for coRSR) is closed under monotone boolean formula composition. Namely, we present PZK proofs for monotone boolean formulae whose atoms are statements about membership in a PZK language which is RSR (or whose complement is RSR). We also discuss extensions, recent applications and generalizations of the techniques.
Journal:
Siam Journal on Computing  SIAMCOMP
, vol. 38, no. 4, pp. 13001329, 2008
DOI:
10.1137/S0097539798346123
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
dx.doi.org
)
(
aeolus.ceid.upatras.gr
)
(
link.aip.org
)
(
www.informatik.unitrier.de
)
More »
Citation Context
(1)
...accurate statement of their results) and [
12
] on the previously discussed protocol to prove statement ‘di = 1’ and the previously discussed protocol to prove statement ‘ ∨ i−1 j =1 ((dj = 1) ⊕ (tj = 1))’...
...All these properties are directly implied from the results in [8,
12
, 13] about the ORcomposition technique...
...This can be done using the ‘ANDcomposition’ technique from [8,
12
] on the just discussed protocol to prove statement Ui . This composition results in a 3message proof system for proving statement Φ1(d, t) where the verifier sends a single challenge, satisfying completeness, soundness (under the discrete logarithm assumption), and honestverifier zeroknowledge...
...All these properties are directly implied from the results in [8,
12
, 13] about the ANDcomposition technique...
Giovanni Di Crescenzo
,
et al.
On server trust in private proxy auctions
References
(53)
On Hiding Information from an Oracle
(
Citations: 146
)
Martín Abadi
,
Joan Feigenbaum
,
Joe Kilian
Journal:
Journal of Computer and System Sciences  JCSS
, vol. 39, no. 1, pp. 2150, 1989
Perfect zeroknowledge in constant rounds
(
Citations: 64
)
Mihir Bellare
,
Silvio Micali
,
Rafail Ostrovsky
Conference:
ACM Symposium on Theory of Computing  STOC
, pp. 482493, 1990
The (true) complexity of statistical zero knowledge
(
Citations: 44
)
Mihir Bellare
,
Silvio Micali
,
Rafail Ostrovsky
Conference:
ACM Symposium on Theory of Computing  STOC
, pp. 494502, 1990
Making zeroknowledge provers efficient
(
Citations: 28
)
Mihir Bellare
,
Erez Petrank
Conference:
ACM Symposium on Theory of Computing  STOC
, pp. 711722, 1992
How to Prove a Theorem so that No One Else Can Claim It
(
Citations: 111
)
M. Blum
Conference:
International Congress of Mathematicans  ICM
, 1986
Sort by:
Citations
(1)
On server trust in private proxy auctions
Giovanni Di Crescenzo
,
Javier Herranz
,
Germán Sáez
Journal:
Electronic Commerce Research  ECR
, vol. 10, no. 34, pp. 291311, 2010