Results 181 to 190 of about 578 (210)
Some of the next articles are maybe not open access.
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
1995
We propose a new construction for computationally secure secret sharing schemes with general access structures where all shares are as short as the secret. Our scheme provides the capability to share multiple secrets and to dynamically add participants on-line, without having to re-distribute new shares secretly to the current participants.
openaire +1 more source
We propose a new construction for computationally secure secret sharing schemes with general access structures where all shares are as short as the secret. Our scheme provides the capability to share multiple secrets and to dynamically add participants on-line, without having to re-distribute new shares secretly to the current participants.
openaire +1 more source
Linear Secret Sharing with Divisible Shares
1999Shamir secret sharing is being considered in the broader context of linear secret sharing. It is shown that any Shamir scheme built over GF(q v ) can be converted into its linear equivalent defined over GF(q). A notion of uniform perfectness is introduced and it is proved that Shamir schemes built over GF(q v ) are not uniformly perfect.
openaire +1 more source
LoRa-LiSK: A Lightweight Shared Secret Key Generation Scheme for LoRa Networks
IEEE Internet of Things Journal, 2022Julie A Mccann +2 more
exaly
Generalized quantum teleportation of shared quantum secret: a coined quantum-walk approach
Quantum Information Processing, 2022Xiu-Bo Chen
exaly
High-Rate Uncorrelated Bit Extraction for Shared Secret Key Generation from Channel Measurements
IEEE Transactions on Mobile Computing, 2010Neal Patwari, Sneha K Kasera
exaly
On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing
2022Divesh Aggarwal +3 more
openaire +3 more sources

