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
(7)
Knowledge Extraction
Oneway Function
Polynomial Time
Proof of Knowledge
Satisfiability
Zero Knowledge
Bare Public Key
Related Publications
(1)
Resettable ZeroKnowledge
Subscribe
Academic
Publications
Generic and Practical Resettable ZeroKnowledge in the Bare PublicKey Model
Generic and Practical Resettable ZeroKnowledge in the Bare PublicKey Model,10.1007/9783540725404_8,Moti Yung,Yunlei Zhao
Edit
Generic and Practical Resettable ZeroKnowledge in the Bare PublicKey Model
(
Citations: 7
)
BibTex

RIS

RefWorks
Download
Moti Yung
,
Yunlei Zhao
We present a generic construction for constantround concurrsound resettable zeroknowledge (rZKCS) arguments for NP\mathcal{NP} in the bare publickey (BPK) model under any (subexponentially strong)
oneway function
(OWF), which is a traditional assumption in this area. The generic construction in turn allows roundoptimal implementation for NP\mathcal{NP} still under general assumptions, and can be converted into a highly practical instantiation (under specific numbertheoretic assumptions) for any language admitting Σprotocols. Further, the rZKCS arguments developed in this work also satisfy a weak (blackbox) concurrent knowledgeextractability property as proofs of knowledge, in which case some superpolynomialtime assumption is intrinsic.
Conference:
Theory and Application of Cryptographic Techniques  EUROCRYPT
, pp. 129147, 2007
DOI:
10.1007/9783540725404_8
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.
(
www.springerlink.com
)
(
www.springerlink.com
)
(
adsabs.harvard.edu
)
(
dx.doi.org
)
(
www.informatik.unitrier.de
)
More »
Citation Context
(3)
...The BPK model has been further studied in many papers, including [29,11,17,18,
39
,15], where the main focus was to present constantround concurrently sound and concurrent/resettable zeroknowledge protocols...
Yi Deng
,
et al.
Concurrently Nonmalleable BlackBox Zero Knowledge in the Bare Public...
...Several constantround concurrent and resettable zeroknowledge protocols have been presented in the BPK model; all these protocols either make additional model assumptions on top of the BPK model [23,11,29], or do not satisfy concurrent soundness [3,9], or require complexity assumptions against subexponentialtime algorithms [10,
28
]...
Giovanni Di Crescenzo
.
Minimal Assumptions and Round Complexity for Concurrent ZeroKnowledge...
...We note that the use of complexity leveraging for frustrating concurrent MIM could be a novel paradigm, difierent from the uses of complexity leveraging in existing works (e.g., [12,
76
])...
Andrew C. Yao
,
et al.
Concurrent Knowledge Extraction in the PublicKey Model
References
(21)
ResettablySound ZeroKnowledge and its Applications
(
Citations: 43
)
Boaz Barak
,
Oded Goldreich
,
Shafi Goldwasser
,
Yehuda Lindell
Conference:
IEEE Symposium on Foundations of Computer Science  FOCS
, pp. 116125, 2001
Identification Protocols Secure against Reset Attacks
(
Citations: 33
)
Mihir Bellare
,
Marc Fischlin
,
Shafi Goldwasser
,
Silvio Micali
Conference:
Theory and Application of Cryptographic Techniques  EUROCRYPT
, pp. 495511, 2001
How to prove a theorem so no one else can claim it
(
Citations: 78
)
M. Blum
Conference:
International Congress of Mathematicans  ICM
, 1987
Resettable ZeroKnowledge
(
Citations: 104
)
Ran Canetti
,
Oded Goldreich
,
Shafi Goldwasser
,
Silvio Micali
Journal:
Electronic Colloquium on Computational Complexity  ECCC
, no. 42, 1999
BlackBox Concurrent ZeroKnowledge Requires (Almost) Logarithmically Many Rounds
(
Citations: 27
)
Ran Canetti
,
Joe Kilian
,
Erez Petrank
,
Alon Rosen
Journal:
Siam Journal on Computing  SIAMCOMP
, vol. 32, no. 1, pp. 147, 2002
Sort by:
Citations
(7)
Concurrent KnowledgeExtraction in the PublicKey Model
(
Citations: 4
)
Andrew Chichih Yao
,
Moti Yung
,
Yunlei Zhao
Journal:
Computing Research Repository  CORR
, vol. abs/0908.2, pp. 702714, 2009
Adaptive Concurrent NonMalleability with Bare PublicKeys
(
Citations: 3
)
Andrew Chichih Yao
,
Moti Yung
,
Yunlei Zhao
Journal:
Computing Research Repository  CORR
, vol. abs/0910.3, 2009
Concurrently Nonmalleable BlackBox Zero Knowledge in the Bare PublicKey Model
(
Citations: 1
)
Yi Deng
,
Giovanni Di Crescenzo
,
Dongdai Lin
,
Dengguo Feng
Conference:
Computer Science Symposium in Russia  CSR
, pp. 8091, 2009
Minimal Assumptions and Round Complexity for Concurrent ZeroKnowledge in the Bare PublicKey Model
Giovanni Di Crescenzo
Conference:
Computing and Combinatorics  COCOON
, pp. 127137, 2009
Adaptive Concurrent NonMalleability with Bare PublicKeys
(
Citations: 3
)
Andrew C. Yao
,
Moti Yung
,
Yunlei Zhao