How to share a secret

Shamir, Adi

doi:10.1145/359168.359176

Cited by 10,838 publications

(6,477 citation statements)

References 1 publication

Supporting

Mentioning

6,113

Contrasting

Unclassified

Order By: Relevance

“…The first constructions of secret sharing schemes were due to Blakley [2] and Shamir [4]. Their schemes are called threshold schemes because they have the property that for some t , only the subsets of participants of cardinality at least t can determine the secret.…”

Section: This Work Performedmentioning

confidence: 99%

Some Ideal Secret Sharing Schemes

Brickell

Lecture Notes in Computer Science

286

331

View full text Add to dashboard Cite

In a secret sharing scheme, a dealer has a secret. The dealer gives each participant in the scheme a share of the secret. There is a set I? of subsets of the participants with the property that any subset of participants that is in I? can determine the secret.En a perfect secret sharing scheme, any subset of participants that is not in I' cannot obtain any information about the secret. We wilI say that a perfect secret sharing scheme is ideal if all of the shares are from the same domain as the secret. Shamir and 13lakley constructed ideal threshold schemes, and Benaloh has constructed other ideal secret sharing schemes. In this paper, we construct ideal secret sharing schemes for more general access structures which include the multilevel and compartmented access structures proposed by Simmons.

show abstract

Section: This Work Performedmentioning

confidence: 99%

Some Ideal Secret Sharing Schemes

Brickell

Lecture Notes in Computer Science

286

331

View full text Add to dashboard Cite

show abstract

“…3. Alice employs a secret sharing scheme [8,9] to encode s into n shares, such that all n shares are required to reconstruct s. 4. Alice sends Bob one share via each cycle-free path.…”

Section: (A B) ∈ E(g))mentioning

confidence: 99%

“…It should be noted that δ nc represents only a portion of the total probability that the protocol will fail, δ; by necessity, δ δ nc . In the following section, we use equation (8) to estimate the minimum degree cut-off k min that should be imposed to constrain the probability of such failures to less than some allowed maximum δ nc .…”

Section: Network Topologiesmentioning

confidence: 99%

Distributed authentication for randomly compromised networks

2009

View full text Add to dashboard Cite

Abstract. We introduce a simple, practical approach with probabilistic information-theoretic security to solve one of quantum key distribution's major security weaknesses: the requirement of an authenticated classical channel to prevent man-in-the-middle attacks. Our scheme employs classical secret sharing and partially trusted intermediaries to provide arbitrarily high confidence in the security of the protocol. Although certain failures elude detection, we discuss preemptive strategies to reduce the probability of failure to an arbitrarily small level: the probability of such failures is exponentially suppressed with increases in connectivity (i.e. connections per node).

show abstract

“…), the Registration Server generates the EID i (encrypted value of the EPC i ) of the Tag i . In this paper, for encryption of the EID i , cryptographic secret sharing methods are adopted [3,4,9,13,18,26,27]. Fig.…”

Section: Proposed Mclt Systemmentioning

confidence: 99%

“…Therefore, only authorized administrators can identify the MID i of the tag i . If X = {Adm 1 , Adm 2 , · · · , Adm t } is a qualified subset to recover the MID i , the recovery phase is operated as follows; ① Through the cooperation of every Adm i ∈ X, the value r 1 + r 2 + · · · + r t modp is recovered using polynomial interpolation [26]. ② Each Adm i ∈ X computes (g ti ) r1 + r2 + ··· + rt using a stored g ti .…”

Section: Fig 8 Missing Child Location Trackingmentioning

confidence: 99%

An RFID System Based MCLT System with Improved Privacy

Kwak

Rhee

Park

et al. 2006

Emerging Directions in Embedded and Ubiquitous Computing

View full text Add to dashboard Cite

Abstract. Radio Frequency Identification (RFID) systems are increasingly becoming accepted for many EPC Network applications. However, RFID systems have some privacy problems. In this paper, a system for missing child location tracking in the EPC Network applications, is proposed. The proposed system improves security and privacy compared to existing applications, while also keeping in line with traditional procedures, commonly accepted by most industrial applications. The proposed MCLT (Missing Child Location Tracking) system can protect users' privacy while providing location tracking of the RFID tag.

show abstract

How to share a secret

Cited by 10,838 publications

References 1 publication

Some Ideal Secret Sharing Schemes

Some Ideal Secret Sharing Schemes

Distributed authentication for randomly compromised networks

An RFID System Based MCLT System with Improved Privacy

Contact Info

Product

Resources

About