Secret sharing - Open Access .click

Results 281 to 290 of about 20,623 (302)

Some of the next articles are maybe not open access.

Multiple Secrets Sharing with Meaningful Shares

2011
Traditional 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

Linear Secret Sharing with Divisible Shares

1999
Shamir 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

A Survey on Perfectly Secure Verifiable Secret-sharing

ACM Computing Surveys, 2022
Anirudh Chandramouli, Ashish Choudhury, Arpita Patra +2 more
exaly

Strong (n,t,n) verifiable secret sharing scheme

Information Sciences, 2010
Changlu Lin
exaly

Two secret sharing schemes based on Boolean operations

Pattern Recognition, 2007
Daoshun Wang
exaly

On the classification of ideal secret sharing schemes

Journal of Cryptology, 1991
Ernest F Brickell
exaly

Counting-based secret sharing technique for multimedia applications

Multimedia Tools and Applications, 2017
Adnan Gutub, Esam Khan, Gutub Adnan
exaly

Efficient multi-secret image sharing based on Boolean operations

Signal Processing, 2011
Tzung-Her Chen
exaly