Short Pairing-Based Non-interactive Zero-Knowledge Arguments

被引：0
|
作者：
Groth, Jens [1 ]
机构：
[1] UCL, London WC1E 6BT, England
来源：
ADVANCES IN CRYPTOLOGY - ASIACRYPT 2010 | 2010年 / 6477卷
基金：
英国工程与自然科学研究理事会;
关键词：
Sub-linear size non-interactive zero-knowledge arguments; pairing-based cryptography; power knowledge of exponent assumption; computational power Diffie-Hellman assumption; ENCRYPTION; PROOFS; SIZE; COMPLEXITY; SIGNATURES; NIZK;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero-knowledge and computational soundness. The non-interactive zero-knowledge arguments have sub-linear size and very efficient public verification. The size of the non-interactive zero-knowledge arguments can even be reduced to a constant number of group elements if we allow the common reference string to be large. Our constructions rely on groups with pairings and security is based on two new cryptographic assumptions; we do not use the Fiat-Shamir heuristic or random oracles.
引用
收藏
页码：321 / 340
页数：20
相关论文
共 50 条
  • [31] Increasing the power of the dealer in non-interactive zero-knowledge proof systems
    Gutfreund, D
    Ben-Or, M
    [J]. ADVANCES IN CRYPTOLOGY ASIACRYPT 2000, PROCEEDINGS, 2000, 1976 : 429 - 442
  • [32] Oracle separations between quantum and non-interactive zero-knowledge classes
    Morrison, Benjamin
    Groce, Adam
    [J]. INFORMATION PROCESSING LETTERS, 2020, 154
  • [33] Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model
    Unruh, Dominique
    [J]. ADVANCES IN CRYPTOLOGY - EUROCRYPT 2015, PT II, 2015, 9057 : 755 - 784
  • [34] A New Approach for Non-Interactive Zero-Knowledge from Learning with Errors
    Waters, Brent
    [J]. PROCEEDINGS OF THE 56TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2024, 2024, : 399 - 410
  • [35] Toward Non-interactive Zero-Knowledge Proofs for NP from LWE
    Ron D. Rothblum
    Adam Sealfon
    Katerina Sotiraki
    [J]. Journal of Cryptology, 2021, 34
  • [36] Toward Non-interactive Zero-Knowledge Proofs for NP from LWE
    Rothblum, Ron D.
    Sealfon, Adam
    Sotiraki, Katerina
    [J]. JOURNAL OF CRYPTOLOGY, 2021, 34 (01)
  • [37] Non-Interactive Zero-Knowledge Proofs with Fine-Grained Security
    Wang, Yuyu
    Pan, Jiaxin
    [J]. ADVANCES IN CRYPTOLOGY - EUROCRYPT 2022, PT II, 2022, 13276 : 305 - 335
  • [38] An Improved Non-Interactive Zero-Knowledge Range Proof for Decentralized Applications
    Tsai, Ya-Che
    Tso, Raylin
    Liu, Zi-Yuan
    Chen, Kung
    [J]. 2019 IEEE INTERNATIONAL CONFERENCE ON DECENTRALIZED APPLICATIONS AND INFRASTRUCTURES (DAPPCON), 2019, : 129 - 134
  • [39] New technique for chosen-ciphertext security based on non-interactive zero-knowledge
    Seo, Minhye
    Abdalla, Michel
    Lee, Dong Hoon
    Park, Jong Hwan
    [J]. INFORMATION SCIENCES, 2019, 490 : 18 - 35
  • [40] ID-based non-interactive zero-knowledge proof system based on one-out-of-two non-interactive oblivious transfer
    Chen, YH
    Hwang, T
    [J]. COMPUTER COMMUNICATIONS, 1995, 18 (12) : 993 - 996
12345