On the compressibility of N P instances and cryptographic applications

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2006, Pages 719-728

  Harnik, Danny ^a   Naor, Moni ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; DECISION MAKING; NETWORK PROTOCOLS; PROBLEM SOLVING;

ALGORITHMIC BREAKTHROUGH; BLACK-BOX REDUCTIONS; MV DECISION PROBLEMS; W-REDUCTION;

COMPUTATIONAL COMPLEXITY;

EID: 38749087238     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.54     Document Type: Conference Paper

References (44)

1. S. Aaronson. NP-complete problems and physical reality. SIGACTNews, 36(1):30-52, 2005.
2. Y. Aumann, Y. Ding, and M. Rabin. Everlasting security in the bounded storage model. IEEE Transactions on Information Theory, 48(6):1668-1680, 2002.
3. B. Barak. How to go beyond the black-box simulation barrier. In 42nd FOCS, pages 106-115, 2001.
4. M. Bellare, A. Boldyreva, and A. Palacio. An uninstantiable random-oracle-model scheme for a hybrid-encryption problem. In EUROCRYPT ' 2004, LNCS, volume 3027, pages 171-188. Springer, 2004.
5. R. Canetti, O. Goldreich, and S. Halevi. The random oracle methodology, revisited. Journal of the ACM, 51(4):557-594, 2004.
6. S. Cook. The complexity of theorem-proving procedures. In 3rd STOC, pages 151-158, 1971.
7. I. Damgård. A design principle for hash functions. In CRYPTO '89, LNCS, volume 435, pages 416-421. Springer, 1989.
8. I. Damgård, T Pedersen, and B. Pfitzmann. On the existence of statistically hiding bit commitment schemes and fail-stop signatures. In CRYPTO '93, LNCS, volume 773, pages 250-265. Springer, 1993.
9. W. Diffie and M. Hellman. New directions in cryptography. IEEE Transaction on Information Theory, 22:644-654, 1976.
10. Y Ding and M. Rabin. Hyper-encryption and everlasting security. In STACS, LNCS, volume 2285, pages 1-26, 2002.
11. I. Dinur. The PCP theorem by gap amplification. In 38th STOC, pages 241-250, 2006.
12. R. Downey and M. Fellows. Parameterized Complexity. Springer-Verlag, 1999.
13. B. Dubrov and Y Ishai. On the randomness complexity of efficient sampling. In 38th STOC, pages 711-720, 2006.
14. C. Dwork, J. Lotspiech, and M. Naor. Digital signets: Self-enforcing protection of digital information. In 28th STOC, pages 489-498, 1996.
15. S. Dziembowski. On the forward-secure storage. To appear in CRYPTO, 2006.
16. S. Dziembowski and U. Maurer. On generating the initial key in the bounded-storage model. In EUROCRYPT ' 2004, LNCS, volume 3027, pages 126-137. Springer, 2004.
17. J. Goldsmith, M. Levy, and M. Mundhenk. Limited nondeterminism. SIGACT News, 27(2):20-29, 1996.
18. S. Goldwasser and Y. Tauman Kalai. On the (in)security of the Fiat-Shamir paradigm. In 44th FOCS, pages 102-111, 2003.
19. I. Haitner, O. Horvitz, J. Katz, C. Koo, R. Morselli, and R. Shaltiel. Reducing complexity assumptions for statistically-hiding commitment. In EUROCRYPT ' 2005, LNCS, volume 3494, pages 58-77. Springer, 2005.
20. D. Harnik and M. Naor. On everlasting security in the hybrid bounded storage model. In 33rd ICALP 2006, Part II, LNCS, volume 4052, pages 192-203. Springer, 2006.
21. D. Harnik and M. Naor. On the compressibility of NP instances and cryptographic applications. In ECCC, TR06-022, 2006.
22. J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM Journal of Computing, 29(4):1364-1396, 1999.
23. C. Hsiao and L. Reyzin. Finding collisions on a public road, or do secure hash functions need secret coins? In CRYPTO '04, LNCS, volume 3152, pages 92-105. Springer, 2004.
24. R. Impagliazzo. A personal view of average-case complexity. In 10th Annual Structure in Complexity Theory Conference, pages 134-147. IEEE Computer Society Press, 1995.
25. R. Impagliazzo, R. Paturi, and F. Zane. Which problems have strongly exponential complexity? In 39th FOCS, pages 653-663, 1998.
26. R. Impagliazzo and S. Rudich. Limits on the provable consequences of one-way permutations. In 21st STOC, pages 44-61, 1989.
27. Y. Ishai, E. Kushilevitz, and R. Ostrovsky:. Sufficient conditions for collision-resistant hashing. In TCC '05, volume 3378 of LNCS, pages 445-456, 2005.
28. J. Kilian. A note on efficient zero-knowledge proofs and arguments. In 24th STOC, pages 723-732, 1992.
29. C. Kintala and P. Fischer. Refining nondeterminism in relativized polynomial-time bounded computations. SIAM Journal of Computing, 9(1):46-53, 1980.
30. M. Li and P. Vitányi. An Introduction to Kolmogorov Complexity and Its Applications, 2nd Edition. Springer, 1997.
31. U. Maurer. Conditionally-perfect secrecy and a provablysecure randomized cipher. Journal of Cryptology, 5(1):53-66, 1992.
32. S. Micali. CS proofs. In 35th FOCS, pages 436-453, 1994.
33. M. Naor. Bit commitment using pseudorandomness. Journal of Cryptology, 4(2):151-158, 1991.
34. M. Naor. On cryptographic assumptions and challenges. In CRYPTO '03, LNCS, volume 2729, pages 96-109. Springer, 2003.
35. M. Naor, R. Ostrovsky, R. Venkatesan, and M. Yung. Perfect zero-knowledge arguments for NP using any one-way permutation. Journal of Cryptology, 11(2):87-108, 1998.
36. M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. In 21st STOC, pages 33-43, 1989.
37. J. Nielsen. Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case. In CRYPTO '02, LNCS, volume 2442, pages 111-126. Springer, 2002.
38. C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
39. C. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. In 20th STOC, pages 229-234, 1988.
40. C. Papadimitriou and M. Yannakakis. On limited nondeterminism and the complexity of the V-C dimension. JCSS, 53(2):161-170, 1996.
41. D. Simon. Finding collisions on a one-way street: Can secure hash functions be based on general assumptions? In EUROCRYPT ' 1998, LNCS, volume 1403, pages 334-345. Springer, 1998.
42. L. Trevisan, S. Vadhan, and D. Zuckerman. Compression of samplable sources. In IEEE Conference on Computational Complexity, pages 1-14, 2004.
43. H. Wee. On pseudoentropy versus compressibility. In IEEE Conference on Computational Complexity, pages 29-41, 2004.
44. H. Wee. On obfuscating point functions. In 37th STOC, pages 523-532, 2005.