152 search results - page 27 / 31 » Constructive Proofs of Concentration Bounds |
163
click to vote
IACR
2011
14 years 5 months ago
2011
Abstract. Sponge functions were introduced by Bertoni et al. as an alternative to the classical MerkleDamg˚ard design. Many hash function submissions to the SHA-3 competition laun...
177
click to vote
COCO
2009
Springer
16 years 10 days ago
2009
Springer
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
158
click to vote
ACSC
2008
IEEE
16 years 8 days ago
2008
IEEE
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
166
click to vote
MOBICOM
2005
ACM
15 years 11 months ago
2005
ACM
In this paper we investigate the benefits of a heterogeneous architecture for wireless sensor networks composed of a few resource rich mobile nodes and a large number of simple s...
164
click to vote
OPODIS
2003
15 years 7 months ago
2003
The Rendezvous of anonymous mobile agents in a anonymous network is an intensively studied problem; it calls for k anonymous, mobile agents to gather in the same site. We study thi...