TL;DR
This paper introduces a novel proactive secret sharing (PSS) scheme that efficiently handles dynamic user membership and revocation. By categorizing users into roles and leveraging threshold homomorphic encryption (ThHE) with hash-based verification, the scheme achieves non-interactive share refresh and secure user management, maintaining O(n) communication complexity.
What Problem Does This Paper Address?
Traditional secret sharing schemes, like Shamir's Secret Sharing (SSS), are vulnerable to long-term attacks because compromised shares can be accumulated over time. Proactive Secret Sharing (PSS) addresses this by periodically refreshing shares, but existing PSS schemes often suffer from high communication overhead due to interactive refresh processes and struggle with dynamic user management (users joining or leaving). Specifically, the authors highlight two main challenges: the need for numerous interaction rounds during share refresh, and the assumption of a fixed user set, which is impractical for dynamic environments. Their previous work introduced a non-interactive PSS scheme but lacked robust user revocation capabilities. This paper aims to bridge this gap by enabling efficient, non-interactive share refresh alongside dynamic user revocation and role-based membership management.
Methods
The proposed scheme builds upon the Non-interactive Updatable Secret Sharing (NUSS) framework, which utilizes Threshold Homomorphic Encryption (ThHE) for non-interactive share refresh. The key innovations in this paper are:
- Role-Based Dynamic Membership Management: Users are classified into three roles in each epoch: "Retain" (users present in the previous and current epoch), "Newly Join" (users joining for the first time), and "Rejoin" (revoked users reauthorized). This classification allows for fine-grained management.
- Unified Fresh Revocation Protocol: The system integrates share refresh and user revocation into a single, non-interactive process. The trusted dealer broadcasts a compact message containing encrypted refresh arrays and a hash-based valid-user set.
- Hash-Based Verification for Revocation: A hash function is used to bind revocation parameters to the cryptographic hashes of valid users, ensuring the integrity of the valid-user set and preventing unauthorized modifications without compromising non-interactivity.
- ThHE for Secure and Efficient Operations: The scheme leverages ThHE to perform computations on encrypted data, enabling users to independently refresh their shares without direct interaction with the dealer or other users. This also ensures data confidentiality during transmission.
- Dynamic Threshold Support: The protocol supports dynamic threshold changes in each epoch, allowing the system to adjust its security level flexibly.
Datasets
Not discussed in the paper. The paper focuses on theoretical design and evaluation of a cryptographic protocol.
Key Insights and Ideas
- The Power of Role-Based Classification: By categorizing users into "Retain," "Newly Join," and "Rejoin," the scheme can tailor the refresh process more efficiently. This is particularly useful for "Rejoin" users, who might have had short absences and can be handled differently than entirely new users, avoiding unnecessary overhead.
- Hash Functions as Integrity Anchors: Using hash functions to bind user identities and revocation status to a verifiable representation is a clever way to ensure data integrity and prevent tampering without requiring complex cryptographic proofs for every user.
- Non-Interactivity is Key for Scalability: The core contribution of making both share refresh and revocation non-interactive is crucial for large-scale dynamic systems. This significantly reduces communication overhead and complexity, making the system more practical.
- ThHE as a Versatile Tool: The paper effectively demonstrates how ThHE can be adapted not only for secure computation on encrypted data but also as a foundation for building complex cryptographic primitives like proactive secret sharing with dynamic membership.
Key Results
- O(n) Communication Complexity: The proposed scheme maintains the same communication complexity as its predecessor (NUSS), which is efficient for large-scale systems.
- Non-Interactive Share Refresh and Revocation: The scheme enables users to perform these critical operations independently, without requiring multiple rounds of communication.
- Enhanced Security: The integration of ThHE and hash-based verification ensures that revoked users cannot reconstruct the secret, and the system is secure against adversaries who compromise fewer than k shares within an epoch.
- Performance: Experimental results (Figures 3 and 4) show that the local computation time and data size for revoke and refresh operations are stable and comparable to previous non-interactive schemes, with the revoke procedure adding minimal overhead. Figure 5 suggests that mixed user role compositions can lead to improved workload distribution and lower system latency in certain scenarios.
Limitations and Future Work
- Centralized Dealer: The current study relies on a centralized dealer for setup and broadcasting. The authors acknowledge this as a limitation and propose exploring decentralized frameworks, such as distributed key generation, for a fully distributed design in future work.
- Assumptions: The security relies on standard assumptions like semantic security for revoked users, secure refresh parameters encrypted under ThHE, and an optimal rejoin threshold.
- Future Work: The authors explicitly mention exploring decentralized frameworks for key generation as a future research direction.
Summary updated