Sciweavers

204 search results - page 30 / 41
» Probabilistic Attributed Hashing
Sort
View
NCA
2005
IEEE
14 years 3 months ago
Decentralized Schemes for Size Estimation in Large and Dynamic Groups
Large-scale and dynamically changing distributed systems such as the Grid, peer-to-peer overlays, etc., need to collect several kinds of global statistics in a decentralized manne...
Dionysios Kostoulas, Dimitrios Psaltoulis, Indrani...
PKC
1998
Springer
107views Cryptology» more  PKC 1998»
14 years 2 months ago
On the Security of ElGamal Based Encryption
The ElGamal encryption scheme has been proposed several years ago and is one of the few probabilistic encryption schemes. However, its security has never been concretely proven bas...
Yiannis Tsiounis, Moti Yung
CRYPTO
2006
Springer
125views Cryptology» more  CRYPTO 2006»
14 years 1 months ago
Automated Security Proofs with Sequences of Games
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
Bruno Blanchet, David Pointcheval
TKDE
2008
178views more  TKDE 2008»
13 years 9 months ago
Efficient Similarity Search over Future Stream Time Series
With the advance of hardware and communication technologies, stream time series is gaining ever-increasing attention due to its importance in many applications such as financial da...
Xiang Lian, Lei Chen 0002
MOC
2002
131views more  MOC 2002»
13 years 9 months ago
Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
Douglas R. Stinson