Non-interactive Zero-Knowledge from LPN and MQ

被引：0
|
作者：
Dao, Quang [1 ]
Jain, Aayush [1 ]
Jin, Zhengzhong [2 ]
机构：
[1] Carnegie Mellon University, Pittsburgh, United States
[2] MIT, Cambridge, United States
来源：
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2024年 / 14928 LNCS卷
关键词：
Compilation and indexing terms; Copyright 2025 Elsevier Inc;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Exponential functions - Inverse problems - Polynomials - Public key cryptography - Quantum cryptography - Random errors
引用
收藏
页码：321 / 360
相关论文
共 50 条
  • [41] Non-interactive Zero-Knowledge in Pairing-Free Groups from Weaker Assumptions
    Couteau, Geoffroy
    Katsumata, Shuichi
    Ursu, Bogdan
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2020, PT III, 2020, 12107 : 442 - 471
  • [42] A more efficient computationally sound non-interactive zero-knowledge shuffle argument
    Lipmaa, Helger
    Zhang, Bingsheng
    JOURNAL OF COMPUTER SECURITY, 2013, 21 (05) : 685 - 719
  • [43] Efficient non-interactive zero-knowledge proofs for quantum range verification in blockchain
    Sriman, B.
    Kumar, S. Ganesh
    PEER-TO-PEER NETWORKING AND APPLICATIONS, 2024, 17 (05) : 2661 - 2674
  • [44] Non-Interactive Zero-Knowledge and applications: Two round authenticated key agreement
    Saxena, A
    Soh, B
    2005 13TH IEEE INTERNATIONAL CONFERENCE ON NETWORKS JOINTLY HELD WITH THE 2005 7TH IEEE MALAYSIA INTERNATIONAL CONFERENCE ON COMMUNICATIONS, PROCEEDINGS 1 AND 2, 2005, : 722 - 726
  • [45] Efficient non-interactive zero-knowledge watermark detector robust to sensitivity attacks
    Troncoso, Juan Ramon
    Perez-Gonzalez, Fernando
    SECURITY, STEGANOGRAPHY, AND WATERMARKING OF MULTIMEDIA CONTENTS IX, 2007, 6505
  • [46] Non-interactive zero-knowledge proof scheme from RLWE-based key exchange
    Xie, Shaofen
    Yao, Wang
    Wu, Faguo
    Zheng, Zhiming
    PLOS ONE, 2021, 16 (08):
  • [47] Necessary and sufficient assumptions for non-interactive zero-knowledge proofs of knowledge for all NP relations
    De Santis, A
    Di Crescenzo, G
    Persiano, G
    AUTOMATA LANGUAGES AND PROGRAMMING, 2000, 1853 : 451 - 462
  • [48] On NC1 Boolean circuit composition of non-interactive perfect zero-knowledge
    De Santis, A
    Di Crescenzo, G
    Persiano, G
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2004, PROCEEDINGS, 2004, 3153 : 356 - 367
  • [49] Efficient Non-interactive Zero-Knowledge Proof for Graph 3-Coloring Problem
    Zhan, Haitao
    Bai, Dongyang
    Wang, Yuzhu
    Zhang, Mingwu
    FRONTIERS IN CYBER SECURITY, FCS 2023, 2024, 1992 : 370 - 386
  • [50] How to Achieve Perfect Simulation and a Complete Problem for Non-interactive Perfect Zero-Knowledge
    Lior Malka
    Journal of Cryptology, 2015, 28 : 533 - 550
12345