{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:08:06Z","timestamp":1743138486243,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031803079"},{"type":"electronic","value":"9783031803086"}],"license":[{"start":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:00:00Z","timestamp":1734048000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:00:00Z","timestamp":1734048000000},"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-3-031-80308-6_10","type":"book-chapter","created":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T04:56:45Z","timestamp":1733979405000},"page":"213-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multi-key Fully-Homomorphic Aggregate MAC for\u00a0Arithmetic Circuits"],"prefix":"10.1007","author":[{"given":"Suvasree","family":"Biswas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arkady","family":"Yerukhimovich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,13]]},"reference":[{"key":"10_CR1","unstructured":"Agrawal, M., SaptharishiI, R.: Classifying polynomials and identity testing. In: Current Trends in Science. Platinum Jubilee Special. Indian Academy of Sciences (2009)"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Anthoine, G., Balb\u00e1s, D., Fiore, D.: Fully-succinct multi-key homomorphic signatures from standard assumptions. In: Annual International Cryptology Conference, pp. 317\u2013351. Springer (2024)","DOI":"10.1007\/978-3-031-68382-4_10"},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: From secrecy to soundness: efficient verification via secure computation. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 152\u2013163. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14165-2_14","DOI":"10.1007\/978-3-642-14165-2_14"},{"key":"10_CR4","doi-asserted-by":"publisher","unstructured":"Bellare, M., Namprempre, C., Neven, G.: Unrestricted aggregate signatures. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 411\u2013422. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73420-8_37","DOI":"10.1007\/978-3-540-73420-8_37"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: The exact security of digital signatures-how to sign with RSA and Rabin. In: International Conference on the Theory and Applications of Cryptographic Techniques, pp. 399\u2013416. Springer (1996)","DOI":"10.1007\/3-540-68339-9_34"},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Benabbas, S., Gennaro, R., Vahlis, Y.: Verifiable delegation of computation over large datasets. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 111\u2013131. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_7","DOI":"10.1007\/978-3-642-22792-9_7"},{"key":"10_CR7","unstructured":"Biswas, S., Yerukhimovich, A.: Multi-key fully-homomorphic aggregate MAC for arithmetic circuits. Cryptology ePrint Archive, Paper 2024\/1499 (2024). https:\/\/eprint.iacr.org\/2024\/1499"},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In: Goldwasser, S. (ed.) ITCS 2012: 3rd Innovations in Theoretical Computer Science, pp. 326\u2013349. Association for Computing Machinery, Cambridge (2012). https:\/\/doi.org\/10.1145\/2090236.2090263","DOI":"10.1145\/2090236.2090263"},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Boneh, D., Freeman, D.M.: Homomorphic signatures for polynomial functions. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 149\u2013168. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_10","DOI":"10.1007\/978-3-642-20465-4_10"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 416\u2013432. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_26","DOI":"10.1007\/3-540-39200-9_26"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 514\u2013532. Springer (2001)","DOI":"10.1007\/3-540-45682-1_30"},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Catalano, D., Fiore, D.: Practical homomorphic MACs for arithmetic circuits. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 336\u2013352. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_21","DOI":"10.1007\/978-3-642-38348-9_21"},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Chung, K.-M., Kalai, Y., Vadhan, S.: Improved delegation of computation using fully homomorphic encryption. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 483\u2013501. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_26","DOI":"10.1007\/978-3-642-14623-7_26"},{"issue":"4","key":"10_CR14","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0020-0190(78)90067-4","volume":"7","author":"RA DeMillo","year":"1978","unstructured":"DeMillo, R.A., Lipton, R.J.: A probabilistic remark on algebraic program testing. Inf. Process. Lett. 7(4), 193\u2013195 (1978)","journal-title":"Inf. Process. Lett."},{"key":"10_CR15","doi-asserted-by":"publisher","unstructured":"Desmedt, Y.: Computer security by redefining what a computer is. In: Michael, J.B., Ashby, V., Meadows, C. (eds.) Proceedings on the 1992\u20131993 Workshop on New Security Paradigms, 22\u201324 September 1992; and 3\u20135 August 1993, Little Compton, pp. 160\u2013166. ACM (1993). https:\/\/doi.org\/10.1145\/283751.283834","DOI":"10.1145\/283751.283834"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Dutta, P., Dwivedi, P., Saxena, N.: Demystifying the border of depth-3 algebraic circuits. In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 92\u2013103. IEEE (2022)","DOI":"10.1109\/FOCS52979.2021.00018"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Fiore, D., Gennaro, R.: Publicly verifiable delegation of large polynomials and matrix computations, with applications. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security, pp. 501\u2013512 (2012)","DOI":"10.1145\/2382196.2382250"},{"key":"10_CR18","doi-asserted-by":"publisher","unstructured":"Fiore, D., Mitrokotsa, A., Nizzardo, L., Pagnin, E.: Multi-key homomorphic authenticators. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10032, pp. 499\u2013530. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_17","DOI":"10.1007\/978-3-662-53890-6_17"},{"key":"10_CR19","doi-asserted-by":"publisher","unstructured":"Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: outsourcing computation to untrusted workers. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 465\u2013482. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_25","DOI":"10.1007\/978-3-642-14623-7_25"},{"key":"10_CR20","doi-asserted-by":"publisher","unstructured":"Gennaro, R., Gentry, C., Parno, B., Raykova, M.: Quadratic span programs and succinct NIZKs without PCPs. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 626\u2013645. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_37","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Wichs, D.: Fully homomorphic message authenticators. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 301\u2013320. Springer (2013)","DOI":"10.1007\/978-3-642-42045-0_16"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Gentry, C., Wichs, D.: Separating succinct non-interactive arguments from all falsifiable assumptions. In: Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing, pp. 99\u2013108 (2011)","DOI":"10.1145\/1993636.1993651"},{"key":"10_CR23","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. In: Ladner, R.E., Dwork, C. (eds.) 40th Annual ACM Symposium on Theory of Computing, pp. 113\u2013122. ACM Press, Victoria (2008). https:\/\/doi.org\/10.1145\/1374376.1374396","DOI":"10.1145\/1374376.1374396"},{"key":"10_CR24","doi-asserted-by":"publisher","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wichs, D.: Leveled fully homomorphic signatures from standard lattices. In: Servedio, R.A., Rubinfeld, R. (eds.) 47th Annual ACM Symposium on Theory of Computing, pp. 469\u2013477. ACM Press, Portland (2015). https:\/\/doi.org\/10.1145\/2746539.2746576","DOI":"10.1145\/2746539.2746576"},{"key":"10_CR25","unstructured":"Gorbunov, S., Wee, H.: Digital signatures for consensus. Cryptology ePrint Archive (2019)"},{"key":"10_CR26","doi-asserted-by":"publisher","unstructured":"Johnson, R., Molnar, D., Song, D., Wagner, D.: Homomorphic signature schemes. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol. 2271, pp. 244\u2013262. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45760-7_17","DOI":"10.1007\/3-540-45760-7_17"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Katz, J., Lindell, A.Y.: Aggregate message authentication codes. In: Cryptographers\u2019 Track at the RSA Conference, pp. 155\u2013169. Springer (2008)","DOI":"10.1007\/978-3-540-79263-5_10"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography: Principles and Protocols. Chapman and Hall\/CRC (2007)","DOI":"10.1201\/9781420010756"},{"key":"10_CR29","doi-asserted-by":"publisher","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: 24th Annual ACM Symposium on Theory of Computing, pp. 723\u2013732. ACM Press, Victoria (1992). https:\/\/doi.org\/10.1145\/129712.129782","DOI":"10.1145\/129712.129782"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Lai, R.W., Tai, R.K., Wong, H.W., Chow, S.S.: Multi-key homomorphic signatures unforgeable under insider corruption. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 465\u2013492. Springer (2018)","DOI":"10.1007\/978-3-030-03329-3_16"},{"key":"10_CR31","doi-asserted-by":"publisher","unstructured":"Micali, S.: CS proofs (extended abstracts). In: 35th Annual Symposium on Foundations of Computer Science, pp. 436\u2013453. IEEE Computer Society Press, Santa Fe (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365746","DOI":"10.1109\/SFCS.1994.365746"},{"issue":"2","key":"10_CR32","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/2856449","volume":"59","author":"B Parno","year":"2016","unstructured":"Parno, B., Howell, J., Gentry, C., Raykova, M.: Pinocchio: nearly practical verifiable computation. Commun. ACM 59(2), 103\u2013112 (2016)","journal-title":"Commun. ACM"},{"key":"10_CR33","doi-asserted-by":"publisher","unstructured":"Parno, B., Raykova, M., Vaikuntanathan, V.: How to delegate and verify in public: verifiable computation from attribute-based encryption. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 422\u2013439. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_24","DOI":"10.1007\/978-3-642-28914-9_24"},{"key":"10_CR34","unstructured":"Rivest, R.: Two new signature schemes, 2001. In: Cambridge Seminar (2001)"},{"key":"10_CR35","doi-asserted-by":"crossref","unstructured":"R\u00fcckert, M., Schr\u00f6der, D.: Aggregate and verifiably encrypted signatures from multilinear maps without random oracles. In: International Conference on Information Security and Assurance, pp. 750\u2013759. Springer (2009)","DOI":"10.1007\/978-3-642-02617-1_76"},{"key":"10_CR36","doi-asserted-by":"crossref","unstructured":"Waters, B., Wu, D.J.: Batch arguments for np and more from standard bilinear group assumptions. In: Annual International Cryptology Conference, pp. 433\u2013463. Springer (2022)","DOI":"10.1007\/978-3-031-15979-4_15"},{"key":"10_CR37","doi-asserted-by":"crossref","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: International Symposium on Symbolic and Algebraic Manipulation, pp. 216\u2013226. Springer (1979)","DOI":"10.1007\/3-540-09519-5_73"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-80308-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T05:03:36Z","timestamp":1733979816000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-80308-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,13]]},"ISBN":["9783031803079","9783031803086"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-80308-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,13]]},"assertion":[{"value":"13 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chennai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"18 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}