Proactive Secret Sharing Or: How to Cope With Perpetual Leakage

@inproceedings{Herzberg1995ProactiveSS,
  title={Proactive Secret Sharing Or: How to Cope With Perpetual Leakage},
  author={Amir Herzberg and Stanislaw Jarecki and Hugo Krawczyk and Moti Yung},
  booktitle={CRYPTO},
  year={1995}
}
Secret sharing schemes protect secrets by distributing them over different locations (share holders. [...] Key Method Hence, the adversary willing to learn the secret needs to break to all k locations during the same time period (e.g., one day, a week, etc.). Furthermore, in order to guarantee the availability and integrity of the secret, we provide mechanisms to detect maliciously (or accidentally) corrupted shares, as well as mechanisms to secretly recover the correct shares when modification is detected.Expand
A new strong proactive verifiable secret sharing scheme with unconditional security
TLDR
An enhancement to Proactive Secret Sharing is proposed in this thesis in which, instead of renewing the private shares frequently at the beginning of each timeslot during the share renewal process, each time master secret is renewed, private shares can be reused for a longer period of time and to construct different master secrets. Expand
Practical Mobile Proactive Secret Sharing
TLDR
This thesis describes the simulation, testing, and evaluation of the MPSS protocol to better understand the performance trade-offs and practicality of secret sharing protocols operating in Byzantine faulty environments. Expand
Brief Announcement: Proactive Secret Sharing with a Dishonest Majority
TLDR
This work is the first feasibility result demonstrating PSS tolerating a dishonest majority, it introduces the first PSS scheme secure against t<n passive adversaries without recovery of lost shares, it can also recover from honest faulty parties losing their shares, and when tolerating e faults the scheme tolerates t.<n-e passive corruptions. Expand
Applied Cryptography and Network Security
TLDR
This paper presents the first DPSS schemes with optimal amortized, O(1), per-secret communication compared to O( n) or exp(n) in number of parties, n, required by existing schemes and presents perfectly and statistically secure schemes with near-optimal threshold in each case. Expand
Provably Secure Proactive Secret Sharing Without the Adjacent Assumption
In secret sharing (SS), the secret is shared among a number of parties so that only a quorum of these parties can recover the secret, but a smaller set of parties cannot learn any information aboutExpand
Collusion Attack Resistance and Practice-Oriented Threshold Changeable Secret Sharing Schemes
  • Xiujie Zhang, Mingxing He
  • Computer Science
  • 2010 24th IEEE International Conference on Advanced Information Networking and Applications
  • 2010
TLDR
A new practice-oriented TCSS scheme using partial broadcast channel(PBC) in both share distribution phase and secret reconstruction phase is proposed, which increases the dealer and the combiner's communication rate and resist to collusion attack. Expand
Secret Sharing Schemes with Applications in Security Protocols
Preface A secret sharing scheme starts with a secret and then derives from it certain shares (or shadows) which are distributed to users. The secret may be recovered only by certain predeterminedExpand
How to Share Secret Efficiently over Networks
TLDR
The proposed protected secret-sharing scheme is introduced, its security properties are analyzed, and its computational complexity is evaluated, and it can be applied to threshold cryptosystems to prevent nonshareholders from learning the output of the protocols. Expand
Communication-Optimal Proactive Secret Sharing for Dynamic Groups
TLDR
The first DPSS scheme with optimal amortized per-secret communication in the number of parties, n is presented, which requires O(1) communication, as compared to \(O(n^4)\) or \(\exp (n) in previous work. Expand
A Novel Adaptive Proactive Secret Sharing without a Trusted Party
  • Xiuqun Wang
  • Computer Science
  • IACR Cryptol. ePrint Arch.
  • 2011
TLDR
This paper proposes a novel adaptive proactive secret sharing scheme without a trusted party that is uniformly efficient and tolerates t Byzantine faults in any single time interval, where the number of participants n ≥ 3t+1. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 42 REFERENCES
Maintaining Security in the Presence of Transient Faults
TLDR
A scheme which, using randomness only at the beginning of the computation, supplies each party with a new pseudorandom number at each round of communication, which is unpredictable by an adversary controlling the viruses, even if the party was infected in previous rounds. Expand
Proactive public key and signature systems
Emerging applications like electronic commerce and secure communications over open networks have made clear the fundamental role of public key cryptography as a unique enabler for world-wide scaleExpand
How to share a function securely
TLDR
The primitive of function sharing is defined, a functional analog of secret sharing, and employed to construct novel cryptosystems with improved integrity, availability and security properties and should be contrasted with the model of secure function evaluation protocols. Expand
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
It is shown how to distribute a secret to n persons such that each person can verify that he has received correct information about the secret without talking with other persons. Any k of theseExpand
A practical scheme for non-interactive verifiable secret sharing
  • Paul Feldman
  • Computer Science
  • 28th Annual Symposium on Foundations of Computer Science (sfcs 1987)
  • 1987
TLDR
This paper presents an extremely efficient, non-interactive protocol for verifiable secret sharing, which provides asynchronous networks with a constant-round simulation of simultaneous broadcast networks whenever even a bare majority of processors are good. Expand
Verifiable secret sharing and achieving simultaneity in the presence of faults
Verifiable secret sharing is a cryptographic protocol that allows one to break a secret in 11 pieccs and publicly distribute thcln to 11 people so that tile secret is reconstructible given onlyExpand
Distributed Provers with Applications to Undeniable Signatures
TLDR
A method for verifiable secret sharing is described, which allows non-interactive verification of the shares and is as secure as the Shamir secret sharing scheme in the proposed applications. Expand
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
TLDR
A digital signature scheme based on the computational difficulty of integer factorization possesses the novel property of being robust against an adaptive chosen-message attack: an adversary who receives signatures for messages of his choice cannot later forge the signature of even a single additional message. Expand
Optimal Asymmetric Encryption
TLDR
A slightly enhanced scheme is shown to have the property that the adversary can create ciphertexts only of strings for which she “knows” the corresponding plaintexts—such a scheme is not only semantically secure but also non-malleable and secure against chosen-ciphertext attack. Expand
How to share a secret
TLDR
This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces. Expand
...
1
2
3
4
5
...