{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:18:35Z","timestamp":1742912315888,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031209734"},{"type":"electronic","value":"9783031209741"}],"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-20974-1_15","type":"book-chapter","created":{"date-parts":[[2022,11,10]],"date-time":"2022-11-10T08:06:38Z","timestamp":1668067598000},"page":"292-313","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Anonymous Random Allocation and\u00a0Its Applications"],"prefix":"10.1007","author":[{"given":"Azam","family":"Soleimanian","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,10]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1136\/bmj.313.7057.570","volume":"313","author":"DG Altman","year":"1996","unstructured":"Altman, D.G.: Better reporting of randomised controlled trials: the consort statement. BMJ 313, 570 (1996)","journal-title":"BMJ"},{"key":"15_CR2","first-page":"1015","volume":"2015","author":"J Bonneau","year":"2015","unstructured":"Bonneau, J., Clark, J., Goldfeder, S.: On bitcoin as a public randomness source. IACR Cryptol. ePrint Arch. 2015, 1015 (2015)","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"2","key":"15_CR3","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1257\/aer.103.2.585","volume":"103","author":"E Budish","year":"2013","unstructured":"Budish, E., Che, Y.-K., Kojima, F., Milgrom, P.: Designing random allocation mechanisms: theory and applications. Am. Econ. Rev. 103(2), 585\u2013623 (2013)","journal-title":"Am. Econ. Rev."},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Boneh, D., Eskandarian, S., Hanzlik, L., Greco, N.: Single secret leader election. In AFT 2020: 2nd ACM Conference on Advances in Financial Technologies, New York, NY, USA, 21\u201323 October 2020, pp. 12\u201324. ACM (2020)","DOI":"10.1145\/3419614.3423258"},{"key":"15_CR5","first-page":"919","volume":"2016","author":"I Bentov","year":"2016","unstructured":"Bentov, I., Pass, R., Shi, E.: Snow white: provably secure proofs of stake. IACR Cryptol. ePrint Arch. 2016, 919 (2016)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"15_CR6","doi-asserted-by":"crossref","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, November 1993","DOI":"10.1145\/168588.168596"},{"key":"15_CR7","first-page":"1590","volume":"2020","author":"A Bhat","year":"2020","unstructured":"Bhat, A., Shrestha, N., Luo, Z., Kate, A., Nayak, K.: Randpiper - reconfiguration-friendly random beacons with quadratic communication. IACR Cryptol. ePrint Arch. 2020, 1590 (2020)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"15_CR8","first-page":"344","volume":"2021","author":"D Catalano","year":"2021","unstructured":"Catalano, D., Fiore, D., Giunta, E.: Efficient and universally composable single secret leader election from pairings. IACR Cryptol. ePrint Arch. 2021, 344 (2021)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"15_CR9","unstructured":"Clark, J., Hengartner, U.: On the use of financial data as a random beacon. In: Jones, D.W., Quisquater, J.-J., Rescorla, E., (eds.) 2010 Electronic Voting Technology Workshop \/ Workshop on Trustworthy Elections, EVT\/WOTE 2010, Washington, D.C., USA, 9\u201310 August 2010. USENIX Association (2010)"},{"issue":"2","key":"15_CR10","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D Chaum","year":"1981","unstructured":"Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24(2), 84\u201388 (1981)","journal-title":"Commun. ACM"},{"issue":"6","key":"15_CR11","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Dingledine, R., Mathewson, N., Syverson., P.F.: Tor: the second-generation onion router. In Matt Blaze, editor, Proceedings of the 13th USENIX Security Symposium, 9\u201313 August 2004, San Diego, CA, USA, pp. 303\u2013320. USENIX (2004)","DOI":"10.21236\/ADA465464"},{"issue":"7","key":"15_CR13","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1145\/364520.364540","volume":"7","author":"R Durstenfeld","year":"1964","unstructured":"Durstenfeld, R.: Algorithm 235: random permutation. Commun. ACM 7(7), 420 (1964)","journal-title":"Commun. ACM"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Featherstone, K., Donovan, J.L.: Random allocation or allocation at random? patients\u2019 perspectives of participation in a randomised controlled trial. BMJ 317, 1177 (1998)","DOI":"10.1136\/bmj.317.7167.1177"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-540-24660-2_14","volume-title":"Topics in Cryptology \u2013 CT-RSA 2004","author":"P Golle","year":"2004","unstructured":"Golle, P., Jakobsson, M., Juels, A., Syverson, P.: Universal re-encryption for mixnets. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol. 2964, pp. 163\u2013178. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24660-2_14"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Gao, Z., Xu, L., Chen, L., Shah, N., Lu, Y., Shi, W.: Scalable blockchain based smart contract execution. In: 23rd IEEE International Conference on Parallel and Distributed Systems, ICPADS 2017, Shenzhen, China, 15\u201317 December 2017, pp. 352\u2013359. IEEE Computer Society (2017)","DOI":"10.1109\/ICPADS.2017.00054"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J.: The square lattice shuffle. Random Struct. Algorithms 29(4), 466\u2013474 (2006)","DOI":"10.1002\/rsa.20131"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J.: The square lattice shuffle, correction. Random Struct. Algorithms 48(1), 213 (2016)","DOI":"10.1002\/rsa.20620"},{"key":"15_CR20","unstructured":"Hanke, T., Movahedi, M., Williams, D.: DFINITY technology overview series, consensus system. CoRR, abs\/1805.04548 (2018)"},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-85174-5_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"Y Ishai","year":"2008","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer \u2013 efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 572\u2013591. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_32"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography, Second Edition. CRC Press (2014)","DOI":"10.1201\/b17668"},{"key":"15_CR23","unstructured":"NIST-Project. NIST randomness beacon. https:\/\/beacon.nist.gov\/home"},{"key":"15_CR24","unstructured":"Rabin, M.O.: How to exchange secrets with oblivious transfer. Cryptology ePrint Archive, Report 2005\/187 (2005). https:\/\/eprint.iacr.org\/2005\/187"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"Schulz, K.F., Grimes, D.A.: Blinding in randomised trials: hiding who got what. Lancet 359(9307), 696\u2013700 (2002)","DOI":"10.1016\/S0140-6736(02)07816-9"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Schulz, K.F., Grimes, D.A.: Allocation concealment in randomised trials: defending against deciphering. Epidemiol. Ser. 359, 614 (2005)","DOI":"10.1016\/S0140-6736(02)07750-4"},{"key":"15_CR27","doi-asserted-by":"crossref","unstructured":"Syta, E., et al.: Scalable bias-resistant distributed randomness. In: 2017 IEEE Symposium on Security and Privacy, SP 2017, San Jose, CA, USA, 22\u201326 May 2017, pp. 444\u2013460. IEEE Computer Society (2017)","DOI":"10.1109\/SP.2017.45"},{"key":"15_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-030-77883-5_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"E Shi","year":"2021","unstructured":"Shi, E., Wu, K.: Non-interactive anonymous router. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12698, pp. 489\u2013520. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_17"},{"key":"15_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-540-24638-1_18","volume-title":"Theory of Cryptography","author":"D Wikstr\u00f6m","year":"2004","unstructured":"Wikstr\u00f6m, D.: A universally composable mix-net. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 317\u2013335. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_18"}],"container-title":["Lecture Notes in Computer Science","Cryptology and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20974-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T20:04:57Z","timestamp":1672344297000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20974-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031209734","9783031209741"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20974-1_15","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":"10 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CANS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dubai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Arab Emirates","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":"13 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cans2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cans2022.com\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54","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":"18","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":"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":"3-4","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)"}}]}}