Proactive Secret Sharing Or: How to Cope With Perpetual Leakage

By Amir Herzberg, Stanislaw Jarecki, Hugo Krawczyk, M. Yung. 1995

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Ekiden: A Platform for Confidentiality-Preserving, Trustworthy, and Performant Smart Contracts (2018, positive): “[33], [68]) can be used to periodically rotate the committee without changing the secret.”
Providing robust and ubiquitous security support for mobile ad-hoc networks (2001, methodology): “In order to resist gradual break-ins over a long term period, each entity’s secret share is updated periodically [7, 5].”
ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks (2003, unknown): “, mobile adversaryproposed in previous research [9]).”
COCA: a secure distributed online certification authority (2002, background): “, [Jarecki 1995; Herzberg et al. 1995; Herzberg et al. 1997; Frankel et al. 1997; Frankel et al. 1997]); details are discussed in [Zhou et al.”
Practical byzantine fault tolerance and proactive recovery (2002, background): “This concept has previously been applied in synchronous systems to secret-sharing schemes [Herzberg et al. 1995], threshold cryptography [Herzberg et al. 1997], and more recently secure information storage and retrieval [Garay et al. 2000] (which provides single-writer single-reader replicated…”
A survey on peer-to-peer key management for mobile ad hoc networks (2007, background): “This forces the nodes forming the DCA to execute a share renewal protocol [Herzberg et al. 1995] within a variable period T; the choice of T is in.uenced by similar factors to those that affect the selection of (n, t).”
Secure and efficient key management in mobile ad hoc networks (2005, methodology): “The proofs of all algorithms are are shown in [3][ 4 ][5][6].”
Constant-Size Commitments to Polynomials and Their Applications (2010, methodology): “[23] have used this technique in their share recovery scheme.”
HAIL: a high-availability and integrity layer for cloud storage (2009, methodology): “, [22, 7]) as well as signature schemes (e.”
Non-commercial Research and Educational Use including without Limitation Use in Instruction at Your Institution, Sending It to Specific Colleagues That You Know, and Providing a Copy to Your Institution's Administrator. All Other Uses, Reproduction and Distribution, including without Limitation Comm (2005, unknown): “For w(r) we used a triangle function [18] with a width of the base of Dw: wðrÞ ¼ 1 À jrj= 1 2 Dw À Á for jrj 1 2 Dw 0 otherwise & ð7Þ The above defined fitness function is able to smooth in a controlled way the error landscape, and therefore allows the GA to locate the global minimum.”
Secure threshold multi authority attribute based encryption without a central authority (2008, methodology): “[10] in 1995, provides a useful tool to construct a proactive attribute based system in which the authorities’ secret keys could be updated periodically without any modification to the authorities’ respective public keys.”
Forward-Security in Private-Key Cryptography (2003, background): “Specific approaches include threshold cryptography [17] and proactive secret sharing [23].”
Uncheatable Reputation for Distributed Computation Markets (2006, background): “An elegant solution for mobile viruses [20, 15] that can easily be applied in our setting, combines proactive re-computation of the verifiable secret shares of participants with the rebooting of infected hosts.”
MPSS: Mobile Proactive Secret Sharing (2010, methodology): “Proactive secret sharing schemes [Frankel et al. 1997; Herzberg et al. 1995, 1997; Ostrovsky and Yung 1991; Rabin 1998; Zhou et al. 2005] attempt to address the problem that shares learned by the adversary are compromised forever by resharing the secret periodically among the same nodes.”