{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:48:13Z","timestamp":1743032893979,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031147906"},{"type":"electronic","value":"9783031147913"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-14791-3_17","type":"book-chapter","created":{"date-parts":[[2022,9,4]],"date-time":"2022-09-04T23:03:28Z","timestamp":1662332608000},"page":"387-410","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The State of\u00a0the\u00a0Union: Union-Only Signatures for\u00a0Data Aggregation"],"prefix":"10.1007","author":[{"given":"Diego F.","family":"Aranha","sequence":"first","affiliation":[]},{"given":"Felix","family":"Engelmann","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"Kolby","sequence":"additional","affiliation":[]},{"given":"Sophia","family":"Yakoubov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,5]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Abiteboul, S., Cautis, B., Fiat, A., Milo, T.: Digital signatures for modifiable collections. In: ARES, pp. 390\u2013399. IEEE Computer Society (2006)","DOI":"10.1109\/ARES.2006.53"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-28914-9_1","volume-title":"Theory of Cryptography","author":"JH Ahn","year":"2012","unstructured":"Ahn, J.H., Boneh, D., Camenisch, J., Hohenberger, S., shelat, A., Waters, B.: Computing on authenticated data. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 1\u201320. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_1"},{"key":"17_CR3","doi-asserted-by":"publisher","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: 28th ACM STOC, pp. 99\u2013108. ACM Press, May 1996. https:\/\/doi.org\/10.1145\/237814.237838","DOI":"10.1145\/237814.237838"},{"key":"17_CR4","unstructured":"Albrecht, M.R., Cid, C., Faug\u00e8re, J.-C., Fitzpatrick, R., Perret, L.: On the complexity of the BKW algorithm on LWE. Cryptology ePrint Archive, Report 2012\/636(2012). https:\/\/eprint.iacr.org\/2012\/636"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-030-34621-8_11","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"SA Altu\u011f","year":"2019","unstructured":"Altu\u011f, S.A., Chen, Y.: Hard isogeny problems over RSA moduli and groups with infeasible inversion. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11922, pp. 293\u2013322. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34621-8_11"},{"key":"17_CR6","unstructured":"Aranha, D.F., Hall-Andersen, M., Nitulescu, A., Pagnin, E., Yakoubov, S.: Count me in! extendability for threshold ring signatures. Cryptology ePrint Archive, Report 2021\/1240 (2021). https:\/\/ia.cr\/2021\/1240"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-030-30530-7_14","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2019","author":"DF Aranha","year":"2019","unstructured":"Aranha, D.F., Pagnin, E.: The simplest multi-key linearly homomorphic signature scheme. In: Schwabe, P., Th\u00e9riault, N. (eds.) LATINCRYPT 2019. LNCS, vol. 11774, pp. 280\u2013300. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30530-7_14"},{"issue":"4","key":"17_CR8","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1007\/s00145-018-9280-5","volume":"32","author":"R Barbulescu","year":"2018","unstructured":"Barbulescu, R., Duquesne, S.: Updating key size estimations for pairings. J. Cryptol. 32(4), 1298\u20131336 (2018). https:\/\/doi.org\/10.1007\/s00145-018-9280-5","journal-title":"J. Cryptol."},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-23951-9_9","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"DJ Bernstein","year":"2011","unstructured":"Bernstein, D.J., Duif, N., Lange, T., Schwabe, P., Yang, B.-Y.: High-speed high-security signatures. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol. 6917, pp. 124\u2013142. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23951-9_9"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-642-00468-1_5","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"D Boneh","year":"2009","unstructured":"Boneh, D., Freeman, D., Katz, J., Waters, B.: Signing a linear subspace: signature schemes for network coding. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 68\u201387. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00468-1_5"},{"key":"17_CR11","doi-asserted-by":"publisher","unstructured":"Catalano, D., Fiore, D.: Using linearly-homomorphic encryption to evaluate degree-2 functions on encrypted data. In: Ray, I., Li, N., Kruegel, C. (eds.) ACM CCS 2015, pp. 1518\u20131529. ACM Press, October 2015. https:\/\/doi.org\/10.1145\/2810103.2813624","DOI":"10.1145\/2810103.2813624"},{"key":"17_CR12","unstructured":"Dobson, S., Galbraith, S.D., Smith, B.: Trustless unknown-order groups. Math. Cryptol. 1(2), 25\u201339 (2021). https:\/\/journals.flvc.org\/mathcryptology\/issue\/view\/6013"},{"issue":"4","key":"17_CR13","doi-asserted-by":"publisher","first-page":"270","DOI":"10.2478\/popets-2021-0070","volume":"2021","author":"F Engelmann","year":"2021","unstructured":"Engelmann, F., M\u00fcller, L., Peter, A., Kargl, F., B\u00f6sch, C.: SwapCT: swap confidential transactions for privacy-preserving multi-token exchanges. PoPETs 2021(4), 270\u2013290 (2021). https:\/\/doi.org\/10.2478\/popets-2021-0070","journal-title":"PoPETs"},{"key":"17_CR14","unstructured":"Hohenberger, S.R.: The cryptographic impact of groups with infeasible inversion. Master\u2019s thesis, Massachusetts Institute of Technology (2003). http:\/\/hdl.handle.net\/1721.1\/87357"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-45760-7_17","volume-title":"Topics in Cryptology\u2014CT-RSA 2002","author":"R Johnson","year":"2002","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"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Kaaniche, N., Jung, E., Gehani, A.: Efficiently validating aggregated IoT data integrity. In: BigDataService, pp. 260\u2013265. IEEE Computer Society (2018)","DOI":"10.1109\/BigDataService.2018.00046"},{"key":"17_CR17","unstructured":"Kosba, A., et al.: C $$\\emptyset $$ c $$\\emptyset $$: a framework for building composable zero-knowledge proofs. Cryptology ePrint Archive (2015)"},{"key":"17_CR18","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measures. In: 45th FOCS, pp. 372\u2013381. IEEE Computer Society Press, October 2004. https:\/\/doi.org\/10.1109\/FOCS.2004.72","DOI":"10.1109\/FOCS.2004.72"},{"key":"17_CR19","unstructured":"Molnar, D.: Homomorphic signature schemes (2003). BSc. Senior thesis. Harvard College. https:\/\/www.dmolnar.com\/papers\/papers.html"},{"key":"17_CR20","unstructured":"P\u00f6hls, H.C., Samelin, K., Posegga, J., de Meer, H.: Transparent mergeable redactable signatures with signer commitment and applications. Inst. IT-Security Security-Law, Univ. Passau, Passau, Germany (2012)"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-319-07536-5_27","volume-title":"Applied Cryptography and Network Security","author":"HC P\u00f6hls","year":"2014","unstructured":"P\u00f6hls, H.C., Samelin, K.: On updatable redactable signatures. In: Boureanu, I., Owesarski, P., Vaudenay, S. (eds.) ACNS 2014. LNCS, vol. 8479, pp. 457\u2013475. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07536-5_27"},{"key":"17_CR22","unstructured":"Rabi, M., Sherman, A.T.: Associative one-way functions: a new paradigm for secret-key agreement and digital signatures. Technical report, University of Maryland Institute for Advanced Studies (1993). cS-TR-3183\/UMIACS-\/R-93-124"},{"key":"17_CR23","series-title":"Springer Briefs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-32115-8","volume-title":"Homomorphic Signature Schemes - A Survey","author":"G Traverso","year":"2016","unstructured":"Traverso, G., Demirel, D., Buchmann, J.: Homomorphic Signature Schemes - A Survey. Springer Briefs in Computer Science, Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-32115-8"},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-662-44381-1_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"T Yamakawa","year":"2014","unstructured":"Yamakawa, T., Yamada, S., Hanaoka, G., Kunihiro, N.: Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part II. LNCS, vol. 8617, pp. 90\u2013107. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_6"}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14791-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,4]],"date-time":"2022-09-04T23:34:36Z","timestamp":1662334476000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14791-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147906","9783031147913"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14791-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"5 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SCN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security and Cryptography for Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amalfi (SA)","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"scn2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/scn.unisa.it\/scn22\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"101","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2 abstracts of invited talks (not peer-reviewed) are included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}