Sciweavers

225 search results - page 19 / 45
» Weakly-Private Secret Sharing Schemes
Sort
View
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
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 29 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
UCS
2007
Springer
14 years 1 months ago
RFID Privacy Using Spatially Distributed Shared Secrets
Many of today’s proposed RFID privacy schemes rely on the encryption of tag IDs with user-chosen keys. However, password management quickly becomes a bottleneck in such proposals...
Marc Langheinrich, Remo Marti
TCC
2005
Springer
141views Cryptology» more  TCC 2005»
14 years 29 days ago
Characterizing Ideal Weighted Threshold Secret Sharing
Weighted threshold secret sharing was introduced by Shamir in his seminal work on secret sharing. In such settings, there is a set of users where each user is assigned a positive w...
Amos Beimel, Tamir Tassa, Enav Weinreb