政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/153380

政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/153380

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | 全文笔数/总笔数 : 112704/143671 (78%)
造访人次 : 49794347 在线人数 : 622

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

搜寻范围

查询小技巧：

您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果

若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据

进阶搜寻

主页 ‧ 登入 ‧ 上传 ‧ 说明 ‧ 关于政大典藏 ‧ 管理

到手机版

政大機構典藏 > 資訊學院 > 資訊科學系 > 學位論文 > Item 140.119/153380

请使用永久网址来引用或连结此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/153380

题名:	零知識憑證之通用性改良與比較 Generalized improvements and comparisons of zkCredential
作者:	陳品豪 Chen, Pin-Hao
贡献者:	曾一凡 Tseng, Yi-Fan 陳品豪 Chen, Pin-Hao
关键词:	零知識證明匿名憑證區塊鏈 Blockchain Zero Knowledge Proof Plonk NIZK Anonymous Credential ZK Credential
日期:	2024
上传时间:	2024-09-04 15:00:07 (UTC+8)
摘要:	這篇論文透過整合 PlonK 證明系統來研究 ZK 憑證的增強和泛化，解決零知識證明中普遍性和效率的關鍵挑戰。我們的研究提出了一種採用 Plonk 的新方法，這個方法消除了重複設置過程的需求，並優化了證明的可擴展性和靈活性。我們系統地比較了各種設置中的證明時間、驗證時間和證明大小，展示了相較於傳統系統的顯著改進。這項工作透過提供一個更具適應性和高效的 ZK 憑證框架，為密碼學界做出了貢獻，支持零知識證明在保護數位身份和交易中的廣泛應用。 This thesis investigates the enhancement and generalization of ZK Credentials through the integration of the PlonK proof system, addressing the key challenges of universality and efficiency in zero-knowledge proofs. Our study presents a novel approach by adopting Plonk, which eliminates the need for repetitive setup processes and optimizes proof scalability and flexibility. We systematically compare proof times, verification times, and proof sizes within various setups, demonstrating significant improvements over traditional systems. The work contributes to the cryptographic community by providing a more adaptable and efficient framework for ZK Credentials, supporting the broader application of zero-knowledge proofs in securing digital identities and transactions.
參考文獻:	Bibliography [A22] Arkworks. “Arkworks”. In: Arkworks (no date) GitHub. Available at: https://github.com/arkworks-rs/ . 2022 [ACLM+22] Martin R Albrecht et al. “Lattice-based SNARKs: publicly verifiable, pre-processing, and recursively composable”. In: Annual International Cryptology Conference. Springer. 2022, pp. 102–132. [BBHR18] Eli Ben-Sasson et al. “Scalable, transparent, and post-quantum secure computational integrity”. In: Cryptology ePrint Archive (2018). [BC23] Benedikt Bünz and Binyi Chen. “Protostar: Generic Efficient Accumulation/Folding for Special-Sound Protocols”. In: International Conference on the Theory and Application of Cryptology and Information Security. Springer. 2023, pp. 77–110. [BCRS+19] Eli Ben-Sasson et al. “Aurora: Transparent succinct arguments for R1CS”. In: Advances in Cryptology–EUROCRYPT 2019: 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19–23, 2019, Proceedings, Part I 38. Springer. 2019, pp. 103–128. [BL13] Foteini Baldimtsi and Anna Lysyanskaya. “Anonymous credentials light”. In: Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security. 2013, pp. 1087–1098. [C01] Ran Canetti. “Universally composable security: A new paradigm for cryptographic protocols”. In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science. IEEE. 2001, pp. 136–145. 29 [C85] David Chaum. “Security without identification: Transaction systems to make big brother obsolete”. In: Communications of the ACM 28.10 (1985), pp. 1030–1044. [CBBZ23] Binyi Chen et al. “Hyperplonk: Plonk with linear-time prover and high-degree custom gates”. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer. 2023, pp. 499–530. [CDHK15] Jan Camenisch et al. “Composable and modular anonymous credentials: Definitions and practical constructions”. In: Advances in Cryptology–ASIACRYPT 2015: 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November29–December 3, 2015, Proceedings, Part II 21. Springer. 2015, pp. 262–288. [CL03] Jan Camenisch and Anna Lysyanskaya. “A signature scheme with efficient protocols”. In: Security in Communication Networks: Third International Conference, SCN 2002 Amalfi, Italy, September 11–13, 2002 Revised Papers 3. Springer. 2003, pp. 268–289. [CL04] Jan Camenisch and Anna Lysyanskaya. “Signature schemes and anonymous credentials from bilinear maps”. In: Annual international cryptology conference. Springer. 2004, pp. 56–72. [E24] EspressoSystem. “Jellyfish”. In: EspressoSystems (no date) EspressoSystems/Jellyfish: A Rust implementation of the plonk ZKP system and extensions, GitHub. Available at: https://github.com/EspressoSystems/jellyfish/. 2024. [G16] Jens Groth. “On the size of pairing-based non-interactive arguments”. In: Advances in Cryptology–EUROCRYPT 2016: 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II 35. Springer. 2016, pp. 305–326. 30 [GGM13] Christina Garman, Matthew Green, and Ian Miers. “Decentralized anonymous credentials”. In: Cryptology ePrint Archive (2013). [GWC19] Ariel Gabizon, Zachary J Williamson, and Oana Ciobotaru. “Plonk: Permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge”. In: Cryptology ePrint Archive (2019). [KST22] Abhiram Kothapalli, Srinath Setty, and Ioanna Tzialla. “Nova: Recursive zero-knowledge arguments from folding schemes”. In: Annual International Cryptology Conference. Springer. 2022, pp. 359–388. [KZG10] Aniket Kate, Gregory M Zaverucha, and Ian Goldberg. “Constant-size commitments to polynomials and their applications”. In: Advances in Cryptology- ASIACRYPT 2010: 16th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 5-9, 2010. Proceedings 16. Springer. 2010, pp. 177–194. [RWGM23] Michael Rosenberg et al. “zk-creds: Flexible anonymous credentials from zksnarks and existing identity infrastructure”. In: 2023 IEEE Symposium on Security and Privacy (SP). IEEE. 2023, pp. 790–808. [SABM+18] Alberto Sonnino et al. “Coconut: Threshold issuance selective disclosure credentials with applications to distributed ledgers”. In: arXiv preprint arXiv:1802.07344 (2018).
描述:	碩士國立政治大學資訊科學系 111753140
資料來源:	http://thesis.lib.nccu.edu.tw/record/#G0111753140
数据类型:	thesis
显示于类别:	[資訊科學系] 學位論文

文件中的档案:

档案	描述	大小	格式	浏览次数
314001.pdf		1323Kb	Adobe PDF	0	检视/开启

在政大典藏中所有的数据项都受到原著作权保护.

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

DSpace Software Copyright © 2002-2004 MIT & Hewlett-Packard / Enhanced by NTU Library IR team Copyright © - 回馈