{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T22:52:29Z","timestamp":1774219949422,"version":"3.50.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T00:00:00Z","timestamp":1736985600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T00:00:00Z","timestamp":1736985600000},"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":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s11432-024-4232-7","type":"journal-article","created":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T03:30:38Z","timestamp":1737343838000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["PltcRB: a practical distributed randomness beacon with optimal amortized communication complexity"],"prefix":"10.1007","volume":"68","author":[{"given":"Zheyi","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haolin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,16]]},"reference":[{"key":"4232_CR1","volume-title":"Proceedings of the 20th USENIX Security Symposium (USENIX security 11)","author":"P Mittal","year":"2011","unstructured":"Mittal P, Olumofin F, Troncoso C, et al. PIR-Tor: scalable anonymous communication using private information retrieval. In: Proceedings of the 20th USENIX Security Symposium (USENIX security 11), 2011"},{"key":"4232_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2815400.2815417","volume-title":"Proceedings of the 25th Symposium on Operating Systems Principles","author":"J van den Hooff","year":"2015","unstructured":"van den Hooff J, Lazar D, Zaharia M, et al. Vuvuzela: scalable private messaging resistant to traffic analysis. In: Proceedings of the 25th Symposium on Operating Systems Principles, 2015. 137\u2013152"},{"key":"4232_CR3","first-page":"179","volume-title":"Proceedings of the 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI 12)","author":"D I Wolinsky","year":"2012","unstructured":"Wolinsky D I, Corrigan-Gibbs H, Ford B, et al. Dissent in numbers: making strong anonymity scale. In: Proceedings of the 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI 12), 2012. 179\u2013182"},{"key":"4232_CR4","volume-title":"On Bitcoin as a public randomness source","author":"J Bonneau","year":"2015","unstructured":"Bonneau J, Clark J, Goldfeder S. On Bitcoin as a public randomness source. 2015. https:\/\/jbonneau.com\/doc\/BGC14-beacon-draft.pdf"},{"key":"4232_CR5","first-page":"335","volume-title":"Proceedings of the USENIX Security Symposium","author":"B Adida","year":"2008","unstructured":"Adida B. Helios: web-based open-audit voting. In: Proceedings of the USENIX Security Symposium, 2008. 335\u2013348"},{"key":"4232_CR6","volume-title":"Trap me if you can \u2014 million dollar curve","author":"T Baigneres","year":"2015","unstructured":"Baigneres T, Delerabl\u00e9e C, Finiasz M, et al. Trap me if you can \u2014 million dollar curve. 2015. https:\/\/eprint.iacr.org\/2015\/1249.pdf"},{"key":"4232_CR7","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1504\/IJACT.2017.089354","volume":"3","author":"A K Lenstra","year":"2017","unstructured":"Lenstra A K, Wesolowski B. Trustworthy public randomness with sloth, unicorn, and trx. Int J Appl Crypto, 2017, 3: 330","journal-title":"Int J Appl Crypto"},{"key":"4232_CR8","first-page":"357","volume-title":"Proceedings of the Annual International Cryptology Conference","author":"A Kiayias","year":"2017","unstructured":"Kiayias A, Russell A, David B, et al. Ouroboros: a provably secure proof-of-stake blockchain protocol. In: Proceedings of the Annual International Cryptology Conference, 2017. 357\u2013388"},{"key":"4232_CR9","first-page":"139","volume-title":"Proceedings of the IEEE Symposium on Security and Privacy (SP)","author":"P Ga\u017ei","year":"2019","unstructured":"Ga\u017ei P, Kiayias A, Zindros D. Proof-of-stake sidechains. In: Proceedings of the IEEE Symposium on Security and Privacy (SP), 2019. 139\u2013156"},{"key":"4232_CR10","first-page":"583","volume-title":"Proceedings of the IEEE Symposium on Security and Privacy (SP)","author":"E Kokoris-Kogias","year":"2018","unstructured":"Kokoris-Kogias E, Jovanovic P, Gasser L, et al. OmniLedger: a secure, scale-out, decentralized ledger via sharding. In: Proceedings of the IEEE Symposium on Security and Privacy (SP), 2018. 583\u2013598"},{"key":"4232_CR11","first-page":"17","volume-title":"Proceedings of the ACM SIGSAC Conference on Computer and Communications Security","author":"L Luu","year":"2016","unstructured":"Luu L, Narayanan V, Zheng C, et al. A secure sharding protocol for open blockchains. In: Proceedings of the ACM SIGSAC Conference on Computer and Communications Security, 2016. 17\u201330"},{"key":"4232_CR12","first-page":"931","volume-title":"Proceedings of the ACM SIGSAC Conference on Computer and Communications Security","author":"M Zamani","year":"2018","unstructured":"Zamani M, Movahedi M, Raykova M. RapidChain: scaling blockchain via full sharding. In: Proceedings of the ACM SIGSAC Conference on Computer and Communications Security, 2018. 931\u2013948"},{"key":"4232_CR13","doi-asserted-by":"publisher","first-page":"2084","DOI":"10.1109\/TSE.2019.2942301","volume":"47","author":"W Zou","year":"2021","unstructured":"Zou W, Lo D, Kochhar P S, et al. Smart contract development: challenges and opportunities. IEEE Trans Softw Eng, 2021, 47: 2084\u20132106","journal-title":"IEEE Trans Softw Eng"},{"key":"4232_CR14","first-page":"1353","volume-title":"Proceedings of the 27th USENIX Security Symposium (USENIX Security 18)","author":"H Kalodner","year":"2018","unstructured":"Kalodner H, Goldfeder S, Chen X, et al. Arbitrum: scalable, private smart contracts. In: Proceedings of the 27th USENIX Security Symposium (USENIX Security 18), 2018. 1353\u20131370"},{"key":"4232_CR15","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/0022-0000(83)90042-9","volume":"27","author":"M O Rabin","year":"1983","unstructured":"Rabin M O. Transaction protection by beacons. J Comput Syst Sci, 1983, 27: 256\u2013267","journal-title":"J Comput Syst Sci"},{"key":"4232_CR16","series-title":"Technical Report NISTIR 8213","volume-title":"A Reference for Randomness Beacons: Format and Protocol Version 2","author":"J Kelsey","year":"2019","unstructured":"Kelsey J, Brand\u00e3o L T, Peralta R, et al. A Reference for Randomness Beacons: Format and Protocol Version 2. Technical Report NISTIR 8213, 2019"},{"key":"4232_CR17","first-page":"444","volume-title":"Proceedings of the IEEE Symposium on Security and Privacy (SP)","author":"E Syta","year":"2017","unstructured":"Syta E, Jovanovic P, Kogias E K, et al. Scalable bias-resistant distributed randomness. In: Proceedings of the IEEE Symposium on Security and Privacy (SP), 2017. 444\u2013460"},{"key":"4232_CR18","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-319-61204-1_27","volume-title":"Proceedings of the International Conference on Applied Cryptography and Network Security","author":"I Cascudo","year":"2017","unstructured":"Cascudo I, David B. SCRAPE: scalable randomness attested by public entities. In: Proceedings of the International Conference on Applied Cryptography and Network Security, 2017. 537\u2013556"},{"key":"4232_CR19","first-page":"73","volume-title":"Proceedings of the IEEE Symposium on Security and Privacy (SP)","author":"P Schindler","year":"2020","unstructured":"Schindler P, Judmayer A, Stifter N, et al. HydRand: efficient continuous distributed randomness. In: Proceedings of the IEEE Symposium on Security and Privacy (SP), 2020. 73\u201389"},{"key":"4232_CR20","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00145-005-0318-0","volume":"18","author":"C Cachin","year":"2005","unstructured":"Cachin C, Kursawe K, Shoup V. Random oracles in constantinople: practical asynchronous byzantine agreement using cryptography. J Crypto, 2005, 18: 219\u2013246","journal-title":"J Crypto"},{"key":"4232_CR21","volume-title":"Dfinity technology overview series, consensus system","author":"T Hanke","year":"2018","unstructured":"Hanke T, Movahedi M, Williams D. Dfinity technology overview series, consensus system. 2018. ArXiv:1805.04548"},{"key":"4232_CR22","volume-title":"Drand: a distributed randomness beacon daemon","author":"DRAND","year":"2022","unstructured":"DRAND. Drand: a distributed randomness beacon daemon, 2022. https:\/\/github.com\/drand\/drand"},{"key":"4232_CR23","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1109\/EuroSP51992.2021.00017","volume-title":"Proceedings of the IEEE European Symposium on Security and Privacy (EuroS&P)","author":"D Galindo","year":"2021","unstructured":"Galindo D, Liu J, Ordean M, et al. Fully distributed verifiable random functions and their application to decentralised random beacons. In: Proceedings of the IEEE European Symposium on Security and Privacy (EuroS&P), 2021. 88\u2013102"},{"key":"4232_CR24","volume-title":"Homomorphic encryption random beacon","author":"A Cherniaeva","year":"2019","unstructured":"Cherniaeva A, Shirobokov I, Shlomovits O. Homomorphic encryption random beacon. 2019. https:\/\/eprint.iacr.org\/2019\/1320.pdf"},{"key":"4232_CR25","first-page":"572","volume-title":"Proceedings of the IEEE International Conference on Blockchain (Blockchain)","author":"T Nguyen-Van","year":"2019","unstructured":"Nguyen-Van T, Nguyen-Anh T, Le T D, et al. Scalable distributed random number generation based on homomorphic encryption. In: Proceedings of the IEEE International Conference on Blockchain (Blockchain), 2019. 572\u2013579"},{"key":"4232_CR26","first-page":"311","volume-title":"Proceedings of the 26th International Conference on the Theory and Application of Cryptology and Information Security, Daejeon","author":"I Cascudo","year":"2020","unstructured":"Cascudo I, David B. Albatross: publicly attestable batched randomness based on secret sharing. In: Proceedings of the 26th International Conference on the Theory and Application of Cryptology and Information Security, Daejeon, 2020. 311\u2013341"},{"key":"4232_CR27","first-page":"3502","volume-title":"Proceedings of the ACM SIGSAC Conference on Computer and Communications Security","author":"A Bhat","year":"2021","unstructured":"Bhat A, Shrestha N, Luo Z, et al. Randpiper \u2014 reconfiguration-friendly random beacons with quadratic communication. In: Proceedings of the ACM SIGSAC Conference on Computer and Communications Security, 2021. 3502\u20133524"},{"key":"4232_CR28","first-page":"2502","volume-title":"Proceedings of the IEEE Symposium on Security and Privacy (SP)","author":"S Das","year":"2022","unstructured":"Das S, Krishnan V, Isaac I M, et al. SPURT: scalable distributed randomness beacon with transparent setup. In: Proceedings of the IEEE Symposium on Security and Privacy (SP), 2022. 2502\u20132517"},{"key":"4232_CR29","volume-title":"OptRand: optimistically responsive reconfigurable distributed randomness","author":"A Bhat","year":"2023","unstructured":"Bhat A, Shrestha N, Kate A, et al. OptRand: optimistically responsive reconfigurable distributed randomness. 2023. https:\/\/eprint.iacr.org\/2022\/193.pdf"},{"key":"4232_CR30","first-page":"757","volume-title":"Proceedings of the Annual International Cryptology Conference","author":"D Boneh","year":"2018","unstructured":"Boneh D, Bonneau J, B\u00fcnz B, et al. Verifiable delay functions. In: Proceedings of the Annual International Cryptology Conference, 2018. 757\u2013788"},{"key":"4232_CR31","first-page":"236","volume-title":"Proceedings of the Annual International Cryptology Conference","author":"D Boneh","year":"2000","unstructured":"Boneh D, Naor M. Timed commitments. In: Proceedings of the Annual International Cryptology Conference, 2000. 236\u2013254"},{"key":"4232_CR32","volume-title":"RandRunner: distributed randomness from trapdoor VDFs with strong uniqueness","author":"P Schindler","year":"2020","unstructured":"Schindler P, Judmayer A, Hittmeir M, et al. RandRunner: distributed randomness from trapdoor VDFs with strong uniqueness. 2020. https:\/\/eprint.iacr.org\/2020\/942.pdf"},{"key":"4232_CR33","volume-title":"Proceedings of the Network and Distributed System Security (NDSS) Symposium","author":"H Lee","year":"2022","unstructured":"Lee H, Hsu Y, Wang J J, et al. HeadStart: efficiently verifiable and low-latency participatory randomness generation at scale. In: Proceedings of the Network and Distributed System Security (NDSS) Symposium, 2022"},{"key":"4232_CR34","first-page":"2663","volume-title":"Proceedings of the ACM SIGSAC Conference on Computer and Communications Security","author":"S A K Thyagarajan","year":"2021","unstructured":"Thyagarajan S A K, Castagnos G, Laguillaumie F, et al. Efficient CCA timed commitments in class groups. In: Proceedings of the ACM SIGSAC Conference on Computer and Communications Security, 2021. 2663\u20132684"},{"key":"4232_CR35","volume-title":"Bicorn: an optimistically efficient distributed randomness beacon","author":"K Choi","year":"2023","unstructured":"Choi K, Arun A, Tyagi N, et al. Bicorn: an optimistically efficient distributed randomness beacon. 2023. https:\/\/eprint.iacr.org\/2023\/221.pdf"},{"key":"4232_CR36","first-page":"719","volume-title":"Proceedings of the ACM SIGSAC Conference on Computer and Communications Security","author":"A R Choudhuri","year":"2017","unstructured":"Choudhuri A R, Green M, Jain A, et al. Fairness in an unfair world: fair multiparty computation from public bulletin boards. In: Proceedings of the ACM SIGSAC Conference on Computer and Communications Security, 2017. 719\u2013728"},{"key":"4232_CR37","first-page":"500","volume-title":"Proceedings of the IACR International Conference on Public-Key Cryptography","author":"P Chvojka","year":"2023","unstructured":"Chvojka P, Jager T. Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments. In: Proceedings of the IACR International Conference on Public-Key Cryptography, 2023. 500\u2013529"},{"key":"4232_CR38","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-030-64381-2_14","volume-title":"Proceedings of the 18th International Conference on Theory of Cryptography, Durham","author":"J Katz","year":"2020","unstructured":"Katz J, Loss J, Xu J. On the security of time-lock puzzles and timed commitments. In: Proceedings of the 18th International Conference on Theory of Cryptography, Durham, 2020. 390\u2013413"},{"key":"4232_CR39","volume-title":"Proceedings of the 10th Innovations in Theoretical Computer Science Conference","author":"K Pietrzak","year":"2019","unstructured":"Pietrzak K. Simple verifiable delay functions. In: Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019"},{"key":"4232_CR40","first-page":"379","volume-title":"Proceedings of the 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt","author":"B Wesolowski","year":"2019","unstructured":"Wesolowski B. Efficient verifiable delay functions. In: Proceedings of the 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, 2019. 379\u2013407"},{"key":"4232_CR41","first-page":"390","volume-title":"Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques","author":"D Chaum","year":"1992","unstructured":"Chaum D, Pedersen T P. Transferred cash grows in size. In: Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques, 1992. 390\u2013407"},{"key":"4232_CR42","first-page":"207","volume-title":"Proceedings of International Conference on the Theory and Application of Cryptographic Techniques, Bruges","author":"V Shoup","year":"2000","unstructured":"Shoup V. Practical threshold signatures. In: Proceedings of International Conference on the Theory and Application of Cryptographic Techniques, Bruges, 2000. 207\u2013220"},{"key":"4232_CR43","first-page":"514","volume-title":"Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security","author":"D Boneh","year":"2001","unstructured":"Boneh D, Lynn B, Shacham H. Short signatures from the weil pairing. In: Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, 2001. 514\u2013532"},{"key":"4232_CR44","first-page":"120","volume-title":"Proceedings of the 40th Annual Symposium on Foundations of Computer Science","author":"S Micali","year":"1999","unstructured":"Micali S, Rabin M, Vadhan S. Verifiable random functions. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999. 120\u2013130"},{"key":"4232_CR45","first-page":"168","volume-title":"Proceedings of the International Conference on Financial Cryptography","author":"J A Garay","year":"2002","unstructured":"Garay J A, Jakobsson M. Timed release of standard digital signatures. In: Proceedings of the International Conference on Financial Cryptography, 2002. 168\u2013182"},{"key":"4232_CR46","first-page":"116","volume-title":"Proceedings of the Annual International Cryptology Conference","author":"N Gilboa","year":"1999","unstructured":"Gilboa N. Two party RSA key generation. In: Proceedings of the Annual International Cryptology Conference, 1999. 116\u2013129"},{"key":"4232_CR47","first-page":"425","volume-title":"Proceedings of the 17th Annual International Cryptology Conference, Santa Barbara","author":"D Boneh","year":"1997","unstructured":"Boneh D, Franklin M. Efficient generation of shared RSA keys. In: Proceedings of the 17th Annual International Cryptology Conference, Santa Barbara, 1997. 425\u2013439"},{"key":"4232_CR48","first-page":"1","volume-title":"Proceedings of the Public-Key Cryptography and Computational Number Theory","author":"J Buchmann","year":"2001","unstructured":"Buchmann J, Hamdy S. A survey on IQ cryptography. In: Proceedings of the Public-Key Cryptography and Computational Number Theory, 2001. 1\u201315"},{"key":"4232_CR49","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1090\/S0894-0347-1989-1002631-0","volume":"2","author":"J L Hafner","year":"1989","unstructured":"Hafner J L, McCurley K S. A rigorous subexponential algorithm for computation of class groups. J Amer Math Soc, 1989, 2: 837\u2013850","journal-title":"J Amer Math Soc"},{"key":"4232_CR50","volume-title":"Export compliance metrics for intel microprocessors","author":"Intel","year":"2022","unstructured":"Intel. Export compliance metrics for intel microprocessors, 2022. https:\/\/www.intel.com\/content\/www\/us\/en\/support\/articles\/000005755\/processors.html"},{"key":"4232_CR51","volume-title":"Computer Architecture: A Quantitative Approach","author":"J L Hennessy","year":"2011","unstructured":"Hennessy J L, Patterson D A. Computer Architecture: A Quantitative Approach. San Francisco: Morgan Kaufmann Publishers Inc., 2011"},{"key":"4232_CR52","volume-title":"Trustless groups of unknown order with hyperelliptic curves","author":"S Dobson","year":"2020","unstructured":"Dobson S, Galbraith S D, Smith B. Trustless groups of unknown order with hyperelliptic curves. 2020. https:\/\/eprint.iacr.org\/2020\/196.pdf"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-024-4232-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-024-4232-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-024-4232-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T22:02:20Z","timestamp":1774216940000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-024-4232-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,16]]},"references-count":52,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["4232"],"URL":"https:\/\/doi.org\/10.1007\/s11432-024-4232-7","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,16]]},"assertion":[{"value":"5 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"122304"}}