{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:14:36Z","timestamp":1743005676417,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":30,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819788002"},{"type":"electronic","value":"9789819788019"}],"license":[{"start":{"date-parts":[[2024,12,25]],"date-time":"2024-12-25T00:00:00Z","timestamp":1735084800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,25]],"date-time":"2024-12-25T00:00:00Z","timestamp":1735084800000},"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":[[2025]]},"DOI":"10.1007\/978-981-97-8801-9_4","type":"book-chapter","created":{"date-parts":[[2024,12,24]],"date-time":"2024-12-24T07:05:45Z","timestamp":1735023945000},"page":"63-83","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["FAMC: Fair and\u00a0Publicly Auditable Multi-Party Computation with\u00a0Cheater Detection"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1419-6257","authenticated-orcid":false,"given":"Yong","family":"Li","sequence":"first","affiliation":[]},{"given":"Yueyang","family":"Feng","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8553-827X","authenticated-orcid":false,"given":"Xi","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Jian","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Ruxian","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8733-2870","authenticated-orcid":false,"given":"Kewei","family":"Lv","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5942-8245","authenticated-orcid":false,"given":"Dawei","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,25]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Andrew Chi-Chih, Y.: Protocols for secure computations (extended abstract). In: FOCS 1982, pp. 160-164.IEEE (1982). https:\/\/doi.org\/10.1109\/SFCS.1982.38","DOI":"10.1109\/SFCS.1982.38"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/3387108","volume":"64","author":"Y Lindell","year":"2020","unstructured":"Lindell, Y.: Secure multiparty computation. Commun. ACM 64(1), 86\u201396 (2020). https:\/\/doi.org\/10.1145\/3387108","journal-title":"Commun. ACM"},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC 1987, pp. 218-229. ACM (1987). https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"I Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643\u2013662. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-40203-6_1","volume-title":"Computer Security \u2013 ESORICS 2013","author":"I Damg\u00e5rd","year":"2013","unstructured":"Damg\u00e5rd, I., Keller, M., Larraia, E., Pastro, V., Scholl, P., Smart, N.P.: Practical covertly secure MPC for dishonest majority \u2013 or: breaking the SPDZ limits. In: Crampton, J., Jajodia, S., Mayes, K. (eds.) ESORICS 2013. LNCS, vol. 8134, pp. 1\u201318. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40203-6_1"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-20465-4_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"R Bendlin","year":"2011","unstructured":"Bendlin, R., Damg\u00e5rd, I., Orlandi, C., Zakarias, S.: Semi-homomorphic encryption and multiparty computation. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 169\u2013188. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_11"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/978-3-662-53641-4_18","volume-title":"Theory of Cryptography","author":"C Baum","year":"2016","unstructured":"Baum, C., Orsini, E., Scholl, P.: Efficient secure multiparty computation with identifiable abort. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9985, pp. 461\u2013490. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53641-4_18"},{"key":"4_CR8","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":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-319-72089-0_7","volume-title":"Information Theoretic Security","author":"R Cunningham","year":"2017","unstructured":"Cunningham, R., Fuller, B., Yakoubov, S.: Catching MPC cheaters: identification and\u00a0openability. In: Shikata, J. (ed.) ICITS 2017. LNCS, vol. 10681, pp. 110\u2013134. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-72089-0_7"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Cohen, J.D., Fischer, M.J.: A robust and verifiable cryptographically secure election scheme. SFCS 1985, pp. 372-382. IEEE Computer Society. https:\/\/doi.org\/10.1109\/SFCS.1985.2","DOI":"10.1109\/SFCS.1985.2"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/11555827_8","volume-title":"Computer Security \u2013 ESORICS 2005","author":"D Chaum","year":"2005","unstructured":"Chaum, D., Ryan, P.Y.A., Schneider, S.: A practical voter-verifiable election scheme. In: di Vimercati, S.C., Syverson, P., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol. 3679, pp. 118\u2013139. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11555827_8"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-540-46588-1_28","volume-title":"Public Key Cryptography","author":"K Sako","year":"2000","unstructured":"Sako, K.: An auction protocol which hides bids of losers. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol. 1751, pp. 422\u2013432. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-540-46588-1_28"},{"key":"4_CR13","doi-asserted-by":"publisher","unstructured":"de Hoogh, S.J.A.: Design of large scale applications of secure multiparty computation: secure linear programming. PhD dissertation, Technische Universiteit Eindhoven, The Netherlands (2012). https:\/\/doi.org\/10.6100\/IR735328","DOI":"10.6100\/IR735328"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-44987-6_18","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2001","author":"R Cramer","year":"2001","unstructured":"Cramer, R., Damg\u00e5rd, I., Nielsen, J.B.: Multiparty computation from threshold homomorphic encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 280\u2013300. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_18"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-319-10879-7_11","volume-title":"Security and Cryptography for Networks","author":"C Baum","year":"2014","unstructured":"Baum, C., Damg\u00e5rd, I., Orlandi, C.: Publicly auditable secure multi-party computation. In: Abdalla, M., De Prisco, R. (eds.) SCN 2014. LNCS, vol. 8642, pp. 175\u2013196. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10879-7_11"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of Cryptography: Volume II - Basic Applications. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"4_CR17","doi-asserted-by":"publisher","unstructured":"Chaum, D., Cr\u00e9peau, C., Damgard, I.: Multiparty unconditionally secure protocols. In: STOC 1988, pp. 11\u201319. ACM Press (1988). https:\/\/doi.org\/10.1145\/62212.62214","DOI":"10.1145\/62212.62214"},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: STOC 1989, pp. 73\u201385. ACM Press (1989). https:\/\/doi.org\/10.1145\/73007.73014","DOI":"10.1145\/73007.73014"},{"key":"4_CR19","doi-asserted-by":"publisher","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty. In: STOC 1986, pp. 364\u2013369. ACM Press (1986). https:\/\/doi.org\/10.1145\/12130.12168","DOI":"10.1145\/12130.12168"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"TP Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129\u2013140. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_9"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/978-3-030-58951-6_29","volume-title":"Computer Security \u2013 ESORICS 2020","author":"Yu Chen","year":"2020","unstructured":"Chen, Yu., Ma, X., Tang, C., Au, M.H.: PGC: decentralized confidential payment system with auditability. In: Chen, L., Li, N., Liang, K., Schneider, S. (eds.) ESORICS 2020. LNCS, vol. 12308, pp. 591\u2013610. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58951-6_29"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/BFb0052252","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201997","author":"J Camenisch","year":"1997","unstructured":"Camenisch, J., Stadler, M.: Efficient group signature schemes for large groups. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 410\u2013424. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052252"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"D Beaver","year":"1992","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 420\u2013432. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_34"},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"19","DOI":"10.3390\/cryptography5030019","volume":"5","author":"M Seo","year":"2021","unstructured":"Seo, M.: Fair and secure multi-party computation with cheater detection. Cryptography 5, 19 (2021). https:\/\/doi.org\/10.3390\/cryptography5030019","journal-title":"Cryptography"},{"issue":"1","key":"4_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3477530","volume":"25","author":"HK Alper","year":"2021","unstructured":"Alper, H.K., K\u00fcp\u00e7\u00fc, A.: Optimally efficient multi-party fair exchange and fair secure multi-party computation. ACM Trans. Priv. Sec. 25(1), 1\u201334 (2021). https:\/\/doi.org\/10.1145\/3477530","journal-title":"ACM Trans. Priv. Sec."},{"key":"4_CR27","doi-asserted-by":"publisher","unstructured":"Jin, S., Li, Y., Chen, X., Li, R.: Blockchain based publicly auditable multi-party computation with cheater detection. In: ICICS 2023. LNCS, vol. 14252, pp. 608-626. Springer (2023). https:\/\/doi.org\/10.1007\/978-981-99-7356-9_36","DOI":"10.1007\/978-981-99-7356-9_36"},{"key":"4_CR28","doi-asserted-by":"publisher","unstructured":"Kumaresan, R., Bentov, I.: How to use bitcoin to incentivize correct computations. In: CCS 2014, pp. 30-41. ACM (2014). https:\/\/doi.org\/10.1145\/2660267.2660380","DOI":"10.1145\/2660267.2660380"},{"key":"4_CR29","unstructured":"Baum. C., Melissaris, N., Rachuri, R., Scholl, P.: Cheater identification on a budget: MPC with identifiable abort from pairwise MACs. Cryptology ePrint Archive, Report 2023\/154 (2023). https:\/\/eprint.iacr.org\/2023\/1548"},{"key":"4_CR30","doi-asserted-by":"publisher","unstructured":"Nie, L., Yao, S., Liu, J.: Secure multiparty computation with identifiable abort and fairness. In: 2023 7th International Conference on Cryptography, Security and Privacy (CSP 2023), pp. 99-106. IEEE (2023). https:\/\/doi.org\/10.1109\/CSP58884.2023.00023","DOI":"10.1109\/CSP58884.2023.00023"}],"container-title":["Lecture Notes in Computer Science","Information and Communications Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-8801-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,24]],"date-time":"2024-12-24T08:03:32Z","timestamp":1735027412000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-8801-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,25]]},"ISBN":["9789819788002","9789819788019"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-8801-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,25]]},"assertion":[{"value":"25 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information and Communications Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mytilene","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","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":"27 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icics2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icics2024.aegean.gr","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}