Hardness Amplification Proofs Require Majority
نویسندگان
چکیده
منابع مشابه
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 which the server proves that it (still) possesses the client’s data. Constructions of PoR schemes attempt to minimize the client and server storage, the communication complexity of an audit, and even the number of file-bl...
متن کاملLecture 3: Hardness Amplification
Remark 1. One may wonder why Impagliazzo’s hard core lemma (see the previous lecture for the lemma statement) is not enough to get a 12 −2 −δn-hard function starting with a 2−δn-hard function. The difficulty lies in the fact that the hard core lemma only tells about the existence of a hard core set such that on that set f is 1 2 − 2 −δn -hard. We do not know how to sample from that hard core se...
متن کاملExtractors Using Hardness Amplification
Zimand [24] presented simple constructions of locally computable strong extractors whose analysis relies on the direct product theorem for one-way functions and on the Blum-Micali-Yao generator. For N -bit sources of entropy γN , his extractor has seed O(logN) and extracts N random bits. We show that his construction can be analyzed based solely on the direct product theorem for general functio...
متن کاملSecurity Preserving Amplification of Hardness
We consider the task of transforming a weak one-way function (which may be easily inverted on all but a polynomial fraction of the range) into a strong one-way function (which can be easily inverted only on a negligible fraction of the range). The previous known transformation [Yao 82] does not preserve the security (i.e., the running-time of the inverting algorithm) within any polynomial. Its ...
متن کاملDeterministic Hardness Amplification via Local GMD Decoding
We study the average-case hardness of the class NP against deterministic polynomial time algorithms. We prove that there exists some constant μ > 0 such that if there is some language in NP for which no deterministic polynomial time algorithm can decide L correctly on a 1 − (log n)−μ fraction of inputs of length n, then there is a language L′ in NP for which no deterministic polynomial time alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2010
ISSN: 0097-5397,1095-7111
DOI: 10.1137/080735096