Sciweavers

89 search results - page 18 / 18
» Minimizing the use of random oracles in authenticated encryp...
Sort
View
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
14 years 6 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
ALGOSENSORS
2010
Springer
13 years 4 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...
DRM
2003
Springer
13 years 11 months ago
Breaking and repairing optimistic fair exchange from PODC 2003
In PODC 2003, Park, Chong, Siegel and Ray [22] proposed an optimistic protocol for fair exchange, based on RSA signatures. We show that their protocol is totally breakable already...
Yevgeniy Dodis, Leonid Reyzin
MOBIHOC
2009
ACM
14 years 6 months ago
Optimal monitoring in multi-channel multi-radio wireless mesh networks
Wireless mesh networks (WMN) are finding increasing usage in city-wide deployments for providing network connectivity. Mesh routers in WMNs typically use multiple wireless channel...
Dong-Hoon Shin, Saurabh Bagchi