{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:11:51Z","timestamp":1742969511247,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":41,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819609376"},{"type":"electronic","value":"9789819609383"}],"license":[{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"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-96-0938-3_12","type":"book-chapter","created":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T18:23:07Z","timestamp":1733941387000},"page":"365-397","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Jackpot: Non-interactive Aggregatable Lotteries"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2770-5444","authenticated-orcid":false,"given":"Nils","family":"Fleischhacker","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0195-6659","authenticated-orcid":false,"given":"Mathias","family":"Hall-Andersen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7325-5261","authenticated-orcid":false,"given":"Mark","family":"Simkin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4620-7264","authenticated-orcid":false,"given":"Benedikt","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,12]]},"reference":[{"key":"12_CR1","series-title":"LNCS","first-page":"231","volume-title":"FC 2017 Workshops","author":"M Bartoletti","year":"2017","unstructured":"Bartoletti, M., Zunino, R.: Constant-deposit multiparty lotteries on bitcoin. In: Brenner, M., Rohloff, K., Bonneau, J., Miller, A., Ryan, P.Y.A., Teague, V., Bracciali, A., Sala, M., Pintore, F., Jakobsson, M. (eds.) FC 2017 Workshops. LNCS, vol. 10323, pp. 231\u2013247. Springer, Heidelberg (Apr 2017)"},{"key":"12_CR2","doi-asserted-by":"publisher","unstructured":"Bayer, S., Groth, J.: Efficient zero-knowledge argument for correctness of a shuffle. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT\u00a02012. LNCS, vol.\u00a07237, pp. 263\u2013280. Springer, Heidelberg (Apr 2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_17","DOI":"10.1007\/978-3-642-29011-4_17"},{"key":"12_CR3","doi-asserted-by":"publisher","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: Denning, D.E., Pyle, R., Ganesan, R., Sandhu, R.S., Ashby, V. (eds.) ACM CCS 93. pp. 62\u201373. ACM Press (Nov 1993). https:\/\/doi.org\/10.1145\/168588.168596","DOI":"10.1145\/168588.168596"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Bentov, I., Kumaresan, R.: How to use bitcoin to design fair protocols. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO\u00a02014, Part\u00a0II. LNCS, vol.\u00a08617, pp. 421\u2013439. Springer, Heidelberg (Aug 2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_24","DOI":"10.1007\/978-3-662-44381-1_24"},{"key":"12_CR5","doi-asserted-by":"publisher","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles and the SDH assumption in bilinear groups. Journal of Cryptology 21(2), 149\u2013177 (Apr 2008). https:\/\/doi.org\/10.1007\/s00145-007-9005-7","DOI":"10.1007\/s00145-007-9005-7"},{"key":"12_CR6","doi-asserted-by":"publisher","unstructured":"Boneh, D., Drijvers, M., Neven, G.: Compact multi-signatures for smaller blockchains. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT\u00a02018, Part\u00a0II. LNCS, vol. 11273, pp. 435\u2013464. Springer, Heidelberg (Dec 2018). https:\/\/doi.org\/10.1007\/978-3-030-03329-3_15","DOI":"10.1007\/978-3-030-03329-3_15"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Boneh, D., Eskandarian, S., Hanzlik, L., Greco, N.: Single secret leader election. In: AFT \u201920: 2nd ACM Conference on Advances in Financial Technologies, New York, NY, USA, October 21-23, 2020. pp. 12\u201324. ACM (2020), https:\/\/doi.org\/10.1145\/3419614.3423258","DOI":"10.1145\/3419614.3423258"},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Boneh, D., Gennaro, R., Goldfeder, S., Jain, A., Kim, S., Rasmussen, P.M.R., Sahai, A.: Threshold cryptosystems from threshold fully homomorphic encryption. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO\u00a02018, Part\u00a0I. LNCS, vol. 10991, pp. 565\u2013596. Springer, Heidelberg (Aug 2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_19","DOI":"10.1007\/978-3-319-96884-1_19"},{"key":"12_CR9","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\u00a02003. LNCS, vol.\u00a02656, pp. 416\u2013432. Springer, Heidelberg (May 2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_26","DOI":"10.1007\/3-540-39200-9_26"},{"key":"12_CR10","doi-asserted-by":"publisher","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT\u00a02001. LNCS, vol.\u00a02248, pp. 514\u2013532. Springer, Heidelberg (Dec 2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_30","DOI":"10.1007\/3-540-45682-1_30"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Broder, A.Z., Dolev, D.: Flipping coins in many pockets (byzantine agreement on uniformly random values). In: 25th FOCS. pp. 157\u2013170. IEEE Computer Society Press (Oct 1984). https:\/\/doi.org\/10.1109\/SFCS.1984.715912","DOI":"10.1109\/SFCS.1984.715912"},{"key":"12_CR12","doi-asserted-by":"publisher","unstructured":"Camenisch, J., Drijvers, M., Gagliardoni, T., Lehmann, A., Neven, G.: The wonderful world of global random oracles. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT\u00a02018, Part\u00a0I. LNCS, vol. 10820, pp. 280\u2013312. Springer, Heidelberg (Apr\u00a0\/\u00a0May 2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_11","DOI":"10.1007\/978-3-319-78381-9_11"},{"key":"12_CR13","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42nd FOCS. pp. 136\u2013145. IEEE Computer Society Press (Oct 2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"12_CR14","doi-asserted-by":"publisher","unstructured":"Catalano, D., Fiore, D.: Vector commitments and their applications. In: Kurosawa, K., Hanaoka, G. (eds.) PKC\u00a02013. LNCS, vol.\u00a07778, pp. 55\u201372. Springer, Heidelberg (Feb\u00a0\/\u00a0Mar 2013). https:\/\/doi.org\/10.1007\/978-3-642-36362-7_5","DOI":"10.1007\/978-3-642-36362-7_5"},{"key":"12_CR15","doi-asserted-by":"publisher","unstructured":"Chen, B., B\u00fcnz, B., Boneh, D., Zhang, Z.: HyperPlonk: Plonk with linear-time prover and high-degree custom gates. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0II. LNCS, vol. 14005, pp. 499\u2013530. Springer, Heidelberg (Apr 2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_17","DOI":"10.1007\/978-3-031-30617-4_17"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Chow, S.S., Hui, L.C., Yiu, S.M., Chow, K.: An e-lottery scheme using verifiable random function. In: International Conference on Computational Science and its Applications. pp. 651\u2013660. Springer (2005)","DOI":"10.1007\/11424857_72"},{"key":"12_CR17","doi-asserted-by":"publisher","unstructured":"David, B., Gazi, P., Kiayias, A., Russell, A.: Ouroboros praos: An adaptively-secure, semi-synchronous proof-of-stake blockchain. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT\u00a02018, Part\u00a0II. LNCS, vol. 10821, pp. 66\u201398. Springer, Heidelberg (Apr\u00a0\/\u00a0May 2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_3","DOI":"10.1007\/978-3-319-78375-8_3"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Faonio, A., Fiore, D., Kohlweiss, M., Russo, L., Zajac, M.: From polynomial IOP and commitments to non-malleable zksnarks. IACR Cryptol. ePrint Arch. p.\u00a0569 (2023), https:\/\/eprint.iacr.org\/2023\/569","DOI":"10.1007\/978-3-031-48621-0_16"},{"key":"12_CR19","unstructured":"Feist, D.: PCS multiproofs using random evaluation. https:\/\/dankradfeist.de\/ethereum\/2021\/06\/18\/pcs-multiproofs.html (2021), accessed: 2023-09-28"},{"key":"12_CR20","unstructured":"Feist, D., Khovratovich, D.: Fast amortized KZG proofs. Cryptology ePrint Archive, Report 2023\/033 (2023), https:\/\/eprint.iacr.org\/2023\/033"},{"key":"12_CR21","unstructured":"Fleischhacker, N., Hall-Andersen, M., Simkin, M., Wagner, B.: Jackpot: Non-interactive aggregatable lotteries. Cryptology ePrint Archive, Paper 2023\/1570 (2023), https:\/\/eprint.iacr.org\/2023\/1570"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Fleischhacker, N., Herold, G., Simkin, M., Zhang, Z.: Chipmunk: Better synchronized multi-signatures from lattices. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, Los Angeles, CA, USA, November 7-11, 2022. pp. 1109\u20131123. ACM (2022), https:\/\/doi.org\/10.1145\/3548606.3560655","DOI":"10.1145\/3548606.3560655"},{"key":"12_CR23","doi-asserted-by":"publisher","unstructured":"Fleischhacker, N., Simkin, M., Zhang, Z.: Squirrel: Efficient synchronized multi-signatures from lattices. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022. pp. 1109\u20131123. ACM Press (Nov 2022). https:\/\/doi.org\/10.1145\/3548606.3560655","DOI":"10.1145\/3548606.3560655"},{"key":"12_CR24","doi-asserted-by":"publisher","unstructured":"Fuchsbauer, G., Kiltz, E., Loss, J.: The algebraic group model and its applications. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO\u00a02018, Part\u00a0II. LNCS, vol. 10992, pp. 33\u201362. Springer, Heidelberg (Aug 2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_2","DOI":"10.1007\/978-3-319-96881-0_2"},{"key":"12_CR25","doi-asserted-by":"publisher","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: 54th FOCS. pp. 40\u201349. IEEE Computer Society Press (Oct 2013). https:\/\/doi.org\/10.1109\/FOCS.2013.13","DOI":"10.1109\/FOCS.2013.13"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Gilad, Y., Hemo, R., Micali, S., Vlachos, G., Zeldovich, N.: Algorand: Scaling byzantine agreements for cryptocurrencies. In: Proceedings of the 26th Symposium on Operating Systems Principles, Shanghai, China, October 28-31, 2017. pp. 51\u201368. ACM (2017), https:\/\/doi.org\/10.1145\/3132747.3132757","DOI":"10.1145\/3132747.3132757"},{"key":"12_CR27","doi-asserted-by":"publisher","unstructured":"Gorbunov, S., Reyzin, L., Wee, H., Zhang, Z.: Pointproofs: Aggregating proofs for multiple vector commitments. In: Ligatti, J., Ou, X., Katz, J., Vigna, G. (eds.) ACM CCS 2020. pp. 2007\u20132023. ACM Press (Nov 2020). https:\/\/doi.org\/10.1145\/3372297.3417244","DOI":"10.1145\/3372297.3417244"},{"key":"12_CR28","doi-asserted-by":"publisher","unstructured":"Groth, J., Maller, M.: Snarky signatures: Minimal signatures of knowledge from simulation-extractable SNARKs. In: Katz, J., Shacham, H. (eds.) CRYPTO\u00a02017, Part\u00a0II. LNCS, vol. 10402, pp. 581\u2013612. Springer, Heidelberg (Aug 2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_20","DOI":"10.1007\/978-3-319-63715-0_20"},{"key":"12_CR29","first-page":"1","volume":"71","author":"K Itakura","year":"1983","unstructured":"Itakura, K.: A public-key cryptosystem suitable for digital multisignature. NEC research and development 71, \u00a01\u20138 (1983)","journal-title":"NEC research and development"},{"key":"12_CR30","doi-asserted-by":"publisher","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-size commitments to polynomials and their applications. In: Abe, M. (ed.) ASIACRYPT\u00a02010. LNCS, vol.\u00a06477, pp. 177\u2013194. Springer, Heidelberg (Dec 2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_11","DOI":"10.1007\/978-3-642-17373-8_11"},{"issue":"4","key":"12_CR31","doi-asserted-by":"publisher","first-page":"37","DOI":"10.3390\/cryptography4040037","volume":"4","author":"B Liang","year":"2020","unstructured":"Liang, B., Banegas, G., Mitrokotsa, A.: Statically aggregate verifiable random functions and application to e-lottery. Cryptography 4(4), \u00a037 (2020)","journal-title":"Cryptography"},{"key":"12_CR32","doi-asserted-by":"publisher","unstructured":"Libert, B., Ling, S., Nguyen, K., Wang, H.: Zero-knowledge arguments for lattice-based accumulators: Logarithmic-size ring signatures and group signatures without trapdoors. In: Fischlin, M., Coron, J.S. (eds.) EUROCRYPT\u00a02016, Part\u00a0II. LNCS, vol.\u00a09666, pp. 1\u201331. Springer, Heidelberg (May 2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_1","DOI":"10.1007\/978-3-662-49896-5_1"},{"key":"12_CR33","doi-asserted-by":"publisher","unstructured":"Libert, B., Passel\u00e8gue, A., Riahinia, M.: PointProofs, revisited. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT\u00a02022, Part\u00a0IV. LNCS, vol. 13794, pp. 220\u2013246. Springer, Heidelberg (Dec 2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_8","DOI":"10.1007\/978-3-031-22972-5_8"},{"key":"12_CR34","doi-asserted-by":"publisher","unstructured":"Libert, B., Yung, M.: Concise mercurial vector commitments and independent zero-knowledge sets with short proofs. In: Micciancio, D. (ed.) TCC\u00a02010. LNCS, vol.\u00a05978, pp. 499\u2013517. Springer, Heidelberg (Feb 2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_30","DOI":"10.1007\/978-3-642-11799-2_30"},{"key":"12_CR35","doi-asserted-by":"crossref","unstructured":"Libert, B.: Simulation-extractable KZG polynomial commitments and applications to HyperPlonk. In: PKC 2024. LNCS, Springer, Heidelberg (May 2024), to appear","DOI":"10.1007\/978-3-031-57722-2_3"},{"key":"12_CR36","doi-asserted-by":"publisher","unstructured":"Micali, S., Ohta, K., Reyzin, L.: Accountable-subgroup multisignatures: Extended abstract. In: Reiter, M.K., Samarati, P. (eds.) ACM CCS 2001. pp. 245\u2013254. ACM Press (Nov 2001). https:\/\/doi.org\/10.1145\/501983.502017","DOI":"10.1145\/501983.502017"},{"key":"12_CR37","doi-asserted-by":"publisher","unstructured":"Micali, S., Rabin, M.O., Vadhan, S.P.: Verifiable random functions. In: 40th FOCS. pp. 120\u2013130. IEEE Computer Society Press (Oct 1999). https:\/\/doi.org\/10.1109\/SFFCS.1999.814584","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"12_CR38","doi-asserted-by":"publisher","unstructured":"Papamanthou, C., Shi, E., Tamassia, R., Yi, K.: Streaming authenticated data structures. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT\u00a02013. LNCS, vol.\u00a07881, pp. 353\u2013370. Springer, Heidelberg (May 2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_22","DOI":"10.1007\/978-3-642-38348-9_22"},{"key":"12_CR39","doi-asserted-by":"publisher","unstructured":"Sahai, A.: Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In: 40th FOCS. pp. 543\u2013553. IEEE Computer Society Press (Oct 1999). https:\/\/doi.org\/10.1109\/SFFCS.1999.814628","DOI":"10.1109\/SFFCS.1999.814628"},{"issue":"3","key":"12_CR40","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"CP Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Efficient signature generation by smart cards. Journal of Cryptology 4(3), 161\u2013174 (Jan 1991). https:\/\/doi.org\/10.1007\/BF00196725","journal-title":"Journal of Cryptology"},{"key":"12_CR41","doi-asserted-by":"publisher","unstructured":"Tomescu, A., Abraham, I., Buterin, V., Drake, J., Feist, D., Khovratovich, D.: Aggregatable subvector commitments for stateless cryptocurrencies. In: Galdi, C., Kolesnikov, V. (eds.) SCN 20. LNCS, vol. 12238, pp. 45\u201364. Springer, Heidelberg (Sep 2020). https:\/\/doi.org\/10.1007\/978-3-030-57990-6_3","DOI":"10.1007\/978-3-030-57990-6_3"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0938-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T19:30:33Z","timestamp":1733945433000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0938-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,12]]},"ISBN":["9789819609376","9789819609383"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0938-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,12]]},"assertion":[{"value":"12 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","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":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}