Sciweavers

208 search results - page 25 / 42
» Variationally universal hashing
Sort
View
GLOBECOM
2007
IEEE
15 years 4 months ago
A Scalable Bloom Filter for Membership Queries
—Bloom filters allow membership queries over sets with allowable errors. It is widely used in databases, networks and distributed systems and it has great potential for distribut...
Kun Xie, Yinghua Min, Dafang Zhang, Jigang Wen, Ga...
INDOCRYPT
2004
Springer
15 years 3 months ago
The Security and Performance of the Galois/Counter Mode (GCM) of Operation
Abstract. The recently introduced Galois/Counter Mode (GCM) of operation for block ciphers provides both encryption and message authentication, using universal hashing based on mul...
David A. McGrew, John Viega
CCS
2001
ACM
15 years 2 months ago
The faithfulness of abstract protocol analysis: message authentication
hfulness of Abstract Protocol Analysis: Message Authentication∗ Joshua D. Guttman F. Javier Thayer Lenore D. Zuck December 18, 2002 Dolev and Yao initiated an approach to studyi...
Joshua D. Guttman, F. Javier Thayer, Lenore D. Zuc...
CN
2010
181views more  CN 2010»
14 years 9 months ago
Building a collaborative peer-to-peer wiki system on a structured overlay
The ever growing request for digital information raises the need for content distribution architectures providing high storage capacity, data availability and good performance. Wh...
Gérald Oster, Rubén Mondéjar,...
PLDI
2004
ACM
15 years 3 months ago
Parametric regular path queries
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
Yanhong A. Liu, Tom Rothamel, Fuxiang Yu, Scott D....