391 search results - page 20 / 79 » On-Line Secret Sharing |
CRYPTO
2009
Springer
13 years 11 months ago
2009
Springer
The round complexity of interactive protocols is one of their most important complexity measures. In this work we prove that existing lower bounds for the round complexity of VSS c...
IWDW
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we present a new method for sharing images between two parties exploiting homomorphic property of public key cryptosystem. With our method, we show that it is possib...
ASIACRYPT
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
TCC
2010
Springer
14 years 4 months ago
2010
Springer