Sciweavers

36 search results - page 1 / 8
» Security Preserving Amplification of Hardness
Sort
View
FOCS
1990
IEEE
14 years 2 months ago
Security Preserving Amplification of Hardness
Oded Goldreich, Russell Impagliazzo, Leonid A. Lev...
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
14 years 11 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
TCC
2012
Springer
227views Cryptology» more  TCC 2012»
12 years 6 months ago
Hardness Preserving Constructions of Pseudorandom Functions
We show a hardness-preserving construction of a PRF from any length doubling PRG which improves upon known constructions whenever we can put a non-trivial upper bound q on the numb...
Abhishek Jain, Krzysztof Pietrzak, Aris Tentes
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
14 years 2 months ago
Privacy Amplification with Asymptotically Optimal Entropy Loss
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...
Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostr...
FOCS
2010
IEEE
13 years 8 months ago
Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
We construct the first general secure computation protocols that require no trusted infrastructure other than authenticated communication, and that satisfy a meaningful notion of s...
Ran Canetti, Huijia Lin, Rafael Pass