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 条
  • [41] RIPEMD with two-round compress function is not collision-free
    Hans Dobbertin
    Journal of Cryptology, 1997, 10 : 51 - 69
  • [42] Two-Round Multi-Signatures from Okamoto Signatures
    Lee, Kwangsu
    Kim, Hyoseung
    MATHEMATICS, 2023, 11 (14)
  • [43] RIPEMD with two-round compress function is not collision-free
    Dobbertin, H
    JOURNAL OF CRYPTOLOGY, 1997, 10 (01) : 51 - 69
  • [44] Garbled Protocols and Two-Round MPC from Bilinear Maps
    Garg, Sanjam
    Srinivasan, Akshayaram
    2017 IEEE 58TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2017, : 588 - 599
  • [45] Two-Round Man-in-the-Middle Security from LPN
    Cash, David
    Kiltz, Eike
    Tessaro, Stefano
    THEORY OF CRYPTOGRAPHY, TCC 2016-A, PT I, 2016, 9562 : 225 - 248
  • [46] Two-Round Multiparty Secure Computation from Minimal Assumptions
    Garg, Sanjam
    Srinivasan, Akshayaram
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2018, PT II, 2018, 10821 : 468 - 499
  • [47] Strategic voting in the second round of a two-round system: The 2014 French municipal elections
    Dolez B.
    Laurent A.
    Blais A.
    French Politics, 2017, 15 (1) : 27 - 42
  • [48] Better Two-Round Adaptive Multi-party Computation
    Canetti, Ran
    Poburinnaya, Oxana
    Venkitasubramaniam, Muthuramakrishnan
    PUBLIC-KEY CRYPTOGRAPHY (PKC 2017), PT II, 2017, 10175 : 396 - 427
  • [49] Two-Round Optimization Algorithm Based on Quadric Error Metrics
    Chang, Han
    Zhang, Di
    Dong, Yanan
    Yang, Yijun
    Shafiq Ur Rehman Khalil, Hafiz
    Wang, Xueting
    IEEE ACCESS, 2025, 13 : 30021 - 30035
  • [50] Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
    Garg, Sanjam
    Polychroniadou, Antigoni
    THEORY OF CRYPTOGRAPHY (TCC 2015), PT II, 2015, 9015 : 614 - 637
12345