{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:10:52Z","timestamp":1750219852635,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":79,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T00:00:00Z","timestamp":1663545600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1846316"],"award-info":[{"award-number":["CNS-1846316"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,9,19]]},"DOI":"10.1145\/3558535.3559788","type":"proceedings-article","created":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T14:54:17Z","timestamp":1688568857000},"page":"308-325","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["D-KODE: Distributed Mechanism to Manage a Billion Discrete-log Keys"],"prefix":"10.1145","author":[{"given":"Easwar Vivek","family":"Mangipudi","sequence":"first","affiliation":[{"name":"Supra Oracles, Milpitas, CA, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aniket Pundlik","family":"Kate","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN, United States of America"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,7,5]]},"reference":[{"unstructured":"Airdrop king. https:\/\/airdropking.io\/en\/.  Airdrop king. https:\/\/airdropking.io\/en\/.","key":"e_1_3_2_1_1_1"},{"unstructured":"Any swap. https:\/\/anyswap.exchange\/bridge.  Any swap. https:\/\/anyswap.exchange\/bridge.","key":"e_1_3_2_1_2_1"},{"unstructured":"Binance. https:\/\/www.binance.com\/en.  Binance. https:\/\/www.binance.com\/en.","key":"e_1_3_2_1_3_1"},{"unstructured":"Celo. https:\/\/docs.celo.org\/.  Celo. https:\/\/docs.celo.org\/.","key":"e_1_3_2_1_4_1"},{"unstructured":"Chainlink. https:\/\/chain.link\/.  Chainlink. https:\/\/chain.link\/.","key":"e_1_3_2_1_5_1"},{"unstructured":"Charm: A Framework for Rapidly Prototyping Cryptosystems. https:\/\/github.com\/JHUISI\/charm.  Charm: A Framework for Rapidly Prototyping Cryptosystems. https:\/\/github.com\/JHUISI\/charm.","key":"e_1_3_2_1_6_1"},{"unstructured":"Cocoricos airdrops. https:\/\/cocoricos.io\/airdrops.  Cocoricos airdrops. https:\/\/cocoricos.io\/airdrops.","key":"e_1_3_2_1_7_1"},{"unstructured":"Coinbase wallet. https:\/\/wallet.coinbase.com\/.  Coinbase wallet. https:\/\/wallet.coinbase.com\/.","key":"e_1_3_2_1_8_1"},{"unstructured":"Coindesk airdrop archive. https:\/\/www.coindesk.com\/tag\/airdrops.  Coindesk airdrop archive. https:\/\/www.coindesk.com\/tag\/airdrops.","key":"e_1_3_2_1_9_1"},{"unstructured":"D-kode: Mechanism to generate and maintain a billion discrete-log keys. https:\/\/github.com\/easwarvivek\/KODE.  D-kode: Mechanism to generate and maintain a billion discrete-log keys. https:\/\/github.com\/easwarvivek\/KODE.","key":"e_1_3_2_1_10_1"},{"unstructured":"Dfinity bls signature implementataion. https:\/\/github.com\/dfinity\/ic\/tree\/master\/rs\/crypto\/internal\/crypto_lib\/threshold_sig.  Dfinity bls signature implementataion. https:\/\/github.com\/dfinity\/ic\/tree\/master\/rs\/crypto\/internal\/crypto_lib\/threshold_sig.","key":"e_1_3_2_1_11_1"},{"unstructured":"Hackers move 760 million from the 2016 bitfinex hack. https:\/\/therecord.media\/hackers-move-760-million-from-the-2016-bitfinex-hack\/.  Hackers move 760 million from the 2016 bitfinex hack. https:\/\/therecord.media\/hackers-move-760-million-from-the-2016-bitfinex-hack\/.","key":"e_1_3_2_1_12_1"},{"unstructured":"How many bitcoin addresses are being created in 2021. https:\/\/appdevelopermagazine.com\/how-many-bitcoin-addresses-are-being-created-in-2021\/.  How many bitcoin addresses are being created in 2021. https:\/\/appdevelopermagazine.com\/how-many-bitcoin-addresses-are-being-created-in-2021\/.","key":"e_1_3_2_1_13_1"},{"unstructured":"Keep network. https:\/\/keep.network\/.  Keep network. https:\/\/keep.network\/.","key":"e_1_3_2_1_14_1"},{"unstructured":"Kraken. https:\/\/www.kraken.com\/.  Kraken. https:\/\/www.kraken.com\/.","key":"e_1_3_2_1_15_1"},{"unstructured":"Li finance. https:\/\/li.finance\/about.  Li finance. https:\/\/li.finance\/about.","key":"e_1_3_2_1_16_1"},{"unstructured":"Nist roadmap toward criteria for threshold schemes for cryptographic primitives. https:\/\/csrc.nist.gov\/publications\/detail\/nistir\/8214a\/final.  Nist roadmap toward criteria for threshold schemes for cryptographic primitives. https:\/\/csrc.nist.gov\/publications\/detail\/nistir\/8214a\/final.","key":"e_1_3_2_1_17_1"},{"unstructured":"Orbitbridge. https:\/\/bridge.orbitchain.io\/.  Orbitbridge. https:\/\/bridge.orbitchain.io\/.","key":"e_1_3_2_1_18_1"},{"unstructured":"Sepior. https:\/\/sepior.com\/.  Sepior. https:\/\/sepior.com\/.","key":"e_1_3_2_1_19_1"},{"unstructured":"Tendermint. http:\/\/Tendermint.com.  Tendermint. http:\/\/Tendermint.com.","key":"e_1_3_2_1_20_1"},{"unstructured":"Torus. http:\/\/Tor.us.  Torus. http:\/\/Tor.us.","key":"e_1_3_2_1_21_1"},{"unstructured":"The transport layer security (tls) protocol. https:\/\/tools.ietf.org\/html\/rfc8446.  The transport layer security (tls) protocol. https:\/\/tools.ietf.org\/html\/rfc8446.","key":"e_1_3_2_1_22_1"},{"unstructured":"Uboundtech. https:\/\/www.unboundtech.com\/.  Uboundtech. https:\/\/www.unboundtech.com\/.","key":"e_1_3_2_1_23_1"},{"unstructured":"Zengo kzen networks. https:\/\/zengo.com\/.  Zengo kzen networks. https:\/\/zengo.com\/.","key":"e_1_3_2_1_24_1"},{"volume-title":"https:\/\/selfkey.org\/list-of-cryptocurrency-exchange-hacks\/","year":"2020","unstructured":"A comprehensive list of cryptocurrency exchange hacks. https:\/\/selfkey.org\/list-of-cryptocurrency-exchange-hacks\/ , 2020 . A comprehensive list of cryptocurrency exchange hacks. https:\/\/selfkey.org\/list-of-cryptocurrency-exchange-hacks\/, 2020.","key":"e_1_3_2_1_25_1"},{"key":"e_1_3_2_1_26_1","volume-title":"https:\/\/www.hedgewithcrypto.com\/cryptocurrency-exchange-hacks\/","author":"The","year":"2021","unstructured":"The complete list of crypto exchange hacks. https:\/\/www.hedgewithcrypto.com\/cryptocurrency-exchange-hacks\/ , 2021 . The complete list of crypto exchange hacks. https:\/\/www.hedgewithcrypto.com\/cryptocurrency-exchange-hacks\/, 2021."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1007\/978-3-662-53887-6_7"},{"unstructured":"Aniket Kate Yizhou Huang I. G. Distributed key generation in the wild.  Aniket Kate Yizhou Huang I. G. Distributed key generation in the wild.","key":"e_1_3_2_1_29_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1007\/978-3-642-29011-4_42"},{"key":"e_1_3_2_1_31_1","first-page":"172","volume-title":"Proceedings of the 14th ACM Conference on Computer and Communications Security (New York, NY, USA, 2007), CCS '07, Association for Computing Machinery","author":"Bellare M.","unstructured":"Bellare , M. , and Rogaway , P . Robust computational secret sharing and a unified account of classical secret-sharing goals . In Proceedings of the 14th ACM Conference on Computer and Communications Security (New York, NY, USA, 2007), CCS '07, Association for Computing Machinery , p. 172 -- 184 . Bellare, M., and Rogaway, P. Robust computational secret sharing and a unified account of classical secret-sharing goals. In Proceedings of the 14th ACM Conference on Computer and Communications Security (New York, NY, USA, 2007), CCS '07, Association for Computing Machinery, p. 172--184."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1007\/0-387-34799-2_3"},{"key":"e_1_3_2_1_33_1","first-page":"251","volume-title":"Advances in Cryptology --- CRYPTO' 86 (Berlin","author":"Benaloh J. C.","year":"1987","unstructured":"Benaloh , J. C. Secret sharing homomorphisms: Keeping shares of a secret secret (extended abstract) . In Advances in Cryptology --- CRYPTO' 86 (Berlin , Heidelberg, 1987 ), A. M. Odlyzko, Ed., Springer Berlin Heidelberg , pp. 251 -- 260 . Benaloh, J. C. Secret sharing homomorphisms: Keeping shares of a secret secret (extended abstract). In Advances in Cryptology --- CRYPTO' 86 (Berlin, Heidelberg, 1987), A. M. Odlyzko, Ed., Springer Berlin Heidelberg, pp. 251--260."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.1109\/MARK.1979.8817296"},{"unstructured":"Boneh D. Drijvers M. and Neven G. Short signatures from the weil pairing. In BLS Multi-Signatures With Public-Key Aggregation. https:\/\/crypto.stanford.edu\/~dabo\/pubs\/papers\/BLSmultisig.html.  Boneh D. Drijvers M. and Neven G. Short signatures from the weil pairing. In BLS Multi-Signatures With Public-Key Aggregation. https:\/\/crypto.stanford.edu\/~dabo\/pubs\/papers\/BLSmultisig.html.","key":"e_1_3_2_1_35_1"},{"key":"e_1_3_2_1_36_1","volume-title":"A lattice-based universal thresholdizer for cryptographic systems. IACR Cryptol. ePrint Arch. 2017","author":"Boneh D.","year":"2017","unstructured":"Boneh , D. , Gennaro , R. , Goldfeder , S. , and Kim , S . A lattice-based universal thresholdizer for cryptographic systems. IACR Cryptol. ePrint Arch. 2017 ( 2017 ), 251. Boneh, D., Gennaro, R., Goldfeder, S., and Kim, S. A lattice-based universal thresholdizer for cryptographic systems. IACR Cryptol. ePrint Arch. 2017 (2017), 251."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_37_1","DOI":"10.1007\/978-3-642-40041-4_23"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_38_1","DOI":"10.5555\/647097.717005"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_39_1","DOI":"10.1109\/SFCS.1985.5"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_40_1","DOI":"10.1109\/SP.2018.00020"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_41_1","DOI":"10.1145\/586110.586124"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_42_1","DOI":"10.1007\/s00145-005-0318-0"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_43_1","DOI":"10.5555\/648120.746918"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_44_1","DOI":"10.1007\/978-3-540-30576-7_19"},{"key":"e_1_3_2_1_45_1","first-page":"272","volume-title":"Heidelberg","author":"Cramer R.","year":"2002","unstructured":"Cramer , R. , and Fehr , S . Optimal black-box secret sharing over arbitrary abelian groups. In Advances in Cryptology --- CRYPTO 2002 (Berlin , Heidelberg , 2002 ), M. Yung, Ed., Springer Berlin Heidelberg , pp. 272 -- 287 . Cramer, R., and Fehr, S. Optimal black-box secret sharing over arbitrary abelian groups. In Advances in Cryptology --- CRYPTO 2002 (Berlin, Heidelberg, 2002), M. Yung, Ed., Springer Berlin Heidelberg, pp. 272--287."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_46_1","DOI":"10.1007\/978-3-030-45721-1_18"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_47_1","DOI":"10.1007\/11745853_6"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_48_1","DOI":"10.1007\/3-540-36288-6_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_49_1","DOI":"10.1007\/978-3-540-30580-4_28"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_50_1","DOI":"10.1109\/SP.2018.00036"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_51_1","DOI":"10.1137\/0212045"},{"key":"e_1_3_2_1_52_1","first-page":"547","volume-title":"24th USENIX Security Symposium (USENIX Security 15)","author":"Everspaugh A.","year":"2015","unstructured":"Everspaugh , A. , Chaterjee , R. , Scott , S. , Juels , A. , and Ristenpart , T . The pythia {PRF} service . In 24th USENIX Security Symposium (USENIX Security 15) ( 2015 ), pp. 547 -- 562 . Everspaugh, A., Chaterjee, R., Scott, S., Juels, A., and Ristenpart, T. The pythia {PRF} service. In 24th USENIX Security Symposium (USENIX Security 15) (2015), pp. 547--562."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_53_1","DOI":"10.1109\/SFCS.1987.4"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_54_1","DOI":"10.1007\/s00145-006-0347-3"},{"unstructured":"Goldreich O. Valiant?s polynomial-size monotone formula for majority.  Goldreich O. Valiant?s polynomial-size monotone formula for majority.","key":"e_1_3_2_1_55_1"},{"key":"e_1_3_2_1_56_1","first-page":"241","article-title":"How to construct random functions","author":"Goldreich O.","year":"2019","unstructured":"Goldreich , O. , Goldwasser , S. , and Micali , S . How to construct random functions . In Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali. 2019 , pp. 241 -- 264 . Goldreich, O., Goldwasser, S., and Micali, S. How to construct random functions. In Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali. 2019, pp. 241--264.","journal-title":"Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali."},{"key":"e_1_3_2_1_57_1","first-page":"430","volume-title":"Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security (New York, NY, USA, 2016), CCS '16, Association for Computing Machinery","author":"Grassi L.","unstructured":"Grassi , L. , Rechberger , C. , Rotaru , D. , Scholl , P. , and Smart , N. P . Mpc-friendly symmetric key primitives . In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security (New York, NY, USA, 2016), CCS '16, Association for Computing Machinery , p. 430 -- 443 . Grassi, L., Rechberger, C., Rotaru, D., Scholl, P., and Smart, N. P. Mpc-friendly symmetric key primitives. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security (New York, NY, USA, 2016), CCS '16, Association for Computing Machinery, p. 430--443."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_59_1","DOI":"10.1007\/3-540-44750-4_27"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_60_1","DOI":"10.1007\/3-540-36492-7_20"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_61_1","DOI":"10.1007\/11830924_38"},{"key":"e_1_3_2_1_62_1","first-page":"9","article-title":"Secret sharing scheme realizing general access structure. Electronics and Communications in Japan (Part III","volume":"72","author":"Ito M.","year":"1989","unstructured":"Ito , M. , Saito , A. , and Nishizeki , T . Secret sharing scheme realizing general access structure. Electronics and Communications in Japan (Part III : Fundamental Electronic Science) 72 , 9 ( 1989 ), 56--64. Ito, M., Saito, A., and Nishizeki, T. Secret sharing scheme realizing general access structure. Electronics and Communications in Japan (Part III: Fundamental Electronic Science) 72, 9 (1989), 56--64.","journal-title":"Fundamental Electronic Science)"},{"key":"e_1_3_2_1_63_1","volume-title":"Threshold partially-oblivious prfs with applications to key management. Cryptology ePrint Archive","author":"Jarecki S.","year":"2018","unstructured":"Jarecki , S. , Krawczyk , H. , and Resch , J . Threshold partially-oblivious prfs with applications to key management. Cryptology ePrint Archive ( 2018 ). Jarecki, S., Krawczyk, H., and Resch, J. Threshold partially-oblivious prfs with applications to key management. Cryptology ePrint Archive (2018)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_64_1","DOI":"10.1109\/ICDCS.2009.21"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_65_1","DOI":"10.1007\/978-3-642-15317-4_27"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_66_1","DOI":"10.1007\/978-3-030-03810-6_15"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_67_1","DOI":"10.1007\/978-3-642-11145-7_34"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_68_1","DOI":"10.5555\/548089"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_69_1","DOI":"10.1007\/3-540-48910-X_23"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_70_1","DOI":"10.1109\/SFCS.1995.492474"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_71_1","DOI":"10.1145\/972639.972643"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_72_1","DOI":"10.1007\/3-540-45708-9_26"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_73_1","DOI":"10.1145\/112600.112605"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_74_1","DOI":"10.1145\/73007.73014"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_75_1","DOI":"10.1145\/359168.359176"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_76_1","DOI":"10.1007\/3-540-68339-9_17"},{"unstructured":"Thorbek R. Proactive linear integer secret sharing.  Thorbek R. Proactive linear integer secret sharing.","key":"e_1_3_2_1_77_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_78_1","DOI":"10.1109\/SP40000.2020.00059"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_79_1","DOI":"10.1016\/0196-6774(84)90016-6"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_80_1","DOI":"10.1145\/571637.571638"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_81_1","DOI":"10.1145\/1085126.1085127"}],"event":{"acronym":"AFT '22","name":"AFT '22: 4th ACM Conference on Advances in Financial Technologies","location":"Cambridge MA USA"},"container-title":["Proceedings of the 4th ACM Conference on Advances in Financial Technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558535.3559788","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3558535.3559788","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3558535.3559788","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:09Z","timestamp":1750178829000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558535.3559788"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,19]]},"references-count":79,"alternative-id":["10.1145\/3558535.3559788","10.1145\/3558535"],"URL":"https:\/\/doi.org\/10.1145\/3558535.3559788","relation":{},"subject":[],"published":{"date-parts":[[2022,9,19]]},"assertion":[{"value":"2023-07-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}