Two-Round Witness Hiding Protocol

被引：0
|
作者：
Niu, Qihua [1 ]
Yan, Tongjiang [1 ,2 ]
Sun, Yuhua [1 ,3 ]
Zhao, Chun'e [1 ]
Tang, Fei [4 ]
机构：
[1] China Univ Petr Huadong, Coll Sci, Qingdao 266555, Shandong, Peoples R China
[2] Fujian Prov Univ, Putian Univ, Key Lab Appl Mat, Putian 351100, Fujian, Peoples R China
[3] Qilu Univ Technol, Shandong Acad Sci, Shandong Comp Sci Ctr, Natl Supercomp Ctr Jinan,Shandong Prov Key Lab Co, Jinan, Shandong, Peoples R China
[4] Chongqing Univ Posts & Telecommun, Sch Cyber Secur & Informat Law, Chongqing, Peoples R China
来源：
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | 2018年 / E101A卷 / 06期
基金：
中国国家自然科学基金;
关键词：
witness hiding; argument system; point obfuscation; adaptive witness encryption scheme; KNOWLEDGE PROOF SYSTEMS; INDISTINGUISHABILITY OBFUSCATION; ASSUMPTIONS; ENCRYPTION;
D O I：
10.1587/transfun.E101.A.953
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
The concept of witness hiding was proposed by Feige and Shamir as a natural relaxation of zero-knowledge. Prior constructions of witness hiding protocol for general hard distribution on NP language consist of at least three rounds. In this paper we construct a two-round witness hiding protocol for all hard distributions on NP language. Our construction is based on two primitives: point obfuscation and adaptive witness encryption scheme.
引用
收藏
页码：953 / 960
页数：8
相关论文
共 50 条
  • [21] Two-Round Diagnosability Measures for Multiprocessor Systems
    Liang, Jiarong
    Zhang, Qian
    Li, Changzhen
    COMPLEXITY, 2020, 2020
  • [22] Tuning a two-round group key agreement
    Weizheng Gao
    Kashi Neupane
    Rainer Steinwandt
    International Journal of Information Security, 2014, 13 : 467 - 476
  • [23] Anonymous voting by two-round public discussion
    Hao, F.
    Ryan, P. Y. A.
    Zielinski, P.
    IET INFORMATION SECURITY, 2010, 4 (02) : 62 - 67
  • [24] Minimizing the Two-Round Even–Mansour Cipher
    Shan Chen
    Rodolphe Lampe
    Jooyoung Lee
    Yannick Seurin
    John Steinberger
    Journal of Cryptology, 2018, 31 : 1064 - 1119
  • [25] Reusable Two-Round MPC from DDH
    Bartusek, James
    Garg, Sanjam
    Masny, Daniel
    Mukherjee, Pratyay
    THEORY OF CRYPTOGRAPHY, TCC 2020, PT II, 2020, 12551 : 320 - 348
  • [26] One-round vs Two-round Elections: An Experimental Study
    André Blais
    Jean-François Laslier
    Annie Laurent
    Nicolas Sauger
    Karine Van der Straeten
    French Politics, 2007, 5 (3) : 278 - 286
  • [27] One-round vs Two-round Elections: An Experimental Study
    Blais, Andre
    Laslier, Jean-Francois
    Laurent, Annie
    Sauger, Nicolas
    Van der Straeten, Karine
    FRENCH POLITICS, 2007, 5 (03) : 278 - 286
  • [28] Two-Round Secure MPC from Indistinguishability Obfuscation
    Garg, Sanjam
    Gentry, Craig
    Halevi, Shai
    Raykova, Mariana
    THEORY OF CRYPTOGRAPHY (TCC 2014), 2014, 8349 : 74 - 94
  • [29] The effect of two-round presidential elections on human rights
    Holzer, Joshua
    PLOS ONE, 2020, 15 (12):
  • [30] Minimizing the Two-Round Even-Mansour Cipher
    Chen, Shan
    Lampe, Rodolphe
    Lee, Jooyoung
    Seurin, Yannick
    Steinberger, John
    JOURNAL OF CRYPTOLOGY, 2018, 31 (04) : 1064 - 1119
12345