[1]Goldwasser S, Micali S, Rackoff C. The knowledge complexity of interactive proofsystems[M] Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali. New York: ACM, 2019: 203225[2]Nitulescu A. zkSNARKs: A gentle introduction[R]. Paris: Ecole Normale Superieure, 2020[3]李威翰, 张宗洋, 周子博, 等. 简洁非交互零知识证明综述[J]. 密码学报, 2022, 9(3): 379447[4] Patel S, Wenmei W H. Accelerator architectures[J]. IEEE Micro, 2008, 28(4): 412[5]Aluru S,Jammula N. A review of hardware acceleration for computational genomics[J]. IEEE Design & Test, 2013, 31(1): 1930[6]Peccerillo B, Mannino M, Mondelli A, et al. A survey on hardware accelerators: Taxonomy, trends, challenges, and perspectives[J]. Journal of Systems Architecture, 2022, 129: 102561[7]Lu T, Wei C, Yu R, et al. cuZK: Accelerating zeroknowledge proof with a faster parallel multiscalar multiplication algorithm on GPUs[J]. IACR Trans on Cryptographic Hardware and Embedded Systems, 2023, 2023(3): 194220[8]Ma W, Xiong Q, Shi X, et al. GZKP: A GPU accelerated zeroknowledge proof system[C] Proc of the 28th ACM Int Conf on Architectural Support for Programming Languages and Operating Systems, Vol 2. New York: ACM, 2023: 340353[9] Zhang Y, Wang S, Zhang X, et al. Pipezk: Accelerating zeroknowledge proof with a pipelined architecture[C] Proc of the 48th ACMIEEE Annual Int Symp on Computer Architecture (ISCA). Piscataway, NJ: IEEE, 2021: 416428[10]Xavier C F. Pipemsm: Hardware acceleration for multiscalar multiplication[JOL]. Cryptology ePrint Archive, 2022 [20240220]. https:eprint.iacr.org2022999[11]Zhao B, Huang W, Li T, et al. BSTMSM: A highperformance FPGAbased multiscalar multiplication hardware accelerator[C] Proc of 2023 Int Conf on Field Programmable Technology (ICFPT). Piscataway, NJ: IEEE, 2023: 3543[12]Pippenger N. On the evaluation of powers and related problems[C] Proc of the 17th Annual Symp on Foundations of Computer Science. Los Alamitos, CA: IEEE Computer Society, 1976: 258263[13]Sze T W. Schnhagestrassen algorithm with mapreduce for multiplying terabit integers[C] Proc of the 2011 Int Workshop on SymbolicNumeric Computation. New York: ACM, 2012: 5462[14]Kim S, Jung W, Park J, et al. Accelerating number theoretic transformations for bootstrappable homomorphic encryption on GPUs[C] Proc of 2020 IEEE Int Symp on Workload Characterization (IISWC). Piscataway, NJ: IEEE, 2020: 264275[15]Zhang N, Qin Q, Yuan H, et al. NTTU: An areaefficient lowpower NTTuncoupled architecture for NTTbased multiplication[J]. IEEE Trans on Computers, 2019, 69(4): 520533[16]Gupta N, Jati A, Chauhan A K, et al.Pqc acceleration using GPUs: Frodokem, newhope, and kyber[J]. IEEE Trans on Parallel and Distributed Systems, 2020, 32(3): 575586[17]Bünz B, Bootle J, Boneh D, et al. Bulletproofs: Short proofs for confidential transactions and more[C] Proc of 2018 IEEE Symp on Security and Privacy (SP). Piscataway, NJ: IEEE, 2018: 315334[18]apko D, Vukmirovi S, Nedi N. State of the art of zeroknowledge proofs in blockchain[C] Proc of the 30th Telecommunications Forum (TELFOR). Piscataway, NJ: IEEE, 2022: 14[19]Huang Y, Zheng X, Zhu Y. Optimized CPUGPU collaborative acceleration of zeroknowledge proof for confidential transactions[J]. Journal of Systems Architecture, 2023, 135: 102807 [20] Kato S, Aumiller J, Brandt S. Zerocopy IO processing for lowlatency GPU computing[C] Proc of the 4th ACMIEEE Int Conf on CyberPhysical Systems. New York: ACM, 2013: 170178[21]BenediktBünz. BulletProofLib[CPOL]. [20240328]. https:github.combbuenzBulletProofLib[22]宋英齐, 冯荣权. 零知识证明在区块链中的应用综述[J]. 广州大学学报: 自然科学版, 2022, 21(4): 2136[23]Sasson E B, Chiesa A, Garman C, et al. Zerocash: Decentralized anonymous payments from bitcoin[C] Proc of 2014 IEEE Symp on Security and Privacy. Piscataway, NJ: IEEE, 2014: 459474[24] Kappos G, Yousaf H, Maller M, et al. An empirical analysis of anonymity inzcash[C] Proc of the 27th USENIX Security Symp (USENIX Security 18). Berkeley, CA: USENIX Association, 2018: 463477[25]Banerjee A, Clear M, Tewari H. Demystifying the role of zkSNARKs in Zcash[C] Proc of 2020 IEEE Conf on Application, Information and Network Security (AINS). Piscataway, NJ: IEEE, 2020: 1219[26]Zcash Foundation. Early results from an FPGA acceleration project[EBOL]. [20240328]. https:zfnd.orgearlyresultsfromanfpgaaccelerationproject[27]Ben D. zcash_fpga_design[CPOL]. [20240328]. https:github.comZcashFoundationzcashfpgablobmasterzcash_fpga_design_doc_v1.4.2.pdf[28]coinlist. Coda+Dekrypt: The SNARK challenge[EBOL]. [20240328]. https:coinlist.cobuildcoda[29]Hoffmann M, Kloo M, Rupp A. Efficient zeroknowledge arguments in the discrete log setting, revisited[C] Proc of the 2019 ACM SIGSAC Conf on Computer and Communications Security. New York: ACM, 2019: 20932110[30]Zhang Z, Zhou Z, Li W, et al. An optimized inner product argument with more application scenarios[C] Proc of the 23rd Information and Communications Security. Berlin: Springer, 2021: 341357[31]Daza V,Ràfols C, Zacharakis A. Updateable inner product argument with logarithmic verifier and applications[C] Proc of the 23rd IACR Int Conf on Practice and Theory of PublicKey Cryptography. Berlin: Springer, 2020: 527557[32]Groth J. On the size of pairingbased noninteractive arguments[C] Proc of the 35th Annual Int Conf on the Theory and Applications of Cryptographic Techniques. Berlin: Springer, 2016: 305326[33]Groth J, Kohlweiss M, Maller M, et al. Updatable and universal common reference strings with applications to zkSNARKs[C] Proc of Annual Int Cryptology Conf. Berlin: Springer, 2018: 698728[34]Maller M, Bowe S,Kohlweiss M, et al. Sonic: Zeroknowledge SNARKs from linearsize universal and updatable structured reference strings[C] Proc of the 2019 ACM SIGSAC Conf on Computer and Communications Security. New York: ACM, 2019: 21112128[35]Danezis G, Fournet C, Kohlweiss M, et al. Pinocchio coin: Building zerocoin from a succinct pairingbased proof system[C] Proc of the 1st ACM Workshop on Language Support for PrivacyEnhancing Technologies. New York: ACM, 2013: 2730[36]DelignatLavaud A, Fournet C, Kohlweiss M, et al. Cinderella: Turning shabby X.509 certificates into elegant anonymous credentials with the magic of verifiable computation[C] Proc of 2016 IEEE Symp on Security and Privacy (SP). Piscataway, NJ: IEEE, 2016: 235254[37]施明杰, 解程宇, 张传富. 一种基于零知识证明的军事物联网位置隐私保护方案设计与仿真(英文)[J]. 系统仿真学报, 2023, 35(10): 22372248[38]Morais E, Koens T, Van Wijk C, et al. A survey on zero knowledge range proofs and applications[J]. SN Applied Sciences, 2019, 1: 117 |