請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/88413
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 蕭旭君 | zh_TW |
dc.contributor.advisor | Hsu-Chun Hsiao | en |
dc.contributor.author | 許育銘 | zh_TW |
dc.contributor.author | Yu-Ming Hsu | en |
dc.date.accessioned | 2023-08-15T16:11:08Z | - |
dc.date.available | 2023-11-09 | - |
dc.date.copyright | 2023-08-15 | - |
dc.date.issued | 2023 | - |
dc.date.submitted | 2023-07-11 | - |
dc.identifier.citation | [1] I. Abraham, B. Pinkas, and A. Yanai. Blinder–scalable, robust anonymous committed broadcast. In Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, pages 1233–1252, 2020.
[2] B. Adida. Helios: Web-based open-audit voting. In USENIX security symposium, volume 17, pages 335–348, 2008. [3] A. Aly, A. Abidin, and S. Nikova. Practically efficient secure distributed exponentiation without bit-decomposition. In Financial Cryptography and Data Security: 22nd International Conference, FC 2018, Nieuwpoort, Curaçao, February 26–March 2, 2018, Revised Selected Papers 22, pages 291–309. Springer, 2018. [4] asn d6. Curdleproofs, 2022. [5] S. Bayer and J. Groth. Efficient zero-knowledge argument for correctness of a shuffle. In Annual International Conference on the Theory and Applications of Cryptographic Techniques, pages 263–280. Springer, 2012. [6] D. Beaver. Efficient multiparty protocols using circuit randomization. In Advances in Cryptology—CRYPTO'91: Proceedings 11, pages 420–432. Springer, 1992. [7] J. Benaloh and D. Tuinstra. Receipt-free secret-ballot elections. In Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, pages 544–553, 1994. [8] D. Boneh, E. Boyle, H. Corrigan-Gibbs, N. Gilboa, and Y. Ishai. Zero-knowledge proofs on secret-shared data via fully linear pcps. In Advances in Cryptology–CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019, Proceedings, Part III, pages 67–97. Springer, 2019. [9] G. Botrel, T. Piellard, Y. E. Housni, A. Tabaie, G. Gutoski, and I. Kubjas. Consensys/gnark-crypto: v0.9.0, Jan. 2023. [10] B. Bünz, J. Bootle, D. Boneh, A. Poelstra, P. Wuille, and G. Maxwell. Bulletproofs: Short proofs for confidential transactions and more. In 2018 IEEE symposium on security and privacy (SP), pages 315–334. IEEE, 2018. [11] M. Chase, E. Ghosh, and O. Poburinnaya. Secret-shared shuffle. In Advances in Cryptology–ASIACRYPT 2020: 26th International Conference on the Theory and Application of Cryptology and Information Security, Daejeon, South Korea, December 7–11, 2020, Proceedings, Part III 26, pages 342–372. Springer, 2020. [12] D. Chaum. The dining cryptographers problem. J. cryptology, 1:65–75, 1988. [13] D. L. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84–90, 1981. [14] M. R. Clarkson, S. Chong, and A. C. Myers. Civitas: Toward a secure voting system. In 2008 IEEE Symposium on Security and Privacy (sp 2008), pages 354–368. IEEE, 2008. [15] H. Corrigan-Gibbs and D. Boneh. Prio: Private, robust, and scalable computation of aggregate statistics. In NSDI, pages 259–282, 2017. [16] H. Corrigan-Gibbs, D. Boneh, and D. Mazières. Riposte: An anonymous messaging system handling millions of users. In 2015 IEEE Symposium on Security and Privacy, pages 321–338. IEEE, 2015. [17] A. Czumaj and B. Vöcking. Thorp shuffling, butterflies, and non-markovian couplings. In Automata, Languages, and Programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I 41, pages 344–355. Springer, 2014. [18] G. G. Dagher, P. B. Marella, M. Milojkovic, and J. Mohler. Broncovote: Secure voting system using ethereum's blockchain. 2018. [19] I. Damgård, M. Fitzi, E. Kiltz, J. B. Nielsen, and T. Toft. Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation. In Theory of Cryptography: Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006. Proceedings 3, pages 285–304. Springer, 2006. [20] I. Damgård and M. Jurik. A generalisation, a simplification and some applications of paillier’s probabilistic public-key system. In Public Key Cryptography: 4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001 Cheju Island, Korea, February 13–15, 2001 Proceedings 4, pages 119–136. Springer, 2001. [21] I. Damgård and J. B. Nielsen. Scalable and unconditionally secure multiparty computation. In Advances in Cryptology-CRYPTO 2007: 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007. Proceedings 27, pages 572–590. Springer, 2007. [22] I. Damgård, V. Pastro, N. Smart, and S. Zakarias. Multiparty computation from somewhat homomorphic encryption. In Advances in Cryptology–CRYPTO 2012: 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings, pages 643–662. Springer, 2012. [23] S. Eskandarian and D. Boneh. Clarion: Anonymous communication from multiparty shuffling protocols. Cryptology ePrint Archive, 2021. [24] J. Furukawa and K. Sako. An efficient scheme for proving a shuffle. In Advances in Cryptology—CRYPTO 2001: 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19–23, 2001 Proceedings 21, pages 368– 387. Springer, 2001. [25] N. Gilboa and Y. Ishai. Distributed point functions and their applications. In Advances in Cryptology–EUROCRYPT 2014: 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, May 11-15, 2014. Proceedings 33, pages 640–658. Springer, 2014. [26] P. Grontas, A. Pagourtzis, A. Zacharakis, and B. Zhang. Towards everlasting privacy and efficient coercion resistance in remote electronic voting. In Financial Cryptography and Data Security: FC 2018 International Workshops, BITCOIN, VOTING, and WTSC, Nieuwpoort, Curaçao, March 2, 2018, Revised Selected Papers 22, pages 210–231. Springer, 2019. [27] M. Hirt and K. Sako. Efficient receipt-free voting based on homomorphic encryption. In Advances in Cryptology—EUROCRYPT 2000: International Conference on the Theory and Application of Cryptographic Techniques Bruges, Belgium, May 14–18, 2000 Proceedings, pages 539–556. Springer, 2000. [28] M. Hoffmann, M. Klooß, and A. Rupp. Efficient zero-knowledge arguments in the discrete log setting, revisited. In Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, pages 2093–2110, 2019. [29] A. Juels, D. Catalano, and M. Jakobsson. Coercion-resistant electronic elections. In Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society, pages 61–70, 2005. [30] R. Küsters, J. Liedtke, J. Müller, D. Rausch, and A. Vogt. Ordinos: a verifiable tally-hiding e-voting system. In 2020 IEEE European Symposium on Security and Privacy (EuroS&P), pages 216–235. IEEE, 2020. [31] A. Kwon, H. Corrigan-Gibbs, S. Devadas, and B. Ford. Atom: Horizontally scaling strong anonymity. In Proceedings of the 26th Symposium on Operating Systems Principles, pages 406–422, 2017. [32] A. Kwon, D. Lu, and S. Devadas. Xrd: Scalable messaging system with cryptographic privacy. arXiv preprint arXiv:1901.04368, 2019. [33] S. Langowski, S. Servan-Schreiber, and S. Devadas. Trellis: Robust and scalable metadata-private anonymous broadcast. Cryptology ePrint Archive, 2022. [34] D. Lazar, Y. Gilad, and N. Zeldovich. Karaoke: Distributed private messaging immune to passive traffic analysis. In 13th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 18), pages 711–725, 2018. [35] Y. Liu and Q. Zhao. E-voting scheme using secret sharing and k-anonymity. World Wide Web, 22:1657–1667, 2019. [36] W. Lueks, I. Querejeta-Azurmendi, and C. Troncoso. Voteagain: A scalable coercion-resistant voting system. arXiv preprint arXiv:2005.11189, 2020. [37] C. A. Neff. A verifiable secret shuffle and its application to e-voting. InProceedings of the 8th ACM conference on Computer and Communications Security, pages 116– 125, 2001. [38] Z. Newman, S. Servan-Schreiber, and S. Devadas. Spectrum: High-bandwidth anonymous broadcast. In 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI 22), pages 229–248, 2022. [39] C. Ning and Q. Xu. Constant-rounds, linear multi-party computation for exponentiation and modulo reduction with perfect security. In Advances in Cryptology–ASIACRYPT 2011: 17th International Conference on the Theory and Application of Cryptology and Information Security, Seoul, South Korea, December 4-8, 2011. Proceedings 17, pages 572–589. Springer, 2011. [40] T. Okamoto. Provably secure and practical identification schemes and corresponding signature schemes. In Crypto, volume 92, pages 31–53. Springer, 1992. [41] T. P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In Advances in Cryptology—CRYPTO'91: Proceedings, pages 129–140. Springer, 2001. [42] Saba Eskandarian. Clarion, 2021. [43] B. Schoenmakers. A simple publicly verifiable secret sharing scheme and its application to electronic voting. In Advances in Cryptology—CRYPTO'99: 19th Annual International Cryptology Conference Santa Barbara, California, USA, August 15–19, 1999 Proceedings, pages 148–164. Springer, 1999. [44] O. Spycher, R. Koenig, R. Haenni, and M. Schläpfer. A new approach towards coercion-resistant remote e-voting in linear time. In Financial Cryptography and Data Security: 15th International Conference, FC 2011, Gros Islet, St. Lucia, February 28-March 4, 2011, Revised Selected Papers 15, pages 182–189. Springer, 2012. [45] N. Tyagi, Y. Gilad, D. Leung, M. Zaharia, and N. Zeldovich. Stadium: A distributed metadata-private messaging system. In Proceedings of the 26th Symposium on Operating Systems Principles, pages 423–440, 2017. [46] A. Vadapalli, K. Storrier, and R. Henry. Sabre: Sender-anonymous messaging with fast audits. In 2022 IEEE Symposium on Security and Privacy (SP), pages 1953– 1970. IEEE, 2022. [47] M. N. Wegman and J. L. Carter. New hash functions and their use in authentication and set equality. Journal of computer and system sciences, 22(3):265–279, 1981. [48] K. Yang and X. Wang. Non-interactive zero-knowledge proofs to multiple verifiers. In Advances in Cryptology–ASIACRYPT 2022: 28th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, December 5–9, 2022, Proceedings, Part III, pages 517–546. Springer, 2023. | - |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/88413 | - |
dc.description.abstract | 匿名廣播有很多應用,如吹哨者和電子投票。一些研究是基於混合網路,它們往往需要高成本的混合證明。一些研究是基於多方運算,混合成本較低,但使用者無法驗證其訊息的完整性。在這篇論文中,我們提出了CRAB,一個基於多方混合協定的匿名廣播系統,為使用者提供驗證機制。該系統是「使用者可反駁」的,意味著使用者可以證明伺服器的錯誤行為。我們證明了CRAB滿足安全性的需求。我們也顯示了CRAB可以應用於電子投票系統。最後,我們實作並評估了我們的系統。我們的系統可以比使用混合證明的系統快23~33倍,並且有良好的可擴展性。因此,我們的系統適用於大規模的電子投票。 | zh_TW |
dc.description.abstract | There are many applications of anonymous broadcast, such as whistleblowing and electronic voting. Some works are based on mixnet, and they often require high cost on proof of shuffle. Some works are based on multiparty computation (MPC), where the shuffle cost is lower but the clients cannot verify the integrity of their messages. In this thesis, we propose CRAB, an anonymous broadcast system based on a multiparty shuffling protocol that provides a verification mechanism for the clients. The system is "client-rebuttable", which means that a client can prove the misbehavior of the servers. We prove that CRAB satisfies the security requirements. We also show that CRAB can be applied to electronic voting systems. Finally, we implement and evaluate our system. Our system can be 23~33 times faster than those using proof of shuffle, and our system has good scalability. Thus, our system is suitable for large-scale electronic voting. | en |
dc.description.provenance | Submitted by admin ntu (admin@lib.ntu.edu.tw) on 2023-08-15T16:11:08Z No. of bitstreams: 0 | en |
dc.description.provenance | Made available in DSpace on 2023-08-15T16:11:08Z (GMT). No. of bitstreams: 0 | en |
dc.description.tableofcontents | 口試委員審定書 i
誌謝 iii Acknowledgements v 摘要 vii Abstract ix Chapter 1 Introduction 1 Chapter 2 Design Goal 5 2.1 Threat Model and Assumptions 5 2.2 Security Goals 6 Chapter 3 Background 9 3.1 Notation 9 3.2 Multiparty Computation 9 3.3 Multiparty Shuffling Protocol 12 Chapter 4 The CRAB System 15 4.1 Generate Backdoor 15 4.2 Validation Check 17 4.3 The Entire System 22 4.3.1 Generate backdoor 22 4.3.2 Send request 22 4.3.3 Validation check 22 4.3.4 Process 23 4.3.5 Verify 23 4.4 Remove the Trusted Party 23 Chapter 5 Security Proof 25 5.1 Correctness 26 5.2 Anonymity 26 5.3 Client-rebuttability 28 5.3.1 "If" direction 29 5.3.2 "Only if" direction 32 Chapter 6 Application: Electronic Voting 35 6.1 The E-voting System 36 6.2 Security Analysis 37 Chapter 7 Implementation and Evaluation 39 7.1 Implementation on Group Elements 39 7.2 Complexity analysis 41 7.3 Experiment Result 41 7.3.1 Client performance 41 7.3.2 Validation check 41 7.3.3 Process 42 7.3.4 Rebuttal check 44 Chapter 8 Related Work 47 Chapter 9 Conclusion 51 References 53 | - |
dc.language.iso | en | - |
dc.title | CRAB: 使用者可反駁的匿名廣播 | zh_TW |
dc.title | CRAB: Client-Rebuttable Anonymous Broadcast | en |
dc.type | Thesis | - |
dc.date.schoolyear | 111-2 | - |
dc.description.degree | 碩士 | - |
dc.contributor.oralexamcommittee | 吳家麟;游家牧 | zh_TW |
dc.contributor.oralexamcommittee | Ja-Ling Wu;Chia-Mu Yu | en |
dc.subject.keyword | 匿名廣播,多方運算,匿名性,可驗證性, | zh_TW |
dc.subject.keyword | anonymous broadcast,MPC,anonymity,verifiability, | en |
dc.relation.page | 59 | - |
dc.identifier.doi | 10.6342/NTU202301028 | - |
dc.rights.note | 同意授權(全球公開) | - |
dc.date.accepted | 2023-07-13 | - |
dc.contributor.author-college | 電機資訊學院 | - |
dc.contributor.author-dept | 資訊工程學系 | - |
顯示於系所單位: | 資訊工程學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-111-2.pdf | 1.48 MB | Adobe PDF | 檢視/開啟 |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。