Sciweavers

78 search results - page 10 / 16
» Long-Lived Broadcast Encryption
Sort
View
CRYPTO
2004
Springer
97views Cryptology» more  CRYPTO 2004»
13 years 11 months ago
Efficient Tree-Based Revocation in Groups of Low-State Devices
Abstract. We study the problem of broadcasting confidential information to a collection of n devices while providing the ability to revoke an arbitrary subset of those devices (and...
Michael T. Goodrich, Jonathan Z. Sun, Roberto Tama...
ALGOSENSORS
2010
Springer
13 years 6 months ago
From Key Predistribution to Key Redistribution
One of crucial disadvantages of key predistribution schemes for ad hoc networks is that if devices A and B use a shared key K to determine their session keys, then any adversarial...
Jacek Cichon, Zbigniew Golebiewski, Miroslaw Kutyl...
PIMRC
2008
IEEE
14 years 2 months ago
A key loss recovery scheme for secure broadcasts in wireless sensor networks
Abstract—Authenticity and secrecy of broadcast message content is important in wireless sensor networks deployed for battlefield control, emergency response, and natural resourc...
Syed Taha Ali, Vijay Sivaraman, Ashay Dhamdhere, D...
ASIACRYPT
2008
Springer
13 years 9 months ago
Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
Recently Cash, Kiltz, and Shoup [20] showed a variant of the Cramer-Shoup (CS) public key encryption (PKE) scheme [21] whose chosen-ciphertext (CCA) security relies on the computa...
Goichiro Hanaoka, Kaoru Kurosawa
FC
2010
Springer
196views Cryptology» more  FC 2010»
13 years 11 months ago
Modulo Reduction for Paillier Encryptions and Application to Secure Statistical Analysis
Abstract. For the homomorphic Paillier cryptosystem we construct a protocol for secure modulo reduction, that on input of an encryption x with x of bit length x and a public ‘mod...
Jorge Guajardo, Bart Mennink, Berry Schoenmakers