Paper 2009/448
Precise Bounded-Concurrent Zero-Knowledge in Almost Constant Rounds
Ning Ding, Dawu Gu, and Bart Preneel
Abstract
Precise concurrent zero-knowledge is a new notion introduced by
Pandey et al. \cite{P:P:M:T:V} in Eurocrypt'08 (which generalizes
the work on precise zero-knowledge by Micali and Pass \cite{M:P} in
STOC'06). This notion captures the idea that the view of any
verifier in concurrent interaction can be reconstructed in the
almost same time. \cite{P:P:M:T:V} constructed some (private-coin)
concurrent zero-knowledge argument systems for
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published elsewhere. not published
- Keywords
- Zero-KnowledgePrecise Zero-KnowledgeConcurrent Zero-KnowledgeInteractive Proofs and ArgumentsProofs of Knowledge
- Contact author(s)
- cs dingning @ gmail com
- History
- 2009-09-14: received
- Short URL
- https://ia.cr/2009/448
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2009/448, author = {Ning Ding and Dawu Gu and Bart Preneel}, title = {Precise Bounded-Concurrent Zero-Knowledge in Almost Constant Rounds}, howpublished = {Cryptology {ePrint} Archive, Paper 2009/448}, year = {2009}, url = {https://eprint.iacr.org/2009/448} }