Results 1  10
of
882
SecretSharing Schemes: A Survey
"... Abstract. A secretsharing scheme is a method by which a dealer distributes shares to parties such that only authorized subsets of parties can reconstruct the secret. Secretsharing schemes are important tools in cryptography and they are used as a building box in many secure protocols, e.g., genera ..."
Abstract

Cited by 25 (1 self)
 Add to MetaCart
will also present two results connecting secretsharing schemes for a Hamiltonian access structure to the NP vs. coNP problem and to a major open problem in cryptography – constructing oblivioustransfer protocols from oneway functions. 1
Random Key Predistribution Schemes for Sensor Networks”,
 IEEE Symposium on Security and Privacy,
, 2003
"... Abstract Efficient key distribution is the basis for providing secure communication, a necessary requirement for many emerging sensor network applications. Many applications require authentic and secret communication among neighboring sensor nodes. However, establishing keys for secure communicatio ..."
Abstract

Cited by 832 (12 self)
 Add to MetaCart
before deployment. In the field, neighboring nodes exchange information to find one common key within their random subset and use that key as their shared secret to secure subsequent communication. In this paper, we generalize the EschenauerGligor key distribution approach. First, we propose two new
MDS Codes, NMDS Codes and their SecretSharing Schemes
"... In this work, we consider some methods to generate secretsharing schemes from MDS and nearMDS codes. MDS (and NMDS) codes exhibit close connections with secretsharing schemes. These connections and respective construction methods are given in [5], [7]. We combine these methods with some recent re ..."
Abstract
 Add to MetaCart
results on MDS and NMDS codes ([4]), and in the aftermath we are able to construct secretsharing schemes for new parameters. Let Fq = GF (q) be a Galois field and F n q be an ndimensional vector space over Fq. A linear code of length n and rank k is a linear subspace C with dimension k of the vector
Secret Key Agreement by Public Discussion From Common Information
 IEEE Transactions on Information Theory
, 1993
"... . The problem of generating a shared secret key S by two parties knowing dependent random variables X and Y , respectively, but not sharing a secret key initially, is considered. An enemy who knows the random variable Z, jointly distributed with X and Y according to some probability distribution PX ..."
Abstract

Cited by 434 (18 self)
 Add to MetaCart
. The problem of generating a shared secret key S by two parties knowing dependent random variables X and Y , respectively, but not sharing a secret key initially, is considered. An enemy who knows the random variable Z, jointly distributed with X and Y according to some probability distribution
Latticebased thresholdchangeability for standard Shamir secretsharing schemes
 In Asiacrypt’04, volume 3329 of LNCS
, 2004
"... Abstract. We consider the problem of increasing the threshold parameter of a secretsharing scheme after the setup (share distribution) phase, without further communication between the dealer and the shareholders. Previous solutions to this problem require one to start off with a nonstandard scheme ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract. We consider the problem of increasing the threshold parameter of a secretsharing scheme after the setup (share distribution) phase, without further communication between the dealer and the shareholders. Previous solutions to this problem require one to start off with a non
Robust computational secret sharing and a unified account of classical secretsharing goals
 In Proc. of the 14th conference on Computer and communications security
, 2007
"... We give a unified account of classical secretsharing goals from a modern cryptographic vantage. Our treatment encompasses perfect, statistical, and computational secret sharing; static and dynamic adversaries; schemes with or without robustness; schemes where a participant recovers the secret and t ..."
Abstract

Cited by 21 (3 self)
 Add to MetaCart
We give a unified account of classical secretsharing goals from a modern cryptographic vantage. Our treatment encompasses perfect, statistical, and computational secret sharing; static and dynamic adversaries; schemes with or without robustness; schemes where a participant recovers the secret
Proofs of partial knowledge and simplified design of witness hiding protocols
, 1994
"... Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution to a given problem instance. Suppose also that we have a secret sharing scheme S on n participants. Then under certain assumptions on P and S, we show how to transform P into a witness indistinguishab ..."
Abstract

Cited by 335 (14 self)
 Add to MetaCart
Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution to a given problem instance. Suppose also that we have a secret sharing scheme S on n participants. Then under certain assumptions on P and S, we show how to transform P into a witness
A Study on the Average Information Ratio of Perfect SecretSharing Schemes for Access Structures Based on Bipartite Graphs
, 2012
"... A perfect secretsharing scheme is a method to distribute a secret among a set of participants in such a way that only qualified subsets of participants can recover the secret and the joint share of participants in any unqualified subset is statistically independent of the secret. The collection of ..."
Abstract
 Add to MetaCart
A perfect secretsharing scheme is a method to distribute a secret among a set of participants in such a way that only qualified subsets of participants can recover the secret and the joint share of participants in any unqualified subset is statistically independent of the secret. The collection
APS/123QED Cryptanalysis of the HilleryBuˇzekBerthiaume quantum secretsharing protocol
, 2008
"... The participant attack is the most serious threat for quantum secretsharing protocols. We present a method to analyze the security of quantum secretsharing protocols against this kind of attack taking the scheme of Hillery, Buˇzek, and Berthiaume (HBB) [Phys. Rev. A 59 1829 (1999)] as an example. ..."
Abstract
 Add to MetaCart
The participant attack is the most serious threat for quantum secretsharing protocols. We present a method to analyze the security of quantum secretsharing protocols against this kind of attack taking the scheme of Hillery, Buˇzek, and Berthiaume (HBB) [Phys. Rev. A 59 1829 (1999)] as an example
Experimental Quantum Cryptography
 Journal of Cryptology
, 1992
"... We describe results from an apparatus and protocol designed to implement quantum key distribution, by which two users, who share no secret information initially: 1) exchange a random quantum transmission, consisting of very faint flashes of polarized light; 2) by subsequent public discussion of the ..."
Abstract

Cited by 266 (20 self)
 Add to MetaCart
We describe results from an apparatus and protocol designed to implement quantum key distribution, by which two users, who share no secret information initially: 1) exchange a random quantum transmission, consisting of very faint flashes of polarized light; 2) by subsequent public discussion
Results 1  10
of
882