Sciweavers

346 search results - page 57 / 70
» The Secret Santa Problem
Sort
View
CRYPTO
2010
Springer
201views Cryptology» more  CRYPTO 2010»
13 years 11 months ago
Protecting Cryptographic Keys against Continual Leakage
Side-channel attacks have often proven to have a devastating effect on the security of cryptographic schemes. In this paper, we address the problem of storing cryptographic keys a...
Ali Juma, Yevgeniy Vahlis
CN
2004
163views more  CN 2004»
13 years 9 months ago
Highly reliable trust establishment scheme in ad hoc networks
Securing ad hoc networks in a fully self-organized way is effective and light-weight, but fails to accomplish trust initialization in many trust deficient scenarios. To overcome t...
Kui Ren, Tieyan Li, Zhiguo Wan, Feng Bao, Robert H...
PVLDB
2008
132views more  PVLDB 2008»
13 years 9 months ago
Access control over uncertain data
Access control is the problem of regulating access to secret information based on certain context information. In traditional applications, context information is known exactly, p...
Vibhor Rastogi, Dan Suciu, Evan Welbourne
ASIACRYPT
2010
Springer
13 years 7 months ago
Constant-Size Commitments to Polynomials and Their Applications
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...
Aniket Kate, Gregory M. Zaverucha, Ian Goldberg
TIT
2011
125views more  TIT 2011»
13 years 4 months ago
Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption
Abstract. In 1998, Blaze, Bleumer, and Strauss proposed a cryptographic primitive called proxy re-encryption, in which a proxy transforms – without seeing the corresponding plain...
Benoît Libert, Damien Vergnaud