このエントリーをはてなブックマークに追加
ID 70336
FullText URL
Author
He, Yixuan Graduate School of Environmental, Life, Natural Science and Technology, Okayama University
Kodera, Yuta Graduate School of Environmental, Life, Natural Science and Technology, Okayama University
Nogami, Yasuyuki Graduate School of Environmental, Life, Natural Science and Technology, Okayama University Kaken ID publons researchmap
Huda, Samsul Interdisciplinary Education and Research Field, Okayama University
Abstract
Proactive secret sharing (PSS), an extension of secret-sharing schemes, safeguards sensitive data in dynamic distributed networks by periodically refreshing shares to counter adversarial attacks. In our previous work, we constructed a non-interactive proactive secret scheme by integrating threshold homomorphic encryption (ThHE) while reducing the communication complexity to 𝑂(𝑛). Not only is refreshing shares important but revoking the shares of users who have left the system is also essential in practical dynamic membership scenarios. However, the previous work was insufficient for supporting explicit user revocation. This study strengthens the description of roles for authorized users and proposes a scheme to achieve non-interactive share refresh and dynamic user management. In each epoch, authorized users are classified into three roles: retain, newly join, and rejoin, and they receive a broadcast of the compact ciphertext encoding both the refresh information and the revocation instructions from the trusted center (dealer). Authorized users independently derive new shares through homomorphic computations, whereas revoked users are unable to generate new shares. Hash functions are used to bind revocation parameters to the cryptographic hashes of valid users in order to guarantee integrity during revocation, allowing for effective verification without compromising non-interactivity. Our new scheme not only extends the revocation structure but also preserves the 𝑂(𝑛) communication complexity.
Keywords
proactive secret sharing
user revocation
threshold homomorphic encryption
non-interactive
Published Date
2025-12-11
Publication Title
Cryptography
Volume
volume9
Issue
issue4
Publisher
MDPI AG
Start Page
80
ISSN
2410-387X
Content Type
Journal Article
language
English
OAI-PMH Set
岡山大学
Copyright Holders
© 2025 by the authors.
File Version
publisher
DOI
Web of Science KeyUT
Related Url
isVersionOf https://doi.org/10.3390/cryptography9040080
License
https://creativecommons.org/licenses/by/4.0/
Citation
He, Y.; Kodera, Y.; Nogami, Y.; Huda, S. Role-Based Efficient Proactive Secret Sharing with User Revocation. Cryptography 2025, 9, 80. https://doi.org/10.3390/cryptography9040080