TY - GEN
T1 - FlexiADKG
T2 - 30th Australasian Conference on Information Security and Privacy, ACISP 2025
AU - Yang, Yang
AU - Li, Bingyu
AU - Ding, Zhenyang
AU - Wu, Qianhong
AU - Qin, Bo
AU - Wang, Qin
N1 - Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.
PY - 2025
Y1 - 2025
N2 - Distributed Key Generation (DKG) is crucial for initializing threshold cryptosystems without a trusted third party. However, adapting DKG to asynchronous networks (i.e., ADKG) presents challenges. In this paper, we address two: (i) fixed threshold, where each set of t+1 participants is identical, lacking the flexible configurations needed for asynchronous environments; and (ii) high complexity, which arises from the use of multiple parallel instances during the consensus phase. We propose FlexiADKG, an ADKG protocol that features a configurable threshold structure and reduces communication overhead. By utilizing vector space-based secret sharing, FlexiADKG enables customizable threshold configurations based on node-specific attributes such as reputation and security level. Additionally, we replace traditional n parallel asynchronous binary agreement (ABA) instances with a multi-valued Byzantine agreement (MVBA), thereby reducing round complexity from O(logn) to O(1). We implement FlexiADKG on geographically distributed AWS instances and evaluate its performance with node sets of 16, 32, 64, and 128. Experimental results demonstrate that FlexiADKG significantly outperforms the ADKG protocol by Das et al. (SP’22), achieving 61% of the runtime and 53% of the bandwidth consumption on average. We also provide formal security proofs to validate all claimed properties.
AB - Distributed Key Generation (DKG) is crucial for initializing threshold cryptosystems without a trusted third party. However, adapting DKG to asynchronous networks (i.e., ADKG) presents challenges. In this paper, we address two: (i) fixed threshold, where each set of t+1 participants is identical, lacking the flexible configurations needed for asynchronous environments; and (ii) high complexity, which arises from the use of multiple parallel instances during the consensus phase. We propose FlexiADKG, an ADKG protocol that features a configurable threshold structure and reduces communication overhead. By utilizing vector space-based secret sharing, FlexiADKG enables customizable threshold configurations based on node-specific attributes such as reputation and security level. Additionally, we replace traditional n parallel asynchronous binary agreement (ABA) instances with a multi-valued Byzantine agreement (MVBA), thereby reducing round complexity from O(logn) to O(1). We implement FlexiADKG on geographically distributed AWS instances and evaluate its performance with node sets of 16, 32, 64, and 128. Experimental results demonstrate that FlexiADKG significantly outperforms the ADKG protocol by Das et al. (SP’22), achieving 61% of the runtime and 53% of the bandwidth consumption on average. We also provide formal security proofs to validate all claimed properties.
KW - Blockchain
KW - Configurable threshold
KW - Constant round complexity
KW - Distributed key generation
UR - https://www.scopus.com/pages/publications/105011048133
U2 - 10.1007/978-981-96-9095-4_14
DO - 10.1007/978-981-96-9095-4_14
M3 - 会议稿件
AN - SCOPUS:105011048133
SN - 9789819690947
T3 - Lecture Notes in Computer Science
SP - 269
EP - 288
BT - Information Security and Privacy - 30th Australasian Conference, ACISP 2025, Proceedings
A2 - Susilo, Willy
A2 - Pieprzyk, Josef
PB - Springer Science and Business Media Deutschland GmbH
Y2 - 14 July 2025 through 16 July 2025
ER -