Paper 2003/265

Concurrent/Resettable Zero-Knowledge With Concurrent Soundness in the Bare Public-Key Model and Its Applications

Yunlei ZHAO

Abstract

In this work, we investigate concurrent knowledge-extraction (CKE) and concurrent non-malleability (CNM) for concurrent (and stronger, resettable) ZK protocols in the bare public-key model. We formulate, driven by concrete attacks, and achieve CKE for constant-round concurrent/resettable arguments in the BPK model under standard polynomial assumptions. We get both generic and practical implementations. Here, CKE is a new concurrent verifier security that is strictly stronger than concurrent soundness in public-key model. We investigate, driven by concrete attacks, and clarify the subtleties in formulating CNM in the public-key model. We then give a new (augmented) CNM formulation in the public-key model and a construction of CNMZK in the public-key model satisfying the new CNM formulation.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. A new result that has not been published and has not been submitted to other places.
Keywords
concurrent knowledge-extractionconcurrent non-malleabilityconcurrentresettable zero-knowledgebare public-key model
Contact author(s)
ylzhao @ fudan edu cn
History
2007-03-07: last of 21 revisions
2004-01-02: received
See all versions
Short URL
https://ia.cr/2003/265
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2003/265,
      author = {Yunlei ZHAO},
      title = {Concurrent/Resettable Zero-Knowledge With Concurrent Soundness in  the Bare Public-Key  Model and Its Applications},
      howpublished = {Cryptology ePrint Archive, Paper 2003/265},
      year = {2003},
      note = {\url{https://eprint.iacr.org/2003/265}},
      url = {https://eprint.iacr.org/2003/265}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.