Cryptology ePrint Archive: Report 2010/107

Adaptive Concurrent Non-Malleability with Bare Public-Keys

Andrew C. Yao and Moti Yung and Yunlei Zhao

Abstract: 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.

Category / Keywords: foundations /

Date: received 26 Feb 2010, last revised 18 Feb 2011

Contact author: yunleizhao at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20110218:070659 (All versions of this report)

Short URL: ia.cr/2010/107

Discussion forum: Show discussion | Start new discussion