Hiding Cliques for Cryptographic Security

Designs, Codes, and Cryptography

Volumn 20, Issue 3, 2000, Pages 269-280

  Juels, Ari ^a,c   Peinado, Marcus ^b,d,e  

^a RSA   (United States)

^b MICROSOFT   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d FRAUNHOFER INSTITUTE FOR APPLIED INFORMATION TECHNOLOGY FIT   (Germany)

^e INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

Author keywords

Cliques; Graph based crypto systems; Random graphs

Indexed keywords

EID: 0038501444     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008374125234     Document Type: Article

References (33)

1. N. Alon, M. Krivelevich, and B. Sudakov, Finding a large hidden clique in a random graph, Proc. of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (1998).
2. N. Alon and J. Spencer, The Probabilistic Method, Wiley (1992).
3. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and hardness of approximation problems, Proceedings 33rd IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society, Los Angeles, CA, (1992) pp. 14-23.
4. S. Arora and S. Safra, Approximating clique is NP-complete, Proceedings 33rd IEEE Symposium on the Foundations of Computer Science (1992).
5. M. Bellare, O. Goldreich, and M. Sudan, Free bits, PCPs and non-approximability - towards tight results. Proceedings of the 36th Annual Symposium on Foundations of Computer Science (1995) pp. 422-431.
6. M. Bellare, S. Goldwasser, C. Lund, and A. Russel, Efficient probabilistically checkable proofs and applications to approximation, Proceedings of the 25th Annual ACM Symposium on Theory of Computing (1993).
7. M. Bellare and M. Sudan, Improved non-approximability results, Proceedings of the 26th ACM Symposium on the Theory of Computing, ACM Press, Montreal (1994) pp. 184-193.
8. A. Blum and J. Spencer, Coloring random and semi-random k-colorable graphs, Journal of Algorithms, Vol. 19, No. 2 (1995) pp. 204-234.
9. B. Bollobás, Random Graphs, Academic Press (1985).
10. R. Boppana, Eigenvalues and graph bisection: An average-case analysis, Proceedings of the 28th Annual Symposium on Foundations of Computer Science (1987) pp. 280-285.
11. A. Z. Broder, A. M. Frieze, and E. Shamir, Finding hidden hamiltonian cycles, Proceedings of the 23rd Annual ACM Symposium on the Theory of Computing (1991) pp. 182-189.
12. T. Bui, S. Chaudhuri, T. Leighton, and M. Sipser, Graph bisection algorithms with good average-case behavior, Combinatorica, Vol. 6 (1986).
13. M. E. Dyer and A. Frieze, Fast algorithms for some random NP-hard problems, Journal of Algorithms, Vol. 10 (1989) pp. 451-489.
14. S. Goldwasser, S. Micali, and C. Rackoff, The knowledge complexity of interactive proof systems, Proceedings of the 17th Annual ACM Symposium on the Theory of Computing (1985) pp. 291-304.
15. O. Goldreich, S. Micali, and A. Wigderson, Proofs that yield nothing but their validity and a methodology of cryptographic protocol design, Proceedings of the 27th Annual Symposium on Foundations of Computer Science, IEEE (1986) pp. 174-187.
16. Y. Gurevich, Average case completeness, Journal of Computer and System Sciences, Vol. 42, No. 3 (1991) pp. 346-398.
17. Y. Gurevich and S. Shelah, Expected computation time for Hamiltonian path problem, SIAM Journal on Computing, Vol. 16, No. 3 (1987) pp. 486-502.
18. J. Håstad, Testing of the long code and hardness for clique, Proceedings of the 28th ACM Symposium on the Theory of Computing, ACM Press (1996) pp. 11-19.
19. 1-∈, Proceedings of the 37th Annual Symposium on Foundations of Computer Science (1996) pp. 627-636.
20. S. Homer and M. Peinado, Experiments with polynomial-time clique approximation algorithms on very large graphs, Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, American Mathematical Society (1996).
21. M. Jerrum, Large cliques elude the Metropolis process, Random Structures and Algorithms, Vol. 3, No. 4 (1992) pp. 347-360.
22. D. S. Johnson and M. Trick, editors, Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, American Mathematical Society (1996). DIMACS Series in Discrete Mathematics and Theoretical Computer Science.
23. A. Juels, Topics in Black-box Combinatorial Optimization. PhD thesis, University of California, Berkeley (1996).
24. R. M. Karp, Reducibility among combinatorial problems, Complexity of Computer Computations (R. E. Miller and J. W. Thatcher, eds.), Plenum Press (1972) pp. 85-103.
25. R. M. Karp, Probabilistic analysis of some combinatorial search problems, Algorithms and Complexity: New Directions and Recent Results (J. F. Traub, ed.), Academic Press (1976).
26. L. Kučera, A generalized encryption scheme based on random graphs, Graph-Theoretic Concepts in Computer Science, WG'91, Lecture Notes in Computer Science, Springer-Verlag, 570 (1991) pp. 180-186.
27. L. A. Levin, Average-case complete problems, SIAM Journal on Computing, Vol. 15 (1986) pp. 285-286.
28. M. Luby, Pseudorandomness and Cryptographic Applications, Princeton University Press (1996).
29. M. Peinado, Hard graphs for the randomized Boppana-Halldórsson algorithm for maxclique, Nordic Journal of Computing, Vol. 1 (1994) pp. 493-515. Preliminary version in Proceedings of the 4th Scandinavian Workshop on Algorithm Theory, Århus, Denmark, Springer-Verlag (1994) pp. 278-289.
30. M. Peinado, Hard graphs for the randomized Boppana-Halldórsson algorithm for maxclique, Nordic Journal of Computing, Vol. 1 (1994) pp. 493-515. Preliminary version in Proceedings of the 4th Scandinavian Workshop on Algorithm Theory, Århus, Denmark, Springer-Verlag (1994) pp. 278-289.
31. M. Peinado, Improved lower bounds for the randomized Boppana-Halldórsson algorithm for MAXCLIQUE, Proceedings of the First Annual Computing and Combinatorics Conference, Springer-Verlag (1995).
32. J. S. Turner, On the probable performance of heuristics for bandwidth minimization. SIAM Journal on Computing, Vol. 15, No. 2 (1986) pp. 561-580.
33. R. Venkatesan and L. Levin, Random instances of a graph coloring problem are hard, Proceedings of the 20th Annual ACM Symposium on the Theory of Computing (1988) pp. 217-222.