{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:55:20Z","timestamp":1742918120751,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031587504"},{"type":"electronic","value":"9783031587511"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-58751-1_5","type":"book-chapter","created":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T07:01:57Z","timestamp":1714287717000},"page":"119-148","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Best-of-Both-Worlds Multiparty Quantum Computation with\u00a0Publicly Verifiable Identifiable Abort"],"prefix":"10.1007","author":[{"given":"Kai-Min","family":"Chung","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6603-9280","authenticated-orcid":false,"given":"Mi-Ying","family":"Huang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0005-7328-3755","authenticated-orcid":false,"given":"Er-Cheng","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Jiapeng","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,29]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Aharonov, D., Ben-Or, M.: Fault-tolerant quantum computation with constant error. In: Proceedings of the Twenty-ninth Annual ACM Symposium on Theory of Computing, pp. 176\u2013188 (1997). https:\/\/doi.org\/10.1145\/258533.258579","DOI":"10.1145\/258533.258579"},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Aharonov, D., Ben-Or, M., Eban, E., Mahadev, U.: Interactive proofs for quantum computations. arXiv preprint arXiv:1704.04487 (2017). https:\/\/doi.org\/10.48550\/arXiv.1704.04487","DOI":"10.48550\/arXiv.1704.04487"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/978-3-030-84242-0_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021: 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16\u201320, 2021, Proceedings, Part I","author":"B Alon","year":"2021","unstructured":"Alon, B., Chung, H., Chung, K.-M., Huang, M.-Y., Lee, Y., Shen, Y.-C.: Round efficient secure multiparty quantum computation with identifiable abort. In: Malkin, T., Peikert, C. (eds.) Advances in Cryptology \u2013 CRYPTO 2021: 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16\u201320, 2021, Proceedings, Part I, pp. 436\u2013466. Springer International Publishing, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_16"},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Ambainis, A., Buhrman, H., Dodis, Y., Rohrig, H.: Multiparty quantum coin flipping. In: Proceedings of 19th IEEE Annual Conference on Computational Complexity, 2004, pp. 250\u2013259. IEEE (2004). https:\/\/doi.org\/10.1109\/CCC.2004.1313848","DOI":"10.1109\/CCC.2004.1313848"},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Barnum, H., Cr\u00e9peau, C., Gottesman, D., Smith, A., Tapp, A.: Authentication of quantum messages. In: The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings, pp. 449\u2013458. IEEE (2002). https:\/\/doi.org\/10.1109\/SFCS.2002.1181969","DOI":"10.1109\/SFCS.2002.1181969"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/978-3-030-84242-0_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"J Bartusek","year":"2021","unstructured":"Bartusek, J., Coladangelo, A., Khurana, D., Ma, F.: On the round complexity of secure quantum computation. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 406\u2013435. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_15"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/978-3-030-56880-1_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"C Baum","year":"2020","unstructured":"Baum, C., Orsini, E., Scholl, P., Soria-Vazquez, E.: Efficient constant-round MPC with identifiable abort and public verifiability. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 562\u2013592. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_20"},{"issue":"4","key":"5_CR8","doi-asserted-by":"publisher","first-page":"1659","DOI":"10.1007\/s00145-020-09354-z","volume":"33","author":"A Beimel","year":"2020","unstructured":"Beimel, A., Lindell, Y., Omri, E., Orlov, I.: 1\/p-Secure multiparty computation without an honest majority and the best of both worlds. J. Cryptol. 33(4), 1659\u20131731 (2020). https:\/\/doi.org\/10.1007\/s00145-020-09354-z","journal-title":"J. Cryptol."},{"key":"5_CR9","doi-asserted-by":"publisher","unstructured":"Ben-Or, M., Crepeau, C., Gottesman, D., Hassidim, A., Smith, A.: Secure multiparty quantum computation with (only) a strict honest majority. In: 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201906). IEEE (2006). https:\/\/doi.org\/10.1109\/FOCS.2006.68","DOI":"10.1109\/FOCS.2006.68"},{"key":"5_CR10","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.71.022316","volume":"71","author":"S Bravyi","year":"2005","unstructured":"Bravyi, S., Kitaev, A.: Universal quantum computation with ideal clifford gates and noisy ancillas. Phys. Rev. A 71, 022316 (2005). https:\/\/doi.org\/10.1103\/PhysRevA.71.022316","journal-title":"Phys. Rev. A"},{"key":"5_CR11","doi-asserted-by":"publisher","unstructured":"Broadbent, A., Ji, Z., Song, F., Watrous, J.: Zero-knowledge proof systems for qma. In: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pp. 31\u201340. IEEE (2016). https:\/\/doi.org\/10.1109\/FOCS.2016.13","DOI":"10.1109\/FOCS.2016.13"},{"issue":"4","key":"5_CR12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.2.041021","volume":"2","author":"ET Campbell","year":"2012","unstructured":"Campbell, E.T., Anwar, H., Browne, D.E.: Magic-state distillation in all prime dimensions using quantum reed-muller codes. Phys. Rev. X 2(4), 041021 (2012). https:\/\/doi.org\/10.1103\/PhysRevX.2.041021","journal-title":"Phys. Rev. X"},{"issue":"4","key":"5_CR13","doi-asserted-by":"publisher","first-page":"1451","DOI":"10.1109\/TIT.2005.844076","volume":"51","author":"HF Chau","year":"2005","unstructured":"Chau, H.F.: Unconditionally secure key distribution in higher dimensions by depolarization. IEEE Trans. Inf. Theory 51(4), 1451\u20131468 (2005). https:\/\/doi.org\/10.1109\/TIT.2005.844076","journal-title":"IEEE Trans. Inf. Theory"},{"key":"5_CR14","doi-asserted-by":"publisher","unstructured":"Chung, K.M., Lee, Y., Lin, H.H., Wu, X.: Constant-round blind classical verification of quantum sampling. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 707\u2013736. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_25","DOI":"10.1007\/978-3-031-07082-2_25"},{"issue":"11","key":"5_CR15","doi-asserted-by":"publisher","first-page":"2701","DOI":"10.1088\/0305-4470\/39\/11\/010","volume":"39","author":"S Clark","year":"2006","unstructured":"Clark, S.: Valence bond solid formalism for d-level one-way quantum computation. J. Phys. A: Math. Gen. 39(11), 2701 (2006). https:\/\/doi.org\/10.1088\/0305-4470\/39\/11\/010","journal-title":"J. Phys. A: Math. Gen."},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Cr\u00e9peau, C., Gottesman, D., Smith, A.: Secure multi-party quantum computation. In: Proceedings of the Thiry-fourth Annual ACM symposium on Theory of computing - STOC \u201902. ACM Press (2002). https:\/\/doi.org\/10.1145\/509907.510000","DOI":"10.1145\/509907.510000"},{"key":"5_CR17","doi-asserted-by":"publisher","unstructured":"Dulek, Y., Grilo, A.B., Jeffery, S., Majenz, C., Schaffner, C.: Secure multi-party quantum computation with a dishonest majority. In: Advances in Cryptology - EUROCRYPT 2020 (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_25","DOI":"10.1007\/978-3-030-45727-3_25"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1007\/978-3-642-32009-5_46","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"F Dupuis","year":"2012","unstructured":"Dupuis, F., Nielsen, J.B., Salvail, L.: Actively secure two-party evaluation of any quantum operation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 794\u2013811. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_46"},{"issue":"4","key":"5_CR19","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ace6cd","volume":"8","author":"T Gu","year":"2023","unstructured":"Gu, T., Yuan, X., Wu, B.: Efficient measurement schemes for bosonic systems. Quant. Sci. Technol. 8(4), 045008 (2023). https:\/\/doi.org\/10.1088\/2058-9565\/ace6cd","journal-title":"Quant. Sci. Technol."},{"key":"5_CR20","doi-asserted-by":"publisher","unstructured":"Gunn, S., Ju, N., Ma, F., Zhandry, M.: Commitments to quantum states. In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, pp. 1579\u20131588 (2023). https:\/\/doi.org\/10.1145\/3564246.3585198","DOI":"10.1145\/3564246.3585198"},{"key":"5_CR21","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Katz, J., Kushilevitz, E., Lindell, Y., Petrank, E.: On achieving the \u201cbest of both worlds\u201d in secure multiparty computation. SIAM J. Comput. 40(1), 122\u2013141 (2011). https:\/\/doi.org\/10.1137\/100783224","DOI":"10.1137\/100783224"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-662-44381-1_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"Y Ishai","year":"2014","unstructured":"Ishai, Y., Ostrovsky, R., Zikas, V.: Secure multi-party computation with identifiable abort. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 369\u2013386. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_21"},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Katz, J.: On achieving the \u201cbest of both worlds\u201d in secure multiparty computation. In: Proceedings of the Thirty-ninth Annual ACM Symposium on Theory of Computing, pp. 11\u201320 (2007). https:\/\/doi.org\/10.1145\/1250790.1250793","DOI":"10.1145\/1250790.1250793"},{"key":"5_CR24","doi-asserted-by":"publisher","unstructured":"Mahadev, U.: Classical verification of quantum computations. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 259\u2013267. IEEE (2018). https:\/\/doi.org\/10.1109\/FOCS.2018.00033","DOI":"10.1109\/FOCS.2018.00033"},{"key":"5_CR25","doi-asserted-by":"publisher","unstructured":"Micali, S., Goldreich, O., Wigderson, A.: How to play any mental game. In: Proceedings of the Nineteenth ACM Symposium on Theory of Computing, STOC, pp. 218\u2013229. ACM (1987). https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"5_CR26","doi-asserted-by":"publisher","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proceedings of the Twenty-first Annual ACM symposium on Theory of Computing, pp. 73\u201385 (1989). https:\/\/doi.org\/10.1145\/73007.73014","DOI":"10.1145\/73007.73014"},{"key":"5_CR27","doi-asserted-by":"publisher","unstructured":"Van Den\u00a0Berg, E.: A simple method for sampling random clifford operators. In: 2021 IEEE International Conference on Quantum Computing and Engineering (QCE), pp. 54\u201359. IEEE (2021). https:\/\/doi.org\/10.1109\/QCE52317.2021.00021","DOI":"10.1109\/QCE52317.2021.00021"},{"key":"5_CR28","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), pp. 162\u2013167 (1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-58751-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,12]],"date-time":"2024-05-12T23:03:54Z","timestamp":1715555034000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-58751-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031587504","9783031587511"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-58751-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zurich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}