{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T02:12:27Z","timestamp":1771899147532,"version":"3.50.1"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031477539","type":"print"},{"value":"9783031477546","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-47754-6_14","type":"book-chapter","created":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T09:02:35Z","timestamp":1701334955000},"page":"235-251","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Bicorn: An Optimistically Efficient Distributed Randomness Beacon"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-6890-7313","authenticated-orcid":false,"given":"Kevin","family":"Choi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0000-1009-2365","authenticated-orcid":false,"given":"Arasu","family":"Arun","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7671-5681","authenticated-orcid":false,"given":"Nirvan","family":"Tyagi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6349-0145","authenticated-orcid":false,"given":"Joseph","family":"Bonneau","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,1]]},"reference":[{"key":"14_CR1","unstructured":"Drand. https:\/\/drand.love\/"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Andrychowicz, M., Dziembowski, S., Malinowski, D., Mazurek, L.: Secure multiparty computations on bitcoin. In: IEEE Security & Privacy (2014)","DOI":"10.1109\/SP.2014.35"},{"key":"14_CR3","unstructured":"Beaver, D., et al.: Strobe: stake-based threshold random beacons. Cryptology ePrint Archive (2021)"},{"key":"14_CR4","unstructured":"Beaver, D., So, N.: Global, unpredictable bit generation without broadcast. In: Eurocrypt (1993)"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Garay, J.A., Rabin, T.: Fast batch verification for modular exponentiation and digital signatures. In: Eurocrypt (1998)","DOI":"10.1007\/BFb0054130"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11761679_25","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"M Bellare","year":"2006","unstructured":"Bellare, M., Rogaway, P.: The security of triple encryption and a framework\u00a0for\u00a0code-based\u00a0game-playing\u00a0proofs. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 409\u2013426. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_25"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Bhat, A., Kate, A., Nayak, K., Shrestha, N.: OptRand: optimistically responsive distributed random beacons. Cryptology ePrint Archive, Paper 2022\/193 (2022)","DOI":"10.14722\/ndss.2023.24832"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Bhat, A., Shrestha, N., Kate, A., Nayak, K.: RandPiper - reconfiguration-friendly random beacons with quadratic communication. Cryptology ePrint Archive, Paper 2020\/1590 (2020)","DOI":"10.1145\/3460120.3484574"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Blum, M.: Coin flipping by telephone a protocol for solving impossible problems. In: ACM SIGACT News (1983)","DOI":"10.1145\/1008908.1008911"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Boneh, D., Bonneau, J., B\u00fcnz, B., Fisch, B.: Verifiable delay functions. In: CRYPTO (2018)","DOI":"10.1007\/978-3-319-96884-1_25"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Boneh, D., B\u00fcnz, B., Fisch, B.: Batching techniques for accumulators with applications to IOPs and stateless blockchains. In: CRYPTO (2019)","DOI":"10.1007\/978-3-030-26948-7_20"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Boneh, D., B\u00fcnz, B., Fisch, B.: A Survey of Two Verifiable Delay Functions. Cryptology ePrint Archive, Paper 2018\/712 (2018)","DOI":"10.1007\/978-3-319-96884-1_25"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Boneh, D., Drijvers, M., Neven, G.: Compact multi-signatures for smaller blockchains. In: Asiacrypt (2018)","DOI":"10.1007\/978-3-030-03329-3_15"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Boneh, D., Naor, M.: Timed commitments. In: Annual International Cryptology Conference (2000)","DOI":"10.1007\/3-540-44598-6_15"},{"key":"14_CR15","unstructured":"Buchmann, J., Hamdy, S.: A survey on IQ cryptography. In: Public-Key Cryptography and Computational Number Theory (2011)"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: Short proofs for confidential transactions and more. In: IEEE Security & Privacy (2018)","DOI":"10.1109\/SP.2018.00020"},{"key":"14_CR17","unstructured":"B\u00fcnz, B., Fisch, B.: Schwartz-zippel for multilinear polynomials mod n. Cryptology ePrint Archive, Paper 2022\/458 (2022)"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Drijvers, M., Hanke, T., Pignolet, Y.A., Shoup, V., Williams, D.: Internet computer consensus. In: ACM PODC (2022)","DOI":"10.1145\/3519270.3538430"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Cascudo, I., David, B.: Scrape: scalable randomness attested by public entities. In: ACNS (2017)","DOI":"10.1007\/978-3-319-61204-1_27"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Cascudo, I., David, B.: Albatross: publicly attestable batched randomness based on secret sharing. In: Asiacrypt (2020)","DOI":"10.1007\/978-3-030-64840-4_11"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Chen, M., et al.: Diogenes: lightweight scalable RSA modulus generation with a dishonest majority. In: IEEE Security & Privacy (2021)","DOI":"10.1109\/SP40001.2021.00025"},{"key":"14_CR22","unstructured":"Cherniaeva, A., Shirobokov, I., Shlomovits, O.: Homomorphic encryption random beacon. Cryptology ePrint Archive, Paper 2019\/1320 (2019)"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Couteau, G., Kloo\u00df, M., Lin, H., Reichle, M.: Efficient range proofs with transparent setup from bounded integer commitments. In: Eurocrypt (2021)","DOI":"10.1007\/978-3-030-77883-5_9"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Das, S., Krishnan, V., Isaac, I.M., Ren, L.: Spurt: scalable distributed randomness beacon with transparent setup. Cryptology ePrint Archive, Paper 2021\/100 (2021)","DOI":"10.1109\/SP46214.2022.9833580"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Fuchsbauer, G., Kiltz, E., Loss, J.: The algebraic group model and its applications. In: CRYPTO (2018)","DOI":"10.1007\/978-3-319-96881-0_2"},{"key":"14_CR26","doi-asserted-by":"publisher","first-page":"203917","DOI":"10.1109\/ACCESS.2020.3036698","volume":"8","author":"Z Guo","year":"2020","unstructured":"Guo, Z., Shi, L., Xu, M.: SecRand: a secure distributed randomness generation protocol with high practicality and scalability. IEEE Access 8, 203917\u2013203929 (2020)","journal-title":"IEEE Access"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Russell, A., David, B., Oliynykov, R.: Ouroboros: a provably secure proof-of-stake blockchain protocol. In: CRYPTO (2017)","DOI":"10.1007\/978-3-319-63688-7_12"},{"key":"14_CR28","unstructured":"Lenstra, A.K., Wesolowski, B.: A random zoo: sloth, unicorn, and TRX. Cryptology ePrint Archive, Paper 2015\/366 (2015)"},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"Micciancio, D.: The RSA group is pseudo-free. In: CRYPTO (2005)","DOI":"10.1007\/11426639_23"},{"key":"14_CR30","unstructured":"Pietrzak, K.: Simple verifiable delay functions. In: ITCS (2018)"},{"issue":"2","key":"14_CR31","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/0209022","volume":"9","author":"N Pippenger","year":"1980","unstructured":"Pippenger, N.: On the evaluation of powers and monomials. SIAM J. Comput. 9(2), 230\u2013250 (1980)","journal-title":"SIAM J. Comput."},{"key":"14_CR32","unstructured":"Qian, Y.: Randao: Verifiable random number generation (2017). https:\/\/randao.org\/whitepaper\/Randao_v0.85_en.pdf"},{"key":"14_CR33","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and timed-release crypto (1996)"},{"key":"14_CR34","doi-asserted-by":"crossref","unstructured":"Schindler, P., Judmayer, A., Stifter, N., Weippl, E.: Hydrand: efficient continuous distributed randomness. In: IEEE Security & Privacy (2020)","DOI":"10.1109\/SP40000.2020.00003"},{"key":"14_CR35","doi-asserted-by":"crossref","unstructured":"Schoenmakers, B.: A simple publicly verifiable secret sharing scheme and its application to electronic voting. In: CRYPTO (1999)","DOI":"10.1007\/3-540-48405-1_10"},{"issue":"4","key":"14_CR36","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"JT Schwartz","year":"1980","unstructured":"Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM (JACM) 27(4), 701\u2013717 (1980)","journal-title":"J. ACM (JACM)"},{"key":"14_CR37","doi-asserted-by":"crossref","unstructured":"Syta, E., et al.: Scalable bias-resistant distributed randomness. In: IEEE Security & Privacy (2017)","DOI":"10.1109\/SP.2017.45"},{"key":"14_CR38","doi-asserted-by":"crossref","unstructured":"Thyagarajan, S.A.K., Castagnos, G., Laguillaumie, F., Malavolta, G.: Efficient CCA timed commitments in class groups. Cryptology ePrint Archive, Report 2021\/1272 (2021)","DOI":"10.1145\/3460120.3484773"},{"issue":"4","key":"14_CR39","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1145\/502090.502099","volume":"48","author":"L Trevisan","year":"2001","unstructured":"Trevisan, L.: Extractors and pseudorandom generators. J. ACM 48(4), 860\u2013879 (2001)","journal-title":"J. ACM"},{"key":"14_CR40","unstructured":"Trevisan, L., Vadhan, S.: Extracting randomness from samplable distributions. In: FOCS (2000)"},{"key":"14_CR41","doi-asserted-by":"crossref","unstructured":"Wesolowski, B.: Efficient verifiable delay functions. In: Eurocrypt (2019)","DOI":"10.1007\/978-3-030-17659-4_13"},{"key":"14_CR42","unstructured":"Wood, G., et al.: Ethereum: a secure decentralised generalised transaction ledger. In: Ethereum Project Yellow Paper (2014)"},{"key":"14_CR43","doi-asserted-by":"crossref","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Symbolic and Algebraic Manipulation (1979)","DOI":"10.1007\/3-540-09519-5_73"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47754-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T09:05:34Z","timestamp":1701335134000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47754-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,1]]},"ISBN":["9783031477539","9783031477546"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47754-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,1]]},"assertion":[{"value":"1 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Financial Cryptography and Data Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bol, Bra\u010d","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Croatia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fc23.ifca.ai\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"182","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":"39","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":"2","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":"21% - 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.5","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"For the workshops 7 full papers have been accepted from 18 submissions.","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)"}}]}}