2304 search results - page 112 / 461 » On the Vulnerability of Large Graphs |
164
click to vote
DMIN
2006
15 years 7 months ago
2006
Data mining, with its promise to extract valuable, previously unknown and potentially useful patterns or knowledge from large data sets that contain private information is vulnerab...
149
click to vote
AAECC
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We investigate the security of a variant of the RSA public-key cryptosystem called LSBS-RSA, in which the modulus primes share a large number of least-significant bits.We...
171
click to vote
IACR
2011
14 years 5 months ago
2011
The McEliece cryptosystem is one of the few systems to be considered secure against attacks by Quantum computers. The original scheme is built upon Goppa codes and produces very l...
167
Voted
WAW
2007
Springer
16 years 6 days ago
2007
Springer
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...
160
click to vote
WAW
2004
Springer
15 years 11 months ago
2004
Springer
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...