Sciweavers

54 search results - page 7 / 11
» Efficient Protocols for Set Membership and Range Proofs
Sort
View
DAGSTUHL
2006
14 years 11 months ago
Taming Dynamic and Selfish Peers
This paper addresses two important challenges for current P2P systems, namely churn and selfishness. First, we report on a system [19] whose desirable properties (small peer degre...
Stefan Schmid, Fabian Kuhn, Thomas Moscibroda, Rog...
ADHOC
2004
118views more  ADHOC 2004»
14 years 9 months ago
A review of routing protocols for mobile ad hoc networks
The 1990s have seen a rapid growth of research interests in mobile ad hoc networking. The infrastructureless and the dynamic nature of these networks demands new set of networking...
Mehran Abolhasan, Tadeusz A. Wysocki, Eryk Dutkiew...
CRYPTO
2010
Springer
158views Cryptology» more  CRYPTO 2010»
14 years 11 months ago
Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography
Motivated by the question of basing cryptographic protocols on stateless tamper-proof hardware tokens, we revisit the question of unconditional two-prover zero-knowledge proofs fo...
Vipul Goyal, Yuval Ishai, Mohammad Mahmoody, Amit ...
ESORICS
2009
Springer
15 years 10 months ago
Data Structures with Unpredictable Timing
Abstract. A range of attacks on network components, such as algorithmic denial-of-service attacks and cryptanalysis via timing attacks, are enabled by data structures for which an ...
Darrell Bethea, Michael K. Reiter
CORR
2010
Springer
185views Education» more  CORR 2010»
14 years 9 months ago
Acdmcp: An adaptive and completely distributed multi-hop clustering protocol for wireless sensor networks
Clustering is a very popular network structuring technique which mainly addresses the issue of scalability in large scale Wireless Sensor Networks. Additionally, it has been shown...
Khalid Nawaz, Alejandro P. Buchmann