On the compressibility of n p instances and cryptographic applications

SIAM Journal on Computing

Volumn 39, Issue 5, 2010, Pages 1667-1713

  Harnik, Danny ^a   Naor, Moni ^b  

^a IBM HAIFA RESEARCH LAB   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Bounded storage model; Collision resistant hash; Compression; Cryptography; NP problems; Witness length

Indexed keywords

BOUNDED STORAGE MODEL; COLLISION RESISTANT HASH; COLLISION-RESISTANT HASH FUNCTIONS; COMPLEXITY THEORY; CRYPTOGRAPHIC APPLICATIONS; DECISION PROBLEMS; HASH COMPRESSION; KEY AGREEMENT PROTOCOL; NP PROBLEMS; ONE-WAY FUNCTIONS;

COMPRESSIBILITY; COMPUTATIONAL COMPLEXITY;

HASH FUNCTIONS;

EID: 77049090296     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/060668092     Document Type: Article

References (83)

1. S. AARONSON, NP-complete problems and physical reality, SIGACT News, 36 (2005), pp. 30-52.
2. N. ALON, R. YUSTER, AND U. ZwiCK, Color-coding, J. ACM, 42 (1995), pp. 844-856.
3. Y. Aumann, Y.Z. Ding, and M.O. Rabin, Everlasting security in the bounded storage model, IEEE Trans. Inform. Theory, 48 (2002), pp. 1668-1680.
4. Y. AUMANN AND M.O. Rabin, Information theoretically secure communication in the limited storage space model, in Advances in Cryptology-CRYPTO '99, Lecture Notes in Comput. Sci. 1666, Springer, New York, 1999, pp. 65-79.
5. B. BARAK, How to go beyond the black-box simulation barrier, in Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, 2001, pp. 106-115.
6. M. BELLARE, A. BOLDyREvA, AND A. PALACIO, An uninsta ntiable random-oracle-model scheme for a hybrid-encryption problem, in Advances in Cryptology - EUROCRYPT '2004, Lecture Notes in Comput. Sci. 3027, 2004, Springer, New York, pp. 171-188.
7. S. Ben-David, B. Chor, O. Goldreich, AND M. Luby, On the theory of average case complexity, J. Comput. System Sci., 44 (1992), pp. 193-219.
8. J. Buss AND T. Islam, Simplifying the weft hierarchy, Theoret. Comput. Sci., 351 (2006), pp. 303-313.
9. C. Cachin AND U. MAURER, Unconditional security against memory-bound adversaries, in Advances in Cryptology - CRYPTO '97, Lecture Notes in Comput. Sci. 1294, Springer, New York, 1997, pp. 292-306.
10. L. Cai AND J. Chen, On the amount of nondeterminism and the power of verifying, SIAM J. Comput., 26 (1997), pp. 733-750.
11. R. Canetti, O. Goldreich, AND S. HALEVI, The random oracle methodology, revisited, J. ACM, 51 (2004), pp. 557-594.
12. J. Chen, B. Chor, M. Fellows, X. Huang, D. Juedes, I. Kanj, and G. Xia, Tight lower bounds for certain parameterized NP-hard problems, Inform. and Comput., 201 (2005), pp. 216-231.
13. J. Chen, I. Kanj, AND W. JIA, Vertex cover: Further observations and further improvements, J. Algorithms, 41 (2001), pp. 280-301.
14. Y. Chen AND M. MÜLLER, SAT is unlikely to be compressible, manuscript, 2007.
15. 2) steps, in WG 04, Lecture Notes in Comput. Sci. 3353, Springer-Verlag, New York, 2004, pp. 257-269.
16. S.A. Cook, The complexity of theorem-proving procedures, in Proceedings of the 3rd ACM Symposium on the Theory of Computing, 1971, pp. 1 51-158.
17. I. Damgård, A design principle for hash functions, in Advances in Cryptology - CRYPTO '89, Lecture Notes in Comput. Sci. 435, Springer, New York, 1989, pp. 416-427.
18. I. Damgård, T. PEDERSEN, AND B. PFITZMANN, On the existence of statistically hiding bit commitment schemes and fail-stop signatures, in Advances in Cryptology - CRYPTO '93, Lecture Notes in Comput. Sci. 773, Springer, New York, 1993, pp. 250-265.
19. H. DELL AND D. VAN MELKEBEEK, Satisfiability Allows No Nontrivial Sparsification Unless the Polynomial-time Hierarchy Collapses, manuscript.
20. G. DI CRESCENZO, T. MALKIN, AND R. OSTROVSKY, Single database private information retrieval implies oblivious transfer, in Advances in Cryptology - EUROCRYPT '2000, Lecture Notes in Comput. Sci. 1807, Springer, New York, 2000, pp. 122-138.
21. W. DIFFIE AND M.E. HELLMAN, New directions in cryptog raphy, IEEE Trans. Inform. Theory, 22 (1976), pp. 644-654.
22. Y.Z. DING AND M.O. RABIN, Hyper-encryption and everlasting security, in Annual Symposium on Theoretical Aspects ofComputer Science (STACS), Lecture Notes in Comput. Sci. 2285, Springer, New York, 2002, pp. 1-26.
23. I. Dinur, The PCP theorem by gap amplification, J. ACM, 54 (2007), article 12.
24. R. DowNEY and M. Fellows, Parameterized Complexity, Springer, New York, 1999.
25. R. Downey, M. Fellows, AND U. Stege, Parameterized complexity: A systematic method for confronting computational intractability, in Conte mporary Trends in Discrete Mathematics, AMS DIMACS Proc. Ser. 49, AMS, Providence, RI, 1999, pp. 49-100.
26. B. Dubrov AND Y. ISHAI, On the randomness complexity of efficient sampling, in Proceedings of the 38th ACM Symposium on the Theory of Computing, 2006, pp. 711-720.
27. C. Dwork, J. Lotspiech, AND M. Naor, Digital signets: Self-enforcing protection of digital information, in Proceedings of the 28th ACM Symposium on the Theory of Computing, 1996, pp. 489-498.
28. S. Dziembowski, On forward-secure storage, in Advances in Cryptology - CRYPTO '06, Lecture Notes in Comput. Sci. 4117, Springer, New York, 2006, pp. 251-270.
29. S. Dziembowski AND U. Maurer, On generating the initial key in the bounded-storage model, in Advances in Cryptology - EUROCRYPT 2004, Lecture Notes in Comput. Sci. 3027, Springer, New York, 2004, pp. 126-137.
30. S. Dziembowski AND U. Maurer, Optimal randomizer efficiency in the bounded-storage model, J. Cryptology, 17 (2004), pp. 5-26.
31. U. Feige, Relations between average case complexity and approximation complexity, in Proceedings of the 34th ACM Symposium on the Theory of Computing, 2002, pp. 534-543. (Pubitemid 35009414)
32. U. FEIGE AND J. KILIAN, On limited versus polynomial nondeterminism, Chicago J. Theoret. Comput. Sci., 1997 (1997), pp. 1-20.
33. M. FISCHLIN, On the impossibility of constructing non-interactive statistically-secret protocols from any trapdoor one-way function, in Topics in Cr yptology-CT-RSA 2002, The Cryptographer's Track at the RSA Conference, 2002, pp. 79-95.
34. J. Flum AND M. Grohe, Parameterized Compleixity Theory, Springer, New York, 2006.
35. 2 n nonde-terministic bits, in Proceedings of the 31st Internatio nal Colloquium on Automata, Languages and Programming (ICALP) 2004, Lecture Notes in Comput. Sci. 3142, Springer, New York, 2004, pp. 555-567.
36. L. FORTNOW AND R. SANTHANAM, Infeasibility of instance compression and succinct PCPs for NP, in Proceedings of the 40th ACM Symposium on the Theory of Computing, ACM, New York, 2008, pp. 133-142.
37. O. GOLDREICH, Foundations of Cryptography, Cambridge University Press, London, 2001.
38. O. GOLDREICH, Foundations of Cryptography - Volume 2, Cambridge University Press, London, 2004.
39. O. GoLDREICH, S. Micali, AND A. Wigderson, Proofs that yield nothing but their validity, or all languages in NP have zero-knowledge proof systems, J. ACM, 38 (1991), pp. 691-729.
40. J. Goldsmith, M. Levy, AND M. MUNDHENK, Limited nondeterminism, SIGACT News, 27 (1996), pp. 20-29.
41. S. Goldwasser AND Y. TAUMAN KALAI, On the (in) security of the Fiat-Shamir paradigm, in Proceedings of the 44th IEEE Symposium on Foundations of Computer Science, 2003, pp. 102-111.
42. I. HAITNER, J. HOCH, O. Reingold, AND G. Segev, Finding collisions in interactive protocols - a tight lower bound on the round complexity of statistically-hiding commitments, in Proceedings of the 48th IEEE Symposium on Foundations of Computer Science, 2007, pp. 669-679.
43. I. HAITNER, O. HoRVITZ, J. Katz, C. Koo, R. MoRSELLI, AND R. SHALTIEL, Reducing complexity assumptions for statistically-hiding commitment, in Advances in Cryptology - EURO-CRYPT '2005, Lecture Notes in Comput. Sci. 3494, Springer, New York, 2005, pp. 58-77.
44. I. HAITNER AND O. REINGOLD, Statistically-hiding commitment from any one-way function, in Proceedings of the 39th ACM Symposium on the Theory of Computing, 2007, pp. 1-10.
45. D. HARNIK AND M. Naor, On everlasting security in the hybrid bounded storage model, in Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP) 2006, Part II, Lecture Notes in Comput. Sci. 4052, Springer, New York, 2006, pp. 192-203.
46. D. HARNIK AND M. Naor, On the compressibility of NP instances and cryptographic applications, in Electron. Colloq. Comput. Complex., TR06-022, 2006.
47. J. HAsTAD, R. IMPAGLIAZZO, L.A. Levin, AND M. Luby, A pseudorandom generator from any one-way function, SIAM J. Comput., 29 (1999), pp. 1364-1396.
48. C. HSIAO AND L. REYZIN, Finding collisions on a public road, or do secure hash functions need secret coins?, in Advances in Cryptology - CRYPTO '04, Lecture in Notes Comput. Sci. 3152, Springer, New York, 2004, pp. 92-105.
49. R. IMPAGLIAZZO, A personal view of average-case complexity, in Proceedings of the 10th Annual Structure in Complexity Theory Conference, 1995, IEEE Computer Society Press, pp. 134-147.
50. R. IMPAGLIAZZO AND M. Luby, One-way functions are essential for complexity based cryptography, in Proceedings of the 30th IEEE Symposium o n Foundations of Computer Science, 1989, pp. 230-235.
51. R. IMPAGLIAZZO, R. PATURI, AND F. Zane, Which problems have strongly exponential complexity?, in Proceedings of the 39th IEEE Symposium on Foundations of Computer Science, 1998, pp. 653-663.
52. R. IMPAGLIAZZO AND S. RUDICH, Limits on the provable consequences of one-way permutations, in Proceedings of the 21st ACM Symposium on the Theory of Computing, 1989, pp. 44-61.
53. Y. Ishai, E. KusHiLEViTZ, AND R. Ostrovsky, Sufficient conditions for collision-resistant hashing, in 2nd Theory of Cryptography Conference (TCC '05), Lecture Notes in Comput. Sci. 3378, Springer, New York, 2005, pp. 445-456.
54. H. KAPLAN, R. Shamir, AND R. Tarjan, Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs, SIAM J. Comput., 28 (1999), pp. 1906-1922.
55. R. KARP, Reducibility among combinatorial problems, in Complexity of Computer Computations, R. Miller and J. Thatcher, eds., Plenum Press, New York, 1972, pp. 85-103.
56. R. KARP AND M. Rabin, Efficient randomized pattern-matching algorithms, IBM J. Res. Dev., 31 (1987), pp. 249-260.
57. J. KiLiAN, A note on efficient zero-knowledge proofs and arguments, in Proceedings of the 24th ACM Symposium on the Theory of Computing, 1992, pp. 723-732.
58. C. KiNTALA AND P. Fischer, Refining nondeterminism in relativized polynomial-time bounded computations, SIAM J. Comput., 9 (1980), pp. 46-53.
59. E. KusHiLEViTZ AND R. OsTROVsKY, Replication is not needed: Single database, computationally-private information retrieval, in Proceedings of the 38th IEEE Symposium on Foundations of Computer Science, 1997, pp. 364-373.
60. M. Li AND P. ViTANYi, An Introduction to Kolmogorov Complexity and Its Applications, 2nd ed., Springer, New York, 1997.
61. C. Lu, Encryption against space-bounded adversaries from on-line strong extractors, J.Cryptology, 17 (2004), pp. 27-42.
62. U. MAURER, Conditionally-perfect secrecy and a provably-secure randomized cipher, J. Cryptology, 5 (1992), pp. 53-66.
63. U. MAURER, Secret key agreement by public discussion, IEEE Trans. Inform. Theory, 39 (1993), pp. 733-742.
64. U. MAURER, R. Renner, AND C. Holenstein, Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology, in Proceedings of the 1st Theory of Cryptography Conference (TCC '04), Lecture Notes in Comput. Sci. 2951, Springer, New York, 2004, pp. 21-39.
65. S. MiCALi, CS proofs, in Proceedings of the 35th IEEE Symposium on Foundations of Computer Science, 1994, pp. 436-453.
66. J. NAOR AND M. Naor, Small-bias probability spaces: Efficient constructions and applications, SIAM J. Comput., 22 (1993), pp. 838-856.
67. M. NAOR, Bit commitment using pseudorandomness, J. Cryptology, 4 (1991), pp. 151-158.
68. M. NAOR, On cryptographic assumptions and challenges, in Advances in Cryptology - CRYPTO '03, Lecture Notes in Comput. Sci. 2729, Springer, New York, 2003, pp. 96-109.
69. M. Naor, R. Ostrovsky, R. VENKATESAN, AND M. Yung, Perfect zero-knowledge arguments for NP using any one-way permutation, J. Cryptology, 11 (1998), pp. 87-108.
70. M. Naor AND M. Yung, Universal one-way hash functions and their cryptographic applications, in Proceedings of the 21st ACM Symposium on the Theory of Computing, 1989, pp. 33-43.
71. M. Nguyen, S. Ong, AND S. VADHAN, Statistical zero-knowledge arguments for NP from any one-way function, in Proceedings of the 47th IEEE Symposium on Foundations of Computer Science, 2006, pp. 3-14.
72. R. NIEDERMEIER, Invitation to Fixed Parameter Algorithms, Oxford University Press, London, 2006.
73. J.B. NIELSEN, Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case, in Advances in Cryptology - CRYPTO '02, Lecture Notes in Comput. Sci. 2442, Springer, New York, 2002, pp. 111-126.
74. J.B. NIELSEN, On protocol security in the cryptographic model, BRICS Diss. Ser. DS-03-8, University of Aarhus, Denmark, 2003.
75. C. PAPADIMITRiou AND M. YANNAKAKIS, Optimization, approximation, and complexity classes, in Proceedings of the 20th ACM Symposium on the Theory of Computing, 1988, pp. 229-234.
76. C. PAPADIMITRiou AND M. YANNAKAKIS, On limited nondeterminism and the complexity of the V-C dimension, J. Comput. System Sci., 53 (1996), pp. 161-170.
77. D. Simon, Finding collisions on a one-way street: Can secure hash functions be based on general assumptions?, in Advances in Cryptology - EUROCRYPT 1998, Lecture Notes in Comput. Sci. 1403, Springer, New York, 1998, pp. 334-345.
78. L. TREVISAN, S. VADHAN, AND D. ZUCKERMAN, Compression of samplable sources, Comput. Complexity, 14 (2005), pp. 186-227.
79. S. VADHAN, Constructing locally computable extractors and cryptosystems in the bounded storage model, J. Cryptology, 17 (2004), pp. 43-77.
80. L. VALIANT AND V. VAZIRANI, NP is as easy as detecting unique solutions, Theoret. Comput. Sci., 47 (1986), pp. 85-93.
81. H. WEE, On pseudoentropy versus compressibility, in Pro ceedings of the IEEE Conference on Computational Complexity, 2004, pp. 29-41.
82. H. WEE, On obfuscating point functions, in Proceedings of the 37th ACM Symposium on Theory of Computing, 2005, pp. 523-532.
83. H. WEE, Finding pessiland, in Theory of Cryptography C onference (TCC '06), Lecture Notes in Comput. Sci. 3876, Springer, New York, 2006, pp. 429-442.