{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T09:30:22Z","timestamp":1753522222952,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T00:00:00Z","timestamp":1658275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Spanish Government","award":["RED2018-102321-T"],"award-info":[{"award-number":["RED2018-102321-T"]}]},{"name":"European Union?s Horizon 2020, project PICOCRYPT","award":["101001283"],"award-info":[{"award-number":["101001283"]}]},{"name":"Spanish Governament, project SECURING","award":["PID2019-110873RJ-I00"],"award-info":[{"award-number":["PID2019-110873RJ-I00"]}]},{"name":"Madrid Regional Government, project BLOQUES","award":["S2018\/TCS-4339"],"award-info":[{"award-number":["S2018\/TCS-4339"]}]},{"name":"Programma ricerca di ateneo UNICT 35 2020-22 linea 2"},{"name":"Spanish Government, project SCUM","award":["RTI2018-102043-B-I00"],"award-info":[{"award-number":["RTI2018-102043-B-I00"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,20]]},"DOI":"10.1145\/3519270.3538424","type":"proceedings-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T16:23:51Z","timestamp":1658420631000},"page":"430-439","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Adaptively Secure Single Secret Leader Election from DDH"],"prefix":"10.1145","author":[{"given":"Dario","family":"Catalano","sequence":"first","affiliation":[{"name":"University of Catania, Catania, Italy"}]},{"given":"Dario","family":"Fiore","sequence":"additional","affiliation":[{"name":"IMDEA Software Institute, Madrid, Spain"}]},{"given":"Emanuele","family":"Giunta","sequence":"additional","affiliation":[{"name":"IMDEA Software Institute & Universidad Politecnica de Madrid, Madrid, Spain"}]}],"member":"320","published-online":{"date-parts":[[2022,7,21]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_13"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3479722.3480996"},{"key":"e_1_3_2_2_4_1","volume-title":"Betting on blockchain consensus with fantomette. CoRR abs\/1805.06786","author":"Azouvi S.","year":"2018","unstructured":"Azouvi , S. , McCorry , P. , and Meiklejohn , S . Betting on blockchain consensus with fantomette. CoRR abs\/1805.06786 ( 2018 ). Azouvi, S., McCorry, P., and Meiklejohn, S. Betting on blockchain consensus with fantomette. CoRR abs\/1805.06786 (2018)."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_1"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_17"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53357-4_10"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_30"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3419614.3423258"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96884-1_19"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19571-6_16"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00020"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78381-9_11"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959888"},{"key":"e_1_3_2_2_16_1","first-page":"639","volume-title":"28th ACM STOC (May","author":"Canetti R.","year":"1996","unstructured":"Canetti , R. , Feige , U. , Goldreich , O. , and Naor , M . Adaptively secure multiparty computation . In 28th ACM STOC (May 1996 ), ACM Press , pp. 639 -- 648 . Canetti, R., Feige, U., Goldreich, O., and Naor, M. Adaptively secure multiparty computation. In 28th ACM STOC (May 1996), ACM Press, pp. 639--648."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_2"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660374"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64840-4_11"},{"key":"e_1_3_2_2_21_1","volume-title":"Paper 2022\/687","author":"Catalano D.","year":"2022","unstructured":"Catalano , D. , Fiore , D. , and Giunta , E . Adaptively secure single secret leader election from ddh. Cryptology ePrint Archive , Paper 2022\/687 , 2022 . https: \/\/eprint.iacr.org\/2022\/687. Catalano, D., Fiore, D., and Giunta, E. Adaptively secure single secret leader election from ddh. Cryptology ePrint Archive, Paper 2022\/687, 2022. https: \/\/eprint.iacr.org\/2022\/687."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78375-8_3"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417290"},{"key":"e_1_3_2_2_25_1","volume-title":"Magic functions: In memoriam: Bernard m. dwork 1923--1998. Journal of the ACM (JACM) 50, 6","author":"Dwork C.","year":"2003","unstructured":"Dwork , C. , Naor , M. , Reingold , O. , and Stockmeyer , L . Magic functions: In memoriam: Bernard m. dwork 1923--1998. Journal of the ACM (JACM) 50, 6 ( 2003 ), 852--921. Dwork, C., Naor, M., Reingold, O., and Stockmeyer, L. Magic functions: In memoriam: Bernard m. dwork 1923--1998. Journal of the ACM (JACM) 50, 6 (2003), 852--921."},{"key":"e_1_3_2_2_26_1","first-page":"308","volume-title":"31st FOCS (Oct.","author":"Feige U.","year":"1990","unstructured":"Feige , U. , Lapidot , D. , and Shamir , A . Multiple non-interactive zero knowledge proofs based on a single random string (extended abstract) . In 31st FOCS (Oct. 1990 ), IEEE Computer Society Press , pp. 308 -- 317 . Feige, U., Lapidot, D., and Shamir, A. Multiple non-interactive zero knowledge proofs based on a single random string (extended abstract). In 31st FOCS (Oct. 1990), IEEE Computer Society Press, pp. 308--317."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17653-2_23"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.13"},{"key":"e_1_3_2_2_29_1","first-page":"51","volume-title":"Proceedings of the 26th Symposium on Operating Systems Principles (New York, NY, USA, 2017), SOSP '17, Association for Computing Machinery","author":"Gilad Y.","unstructured":"Gilad , Y. , Hemo , R. , Micali , S. , Vlachos , G. , and Zeldovich , N . Algorand: Scaling byzantine agreements for cryptocurrencies . In Proceedings of the 26th Symposium on Operating Systems Principles (New York, NY, USA, 2017), SOSP '17, Association for Computing Machinery , p. 51 -- 68 . Gilad, Y., Hemo, R., Micali, S., Vlachos, G., and Zeldovich, N. Algorand: Scaling byzantine agreements for cryptocurrencies. In Proceedings of the 26th Symposium on Operating Systems Principles (New York, NY, USA, 2017), SOSP '17, Association for Computing Machinery, p. 51--68."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-010-9066-x"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_27"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00063"},{"key":"e_1_3_2_2_33_1","volume-title":"Secret single-leader election (SSLE). https:\/\/web.archive.org\/web\/ 20191228170149\/https:\/\/github.com\/protocol\/research-RFPs\/blob\/master\/RFPs\/ rfp-6-SSLE.md","author":"Labs P.","year":"2019","unstructured":"Labs , P. Secret single-leader election (SSLE). https:\/\/web.archive.org\/web\/ 20191228170149\/https:\/\/github.com\/protocol\/research-RFPs\/blob\/master\/RFPs\/ rfp-6-SSLE.md , 2019 . Labs, P. Secret single-leader election (SSLE). https:\/\/web.archive.org\/web\/ 20191228170149\/https:\/\/github.com\/protocol\/research-RFPs\/blob\/master\/RFPs\/ rfp-6-SSLE.md, 2019."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00862-7_8"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3339817"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-015-0103-5"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46766-1_9"},{"key":"e_1_3_2_2_38_1","first-page":"543","volume-title":"40th FOCS (Oct.","author":"Sahai A.","year":"1999","unstructured":"Sahai , A. Non-malleable non-interactive zero knowledge and adaptive chosenciphertext security . In 40th FOCS (Oct. 1999 ), IEEE Computer Society Press , pp. 543 -- 553 . Sahai, A. Non-malleable non-interactive zero knowledge and adaptive chosenciphertext security. In 40th FOCS (Oct. 1999), IEEE Computer Society Press, pp. 543--553."}],"event":{"name":"PODC '22: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Salerno Italy","acronym":"PODC '22"},"container-title":["Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538424","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538424","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:20Z","timestamp":1750191140000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538424"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":35,"alternative-id":["10.1145\/3519270.3538424","10.1145\/3519270"],"URL":"https:\/\/doi.org\/10.1145\/3519270.3538424","relation":{},"subject":[],"published":{"date-parts":[[2022,7,20]]},"assertion":[{"value":"2022-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}