Results 221 to 230 of about 12,447 (257)
Some of the next articles are maybe not open access.
On the Share Efficiency of Robust Secret Sharing and Secret Sharing with Cheating Detection
2013In a basic (t,n)-threshold secret sharing scheme the adversary is passive and the security goal is to ensure that unauthorized subsets do not learn any information about the secret. In this paper we consider the case that the corrupted parties submit incorrect shares and there are extra security goals with respect to incorrect shares.
Mahabir Prasad Jhanwar +1 more
openaire +1 more source
Computers and Graphics, 2002
Abstract In this paper, we propose a method such that a secret image is shared by n shadow images, and any r shadow images (r⩽n) of them can be used to restore the whole secret image. The size of each shadow image is smaller than the secret image in our method.
Chih-Ching Thien, Ja-Chen Lin
exaly +2 more sources
Abstract In this paper, we propose a method such that a secret image is shared by n shadow images, and any r shadow images (r⩽n) of them can be used to restore the whole secret image. The size of each shadow image is smaller than the secret image in our method.
Chih-Ching Thien, Ja-Chen Lin
exaly +2 more sources
Communications of the ACM, 1979
In this paper we show how to divide data D into n pieces in such a way that D is easily reconstructable from any k pieces, but even complete knowledge of k - 1 pieces reveals absolutely no information about D
openaire +2 more sources
In this paper we show how to divide data D into n pieces in such a way that D is easily reconstructable from any k pieces, but even complete knowledge of k - 1 pieces reveals absolutely no information about D
openaire +2 more sources
IEEE Transactions on Information Theory, 1983
Summary: A ``secret sharing system'' permits a secret to be shared among \(n\) trustees in such a way that any \(k\) of them can recover the secret, but any \(k-1\) have complete uncertainty about it. A linear coding scheme for secret sharing is exhibited which subsumes the polynomial interpolation method proposed by Shamir and can also be viewed as a ...
Ehud D. Karnin +2 more
openaire +1 more source
Summary: A ``secret sharing system'' permits a secret to be shared among \(n\) trustees in such a way that any \(k\) of them can recover the secret, but any \(k-1\) have complete uncertainty about it. A linear coding scheme for secret sharing is exhibited which subsumes the polynomial interpolation method proposed by Shamir and can also be viewed as a ...
Ehud D. Karnin +2 more
openaire +1 more source
2006 IEEE International Conference on Evolutionary Computation, 2006
The aim of the paper is to obtain a DNA secret sharing scheme for general access structure that plays an important role in cryptography. Our scheme involves two very simple DNA computing techniques known as mixing and DNA sequencing. The simplicity of these two techniques and the compact nature of DNA make the system easy to implement.
openaire +1 more source
The aim of the paper is to obtain a DNA secret sharing scheme for general access structure that plays an important role in cryptography. Our scheme involves two very simple DNA computing techniques known as mixing and DNA sequencing. The simplicity of these two techniques and the compact nature of DNA make the system easy to implement.
openaire +1 more source
On the Reconstruction of Shared Secrets
1996In this paper we consider the secret reconstruction problem in a secret sharing scheme. We emphasize that a shared secret should be reconstructed in a fair way. We propose and analyze several methods to achieve such a fair reconstruction of shared secrets.
He Jingmin, Ed Dawson
openaire +1 more source
On Secret Reconstruction in Secret Sharing Schemes
IEEE Transactions on Information Theory, 2008A secret sharing scheme typically requires secure communications in each of two distribution phases: (1) a dealer distributes shares to participants (share distribution phase); and later (2) the participants in some authorised subset send their share information to a combiner (secret reconstruction phase).
Huaxiong Wang, Duncan S. Wong
openaire +1 more source
2015
Motivated by the goal of securely searching and updating distributed data, we introduce and study the notion of function secret sharing (FSS). This new notion is a natural generalization of distributed point functions (DPF), a primitive that was recently introduced by Gilboa and Ishai (Eurocrypt 2014). Given a positive integer \(p\ge 2\) and a class \(\
Elette Boyle, Niv Gilboa, Yuval Ishai
openaire +1 more source
Motivated by the goal of securely searching and updating distributed data, we introduce and study the notion of function secret sharing (FSS). This new notion is a natural generalization of distributed point functions (DPF), a primitive that was recently introduced by Gilboa and Ishai (Eurocrypt 2014). Given a positive integer \(p\ge 2\) and a class \(\
Elette Boyle, Niv Gilboa, Yuval Ishai
openaire +1 more source
Multiple Secrets Sharing with Meaningful Shares
2011Traditional Visual Cryptography method produces random shares which is susceptible to attackers. Some methods have been proposed to generate innocent-looking shares so that attacker cannot get doubtful by looking at the random pattern of the share. They look like a valid image and the adversary cannot judge whether it is a secret share or not.
Jaya, Anjali Sardana
openaire +1 more source