Ari Juels Marcus Peinado August 22, 1996  Home/Search
Context Related
| berkeley.edu/techreport...CSD96912.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: berkeley.edu/accessP...CSD96912 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We demonstrate in this paper a very simple method for "hiding" large cliques in random graphs. While the largest clique in a random graph is very likely to be of size about 2 log 2 n, it is widely conjectured that no polynomial-time algorithm exists which finds a clique of size (1 + ffl) log 2 n with significant probability for any constant ffl ? 0. We show that if this conjecture is true, then when a clique of size at most (2 \Gamma ffi ) log 2 n for constant ffi ? 0 is randomly inserted... (Update)
Context of citations to this paper: More
.... 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...
Cited by: More
Efficient Coloring of a Large Spectrum of Graphs - Kirovski, Potkonjak (1998) (Correct)
Similar documents (at the sentence level):
33.3%: Hiding Cliques for Cryptographic Security - Juels, Peinado (1998) (Correct)
Active bibliography (related documents): More All
0.0: Hard Graphs for Randomized Subgraph Exclusion Algorithms - Peinado (1994) (Correct)
0.0: The Power of Two Choices in Randomized Load Balancing - Mitzenmacher (1996) (Correct)
0.0: Approximately Counting Cliques - Lars Eilstrup Rasmussen (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
Juels, A., Peinado M. Hidden cliques as cryptographic keys. Technical report, UC Berkeley, 1996. http://citeseer.ist.psu.edu/juels96hidden.html More
@techreport{ juels96hidden,
author = "Ari Juels and Marcus Peinado",
title = "Hidden Cliques as Cryptographic Keys",
number = "CSD-96-912",
pages = "8",
year = "1996",
url = "citeseer.ist.psu.edu/juels96hidden.html" }
Citations (may not include all citations):283 Random Graphs (context) - Bollob'as - 1985
32 Large cliques elude the Metropolis process (context) - Jerrum - 1992
31 Testing of the long code and hardness for clique (context) - Hastad - 1996
30 Probabilistic analysis of some combinatorial search problems (context) - Karp - 1976
15 and Paul Erdos (context) - Alon, Spencer - 1992
1 Approximation Algorithms for Maxclique and Maxcut and their .. (context) - Peinado - 1995
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