Sciweavers

41 search results - page 5 / 9
» A Secure and Optimally Efficient Multi-Authority Election Sc...
Sort
View
ASIACRYPT
1992
Springer
13 years 10 months ago
On the Power of Memory in the Design of Collision Resistant Hash Functions
Collision resistant hash functions are an important basic tool for cryptographic applications such as digital signature schemes and integrity protection based on "fingerprinti...
Bart Preneel, René Govaerts, Joos Vandewall...
MOBIHOC
2008
ACM
14 years 6 months ago
Self-monitoring for sensor networks
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
Dezun Dong, Yunhao Liu, Xiangke Liao
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
14 years 7 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
IEICET
2006
108views more  IEICET 2006»
13 years 6 months ago
Plaintext Simulatability
We propose a new security class, called plaintext-simulatability, defined over the public-key encryption schemes. The notion of plaintext simulatability (denoted PS) is similar to ...
Eiichiro Fujisaki
SP
2002
IEEE
140views Security Privacy» more  SP 2002»
13 years 6 months ago
Efficient Multicast Packet Authentication Using Signature Amortization
We describe a novel method for authenticating multicast packets that is robust against packet loss. Our main focus is to minimize the size of the communication overhead required t...
Jung Min Park, Edwin K. P. Chong, Howard Jay Siege...