GZKP: A GPU Accelerated Zero-Knowledge Proof System

被引:10
|
作者
Ma, Weiliang [1 ]
Xiong, Qian [1 ]
Shi, Xuanhua [1 ]
Ma, Xiaosong [2 ]
Jin, Hai [1 ]
Kuang, Haozhao [1 ]
Gao, Mingyu [3 ]
Zhang, Ye [4 ]
Shen, Haichen [4 ]
Hu, Weifang [1 ]
机构
[1] Huazhong Univ Sci & Technol, Natl Engn Res Ctr Big Data Technol & Syst, Serv Comp Technol & Syst Lab, Sch Comp Sci & Technol,Cluster & Grid Comp Lab, Wuhan, Hubei, Peoples R China
[2] Hamad Bin Khalifa Univ, Doha, Qatar
[3] Tsinghua Univ, Beijing, Peoples R China
[4] Scroll Fdn, Victoria, Beau Vallon, Seychelles
基金
国家重点研发计划;
关键词
zero-knowledge proof; GPU acceleration;
D O I
10.1145/3575693.3575711
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Zero-knowledge proof (ZKP) is a cryptographic protocol that allows one party to prove the correctness of a statement to another party without revealing any information beyond the correctness of the statement itself. It guarantees computation integrity and confidentiality, and is therefore increasingly adopted in industry for a variety of privacy-preserving applications, such as verifiable outsource computing and digital currency. A significant obstacle in using ZKP for online applications is the performance overhead of its proof generation. We develop GZKP, a GPU accelerated zero-knowledge proof system that supports different levels of security requirements and brings significant speedup toward making ZKP truly usable. For polynomial computation over a large finite field, GZKP promotes a cache-friendly memory access pattern while eliminating the costly external shuffle in existing solutions. For multi-scalar multiplication, GZKP adopts a new parallelization strategy, which aggressively combines integer elliptic curve point operations and exploits fine-grained task parallelism with load balancing for sparse integer distribution. GZKP outperforms the state-of-the-art ZKP systems by an order of magnitude, achieving up to 48.1x and 17.6x speedup with standard cryptographic benchmarks and a real-world application workload, respectively.
引用
收藏
页码:340 / 353
页数:14
相关论文
共 50 条
  • [21] DEFINITIONS AND PROPERTIES OF ZERO-KNOWLEDGE PROOF SYSTEMS
    GOLDREICH, O
    OREN, Y
    JOURNAL OF CRYPTOLOGY, 1994, 7 (01) : 1 - 32
  • [22] Interactive Physical Zero-Knowledge Proof for Norinori
    Dumas, Jean-Guillaume
    Lafourcade, Pascal
    Miyahara, Daiki
    Mizuki, Takaaki
    Sasaki, Tatsuya
    Sone, Hideaki
    COMPUTING AND COMBINATORICS, COCOON 2019, 2019, 11653 : 166 - 177
  • [23] Zero-knowledge proof for the independent set problem
    Caballero-Gil, P
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2005, E88A (05) : 1301 - 1302
  • [24] Certified Everlasting Zero-Knowledge Proof for QMA
    Hiroka, Taiga
    Morimae, Tomoyuki
    Nishimaki, Ryo
    Yamakawa, Takashi
    ADVANCES IN CRYPTOLOGY - CRYPTO 2022, PT I, 2022, 13507 : 239 - 268
  • [25] ZEKRO: Zero-Knowledge Proof of Integrity Conformance
    Debes, Heini Bergsson
    Giannetsos, Thanassis
    PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON AVAILABILITY, RELIABILITY AND SECURITY, ARES 2022, 2022,
  • [26] Efficient 4-round zero-knowledge proof system for NP
    Zhao, YL
    Zhu, H
    PROGRESS IN NATURAL SCIENCE-MATERIALS INTERNATIONAL, 2002, 12 (12) : 948 - 952
  • [27] Never trust victor:: An alternative resettable zero-knowledge proof system
    Müller, O
    Nüsken, M
    PROGRESS IN CRYPTOLOGY - INDOCRYPT 2002, PROCEEDINGS, 2002, 2551 : 79 - 92
  • [28] An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions
    Joe Kilian
    Erez Petrank
    Journal of Cryptology, 1998, 11 : 1 - 27
  • [29] Efficient 4-round zero-knowledge proof system for NP
    ZHAO Yunlei and ZHU Hong(1. Department of Computer Science
    2. Department of Computer Science
    ProgressinNaturalScience, 2002, (12) : 70 - 74
  • [30] NONINTERACTIVE ZERO-KNOWLEDGE PROOF OF KNOWLEDGE AND CHOSEN CIPHERTEXT ATTACK
    RACKOFF, C
    SIMON, DR
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 576 : 433 - 444