Sciweavers

225 search results - page 14 / 45
» Nonperfect Secret Sharing Schemes
Sort
View
AINA
2004
IEEE
13 years 11 months ago
Secret Sharing with Access Structures in a Hierarchy
2004, Chang et al. suggested an approach that solves the problem of secret sharing with access structures in a hierarchy. They used the concept of discrete logarithmto reuse shado...
Chin-Chen Chang, Chu-Hsing Lin, Wei Lee, Pai-Cheng...
FOCS
2007
IEEE
14 years 1 months ago
Intrusion-Resilient Secret Sharing
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...
Stefan Dziembowski, Krzysztof Pietrzak
JCM
2008
74views more  JCM 2008»
13 years 7 months ago
Publicly Verifiable Secret Sharing Member-join Protocol For Threshold Signatures
Publicly verifiable secret sharing (PVSS) allows not only shareholders themselves but also everyone verify the shares of a secret distributed by a dealer. It has a lot of electroni...
Jia Yu, Fanyu Kong, Rong Hao, Xuliang Li, Guowen L...
TCC
2009
Springer
151views Cryptology» more  TCC 2009»
14 years 8 months ago
Secret Sharing and Non-Shannon Information Inequalities
The known secret-sharing schemes for most access structures are not efficient; even for a one-bit secret the length of the shares in the schemes is 2O(n) , where n is the number of...
Amos Beimel, Ilan Orlov
PKC
2005
Springer
93views Cryptology» more  PKC 2005»
14 years 26 days ago
Optimizing Robustness While Generating Shared Secret Safe Primes
We develop a method for generating shared, secret, safe primes applicable to use in threshold RSA signature schemes such as the one developed by Shoup. We would like a scheme usabl...
Emil Ong, John Kubiatowicz