PADRE: Privacy-Aware Decentralized Randomness
IEEE Transactions on Dependable and Secure Computing · 2026-05 · 23 (3) · 7284-7299
DOI: 10.1109/tdsc.2026.3672520 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Dependable and Secure Computing, 2026-05. Verfasst von Zengpeng Li und 3 weiteren Autor:innen. Gefördert von: National Key Research and Development Program of China, National Natural Science Foundation of China, Youth Innovation Team of Shandong Province.
Abstract (Originalsprache)
A Decentralized Randomness Beacon (DRB) is a powerful cryptographic tool that aims to generate fair, unpredictable, and publicly verifiable randomness. DRBs are gaining significant importance in distributed computing systems and decentralized network applications, where they serve as crucial sources of randomness for consensus protocols and other essential functions. While most existing DRBs prioritize core security attributes such as infeasibility and unpredictability, they often neglect participants’ identity privacy. Traditional DRB protocols, such as GRandLine (CCS 2024) and RandFlash (TIFS 2025), typically expose participants’ identities to potential attackers during the leader-election process and subsequent interactions. This exposure can disclose sensitive information, including blockchain stakes, rendering these protocols unsuitable for applications that require stringent privacy guarantees. In this work, we propose a privacy-aware DRB protocol, $\textsc {PADRE}$ P A D R E , that conceals participants’ identities while generating randomness without compromising efficiency or basic security. To this end, we propose a new cryptographic primitive, the “anonymous threshold verifiable random function (ATVRF)”, that introduces both “threshold-capability” and “anonymity” on top of verifiable random functions (VRFs) under the Decisional Diffie-Hellman assumption (on elliptic curves). In addition, we integrate an “anonymous lottery” into the committee-based DRB, enhancing privacy protection and performance to a wide range of state-of-the-art DRBs. Our proof-of-concept implementation (102 beacons per minute on average across 64 nodes) indicates that $\textsc {PADRE}$ P A D R E is suitable for real-world deployments.
Förderung
- National Key Research and Development Program of China
- National Natural Science Foundation of China
- Youth Innovation Team of Shandong Province
- Natural Science Foundation of Shandong Province
- Natural Science Foundation of Qingdao
- China Computer Federation (CCF)-Huawei Populus Grove Fund
- China Computer Federation (CCF)-Tencent Rhino-Bird Fund
Zitieren
APA
Li, Z., Zhao, Z., Wang, M., & Deng, X. (2026). PADRE: Privacy-Aware Decentralized Randomness. IEEE Transactions on Dependable and Secure Computing, 23(3), 7284-7299. https://doi.org/10.1109/tdsc.2026.3672520
Vancouver
Li Z, Zhao Z, Wang M, Deng X. PADRE: Privacy-Aware Decentralized Randomness. IEEE Transactions on Dependable and Secure Computing. 2026;23(3):7284-7299. doi:10.1109/tdsc.2026.3672520
BibTeX
@article{Li2026,
author = {Li, Zengpeng and Zhao, Zishuo and Wang, Mei and Deng, Xudong},
title = {PADRE: Privacy-Aware Decentralized Randomness},
journal = {IEEE Transactions on Dependable and Secure Computing},
year = {2026},
volume = {23},
number = {3},
pages = {7284--7299},
doi = {10.1109/tdsc.2026.3672520}
}
EUVIMED