Secret Share Redistribution Using Non-Interactive Proof Broadcasts

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Distributed networks face challenges in providing efficient and secure methods for key management, particularly in resharing or redistributing key material associated with encryption/decryption schemes due to changing network configurations and security needs.

Innovation Solution

A computer-implemented method for redistributing a pre-existing secret sharing using non-interactive zero-knowledge proofs and public-key encryption with forward secrecy, allowing dealers to create encrypted sub-shares and broadcast them to receivers without interaction, ensuring secure and efficient redistribution.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If traditional secret sharing redistribution methods are used, then security is maintained through interactive verification, but communication overhead and time consumption increase due to bilateral interaction requirements

Engineering Contradiction:
ImprovesecurityVSAvoidcommunication time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent applies preliminary action by having dealers pre-generate and broadcast encrypted sub-shares along with non-interactive zero-knowledge proofs before the actual secret reconstruction phase. This allows receivers to independently verify the validity of shares without requiring real-time interaction with dealers, thus reducing communication time while maintaining security verification.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent introduces non-interactive zero-knowledge proofs as an intermediary mechanism that mediates between the need for security verification and the desire to reduce communication overhead. These proofs allow receivers to verify the correctness of encrypted sub-shares without direct interaction with dealers, effectively decoupling verification from communication.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Reliability

If interactive verification methods are used for secret share redistribution, then security is ensured through direct communication, but system complexity increases due to coordination requirements

Engineering Contradiction:
ImprovesecurityVSAvoidsystem complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent applies self-service by enabling receivers to independently verify the correctness of received encrypted sub-shares using non-interactive zero-knowledge proofs. This eliminates the need for complex coordination mechanisms and centralized verification authorities, as each receiver can autonomously validate their shares without requiring system-wide coordination.

Inventive Principle:
Principle #25Self-service

3Measurement precision

If multiple rounds of communication are used for secret redistribution, then verification accuracy is improved, but productivity decreases due to repeated interactions

Engineering Contradiction:
Improveverification accuracyVSAvoidredistribution efficiency
Core Design Contradiction:
Measurement precisionVSProductivity

Solution Approach 1:

The patent performs verification准备工作 in advance by having dealers generate and broadcast non-interactive zero-knowledge proofs along with encrypted sub-shares in a single communication round. This preliminary action ensures that all verification data is available upfront, eliminating the need for multiple communication rounds while maintaining high verification accuracy.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS12519621B2Redistribution of secret sharings
Publication Date: 2026.01.06 DFINITY STIFTUNG
  • US12519621B2 patent drawing
  • US12519621B2 patent drawing
  • US12519621B2 patent drawing

AI summary

Method for redistribution of a (n,t)-secret sharing of a secrets from a set of dealers to a set of receivers. The method comprises performing by each of at least the threshold number t of dealers, —creating a (n′,t′)-secret sharing of its respective secret share, —creating a set of ciphertexts comprising for each receiver one encrypted sub-share of the n1 secret sub-shares of its respective secret share and being encrypted with respect to a public encryption key of the respective receiver. The public encryption key is a key of a public-key encryption scheme. —generating a non-interactive zero-knowledge proof that the set of ciphertexts jointly contain a redistribution of its secret share—broadcasting a dealing to the set of receivers, the dealing comprising the set of ciphertexts for the set of receivers and the corresponding non-interactive zero-knowledge proof.