Juels, A., Peinado M. Hidden cliques as cryptographic keys. Technical report, UC Berkeley, 1996. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Efficient Coloring of a Large Spectrum of Graphs - Kirovski, Potkonjak (1998) (5 citations) (Correct)
.... such reduction of a hard problem onto another hard problem is not a good problem solving strategy especially when the reduction result is finding a maximum clique in a graph, a problem that has been suggested, due to its difficulty, to hide information in some cryptographic protocols [Jue96]. Coudert applied his algorithm on a large set of real life examples. However, he did not provide experimental results for most graph classes which correspond to difficult optimization problems. Complex problems, such as graph coloring, require extensive exploration of the problem solution space. ....
Juels, A., Peinado M. Hidden cliques as cryptographic keys. Technical report, UC Berkeley, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC