HUANG Guifang, LIN Dongdai. Unbounded Non-Malleable Non-Interactive Zero Knowledge Protocols for NP[J]. Chinese Journal of Electronics, 2009, 18(3): 400-404.
Citation: HUANG Guifang, LIN Dongdai. Unbounded Non-Malleable Non-Interactive Zero Knowledge Protocols for NP[J]. Chinese Journal of Electronics, 2009, 18(3): 400-404.

Unbounded Non-Malleable Non-Interactive Zero Knowledge Protocols for NP

  • Received Date: 2008-07-01
  • Rev Recd Date: 2009-02-01
  • Publish Date: 2009-08-25
  • In asynchronous network communication, non-malleability is requiredto resist against man-in-the-middle attack. Based on the existenceof one-way permutation, we propose two unbounded non-malleableNon-interactive zero knowledge (NIZK) protocols. Firstly, by usingNIZK argument of knowledge instead of as abuilding block, we transform 5-rounds concurrent non-malleable zeroknowledge argument in the Common reference string (CRS)model[15] to non-malleable NIZK argument. The transformationachieves optimal round efficiency in the same model. Secondly, wesimplify the second scheme in CRYPO'01[8] by using thetechnique hidden unduplicatable set selection. In thesimplified scheme, the CRS is much shorter and statements to beproved in the two NIZK sub-protocols are simplified.
  • loading
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (494) PDF downloads(594) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return