118 search results - page 3 / 24 » Ideal Secret Sharing Schemes from Permutations |
STOC
2000
ACM
13 years 11 months ago
2000
ACM
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
ACISP
2000
Springer
13 years 11 months ago
2000
Springer
Anderson and Kuhn have proposed the EEPROM modification attack to recover the secret key stored in the EEPROM. At ACISP'98, Fung and Gray proposed an −m permutation protecti...
SCN
2008
Springer
13 years 7 months ago
2008
Springer
In this work we study linear secret sharing schemes for s-t connectivity in directed graphs. In such schemes the parties are edges of a complete directed graph, and a set of partie...
JDCTA
2010
13 years 2 months ago
2010
In visual cryptography, the secret can be any written text, graphical representation, or picture. This technique, some time called visual secret sharing (VSS), allows visual infor...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
: In the paper we propose general framework for Automatic Secret Generation and Sharing (ASGS) that should be independent of underlying secret sharing scheme. ASGS allows to preven...