The (N) scheme, often referred to as an (n, n) threshold scheme, is a cryptographic construction where a secret is divided into ‘n’ shares, and all ‘n’ shares are required to reconstruct the original secret. This is a specific instance of a threshold secret sharing scheme where the threshold ‘k’ equals the total number of shares ‘n’. It provides absolute security against any subset of shares being compromised, as no information about the secret is revealed until all shares are combined. This mechanism ensures maximal decentralization of trust. It is a fundamental cryptographic primitive.
Security
The security provided by an (n, n) scheme is maximal in terms of preventing partial reconstruction of the secret. If even one share is missing or compromised, the entire secret remains secure. This makes it suitable for extremely sensitive operations where compromise of any single share is unacceptable. However, it also introduces a single point of failure if any one share is irrevocably lost. This trade-off between security against partial compromise and resilience against share loss is critical. It ensures strong protection against unauthorized access.
Application
In cryptocurrency and derivatives, the (n, n) scheme finds application in scenarios demanding the highest level of collective authorization, such as securing the root key of a highly sensitive smart contract or the treasury of a decentralized autonomous organization (DAO) where unanimous consent is required. It can also be used for multi-party computation where all participants must contribute their input to derive a result. While less flexible than (k, n) schemes, it serves specific high-security, full-consensus requirements. This scheme ensures full collective control.
