Sciweavers

391 search results - page 16 / 79
» On-Line Secret Sharing
Sort
View
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
SACRYPT
2004
Springer
14 years 1 months ago
On Proactive Secret Sharing Schemes
Abstract. This paper investigates the security of Proactive Secret Sharing Schemes. We start with revision of the mobile adversary model of Herzberg’s et al. imposing less restri...
Ventzislav Nikov, Svetla Nikova
ISADS
1999
IEEE
13 years 12 months ago
A Secure Key Registration System based on Proactive Secret-Sharing Scheme
We designed a secure key registration system based on the proactive secret-sharing scheme. A user can register important data such as a session key to a distributed system in a (t...
Masayuki Numao
AINA
2005
IEEE
14 years 1 months ago
Efficient 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...
Chu-Hsing Lin, Wei Lee
SPW
1997
Springer
13 years 11 months ago
On Ideal Non-perfect Secret Sharing Schemes
Abstract. This paper first extends the result of Blakley and Kabatianski [3] to general non-perfect SSS using information-theoretic arguments. Furthermore, we refine Okada and Ku...
Pascal Paillier