225 search results - page 29 / 45 » Weakly-Private Secret Sharing Schemes |
CRYPTO
2005
Springer
14 years 1 months ago
2005
Springer
Secret-key agreement between two parties Alice and Bob, connected by an insecure channel, can be realized in an informationtheoretic sense if the parties share many independent pai...
CCS
2004
ACM
14 years 27 days ago
2004
ACM
Hidden credentials are useful in protecting sensitive resource requests, resources, policies, and credentials. We propose a significant performance improvement when implementing ...
ASIACRYPT
2010
Springer
13 years 5 months ago
2010
Springer
We introduce and formally define polynomial commitment schemes, and provide two efficient constructions. A polynomial commitment scheme allows a committer to commit to a polynomial...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
Secret sharing algorithms have been used for intrusion tolerance, which ensure the confidentiality, integrity and availability of critical information. However, dynamically changi...
EUC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Key pre-distribution schemes are a favored solution for establishing secure communication in sensor networks. Often viewed as the safest way to bootstrap trust, the main ...