Paper 2010/107

Adaptive Concurrent Non-Malleability with Bare Public-Keys

Andrew C. Yao, Moti Yung, and Yunlei Zhao


Coin-tossing (CT) is one of the earliest and most fundamental protocol problems in the literature. In this work, we formalize and construct (constant-round) concurrent non-malleable coin-tossing (CNMCT) in the bare public-key (BPK) model. The CNMCT protocol can, in particular, be used to transform CNM zero-knowledge (CNMZK) in the common random string (CRS) model into the BPK model with full adaptive input (statements and language) selection. Here, full adaptive input selection in the public-key model means that the concurrent man-in-the-middle (CMIM) adversary can adaptively set statements to all sessions at any point of the concurrent execution evolution (not necessarily at the beginning of each session), and can set the underlying language based upon honest players’ public-keys.

Available format(s)
Publication info
Published elsewhere. Unknown where it was published
Contact author(s)
yunleizhao @ gmail com
2011-02-18: revised
2010-03-01: received
See all versions
Short URL
Creative Commons Attribution


      author = {Andrew C.  Yao and Moti Yung and Yunlei Zhao},
      title = {Adaptive Concurrent Non-Malleability with Bare Public-Keys},
      howpublished = {Cryptology ePrint Archive, Paper 2010/107},
      year = {2010},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.