Faster dynamic asynchronous distributed random beacon
random beacons are crucial components in blockchain consensus, secure multiparty computation, and decentralized applications, providing high-quality randomness for these applications. However, random beacon services operated by a single organization face centralization issues and cannot be fully tru...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
ELS Publishing (ELSP)
2025-03-01
|
| Series: | Blockchain |
| Subjects: | |
| Online Access: | https://elsp-homepage.oss-cn-hongkong.aliyuncs.compaper/journal/open/BC/2025/blockchain20250006.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849329393380360192 |
|---|---|
| author | Hongjian Yang Yuan Lu Wu Chen Yang Zhang Rong Wei Jieyu Li |
| author_facet | Hongjian Yang Yuan Lu Wu Chen Yang Zhang Rong Wei Jieyu Li |
| author_sort | Hongjian Yang |
| collection | DOAJ |
| description | random beacons are crucial components in blockchain consensus, secure multiparty computation, and decentralized applications, providing high-quality randomness for these applications. However, random beacon services operated by a single organization face centralization issues and cannot be fully trusted by mission-critical applications due to possible breaches and collusion. Asynchronous distributed random beacon protocols are proposed as a promising alternative to such centralized services, since they can generate high-quality randomnesses that are unbiased and unpredictable for critical applications in the adversarial asynchronous Internet. However, they either suffer from expensive communication overhead or lack accommodation for efficient dynamic participation. To address these issues, we propose a practical asynchronous random beacon protocol that can be efficiently reconfigured to support rotations of participating nodes, reducing the reconfiguration’s communication complexity from O(λn3) to O(λ κn2), where λ is the cryptography security parameter, n is the size of nodes in the network, and κ is the small size of a any-trust sub-committee (which approximates a constant number about several dozens). We also demonstrate the performance and security of our scheme through thorough analysis and extensive experiments. |
| format | Article |
| id | doaj-art-6eb4493ffbab4fe085c3777ce58cc311 |
| institution | Kabale University |
| issn | 2959-1260 2958-8138 |
| language | English |
| publishDate | 2025-03-01 |
| publisher | ELS Publishing (ELSP) |
| record_format | Article |
| series | Blockchain |
| spelling | doaj-art-6eb4493ffbab4fe085c3777ce58cc3112025-08-20T03:47:16ZengELS Publishing (ELSP)Blockchain2959-12602958-81382025-03-013210.55092/blockchain202500061831973129228939264Faster dynamic asynchronous distributed random beaconHongjian Yang0Yuan Lu1Wu Chen2Yang Zhang3Rong Wei4Jieyu Li5Institute of Software, Chinese Academy of Sciences, Beijing, ChinaInstitute of Software, Chinese Academy of Sciences, Beijing, ChinaBeijing Institute of Satellite Information Engineering, Beijing, ChinaBeijing Institute of Satellite Information Engineering, Beijing, ChinaBeijing Institute of Satellite Information Engineering, Beijing, ChinaBeijing Institute of Satellite Information Engineering, Beijing, Chinarandom beacons are crucial components in blockchain consensus, secure multiparty computation, and decentralized applications, providing high-quality randomness for these applications. However, random beacon services operated by a single organization face centralization issues and cannot be fully trusted by mission-critical applications due to possible breaches and collusion. Asynchronous distributed random beacon protocols are proposed as a promising alternative to such centralized services, since they can generate high-quality randomnesses that are unbiased and unpredictable for critical applications in the adversarial asynchronous Internet. However, they either suffer from expensive communication overhead or lack accommodation for efficient dynamic participation. To address these issues, we propose a practical asynchronous random beacon protocol that can be efficiently reconfigured to support rotations of participating nodes, reducing the reconfiguration’s communication complexity from O(λn3) to O(λ κn2), where λ is the cryptography security parameter, n is the size of nodes in the network, and κ is the small size of a any-trust sub-committee (which approximates a constant number about several dozens). We also demonstrate the performance and security of our scheme through thorough analysis and extensive experiments.https://elsp-homepage.oss-cn-hongkong.aliyuncs.compaper/journal/open/BC/2025/blockchain20250006.pdfdistributed random beaconasynchronous multi-party protocolfault-tolerance systemthreshold cryptosystem reconfiguration |
| spellingShingle | Hongjian Yang Yuan Lu Wu Chen Yang Zhang Rong Wei Jieyu Li Faster dynamic asynchronous distributed random beacon Blockchain distributed random beacon asynchronous multi-party protocol fault-tolerance system threshold cryptosystem reconfiguration |
| title | Faster dynamic asynchronous distributed random beacon |
| title_full | Faster dynamic asynchronous distributed random beacon |
| title_fullStr | Faster dynamic asynchronous distributed random beacon |
| title_full_unstemmed | Faster dynamic asynchronous distributed random beacon |
| title_short | Faster dynamic asynchronous distributed random beacon |
| title_sort | faster dynamic asynchronous distributed random beacon |
| topic | distributed random beacon asynchronous multi-party protocol fault-tolerance system threshold cryptosystem reconfiguration |
| url | https://elsp-homepage.oss-cn-hongkong.aliyuncs.compaper/journal/open/BC/2025/blockchain20250006.pdf |
| work_keys_str_mv | AT hongjianyang fasterdynamicasynchronousdistributedrandombeacon AT yuanlu fasterdynamicasynchronousdistributedrandombeacon AT wuchen fasterdynamicasynchronousdistributedrandombeacon AT yangzhang fasterdynamicasynchronousdistributedrandombeacon AT rongwei fasterdynamicasynchronousdistributedrandombeacon AT jieyuli fasterdynamicasynchronousdistributedrandombeacon |