Sciweavers

37 search results - page 8 / 8
» Public-Key Cryptography from Different Assumptions
Sort
View
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
16 years 4 days 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
FOCS
2002
IEEE
15 years 4 months ago
On the (non)Universality of the One-Time Pad
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
Yevgeniy Dodis, Joel Spencer