Sciweavers

5324 search results - page 822 / 1065
» Internet Security Protocols
Sort
View
INFOCOM
2011
IEEE
13 years 2 months ago
Approximate distance queries and compact routing in sparse graphs
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
Rachit Agarwal, Philip Brighten Godfrey, Sariel Ha...
COCO
2007
Springer
88views Algorithms» more  COCO 2007»
14 years 4 months ago
A New Interactive Hashing Theorem
Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO ’92), plays an important role in many cryptographic protocols. In particular, it is a major compo...
Iftach Haitner, Omer Reingold
ICNP
2006
IEEE
14 years 4 months ago
TrueLink: A Practical Countermeasure to the Wormhole Attack in Wireless Networks
— In a wormhole attack, wireless transmissions are recorded at one location and replayed at another, creating a virtual link under attacker control. Proposed countermeasures to t...
Jakob Eriksson, Srikanth V. Krishnamurthy, Michali...
SENSYS
2006
ACM
14 years 4 months ago
Interest dissemination with directional antennas for wireless sensor networks with mobile sinks
Introducing mobile data sinks into wireless sensor networks (WSNs) improves the energy efficiency and the network lifetime, and is demanded for many application scenarios, such a...
Yihong Wu, Lin Zhang, Yiqun Wu, Zhisheng Niu
APPROX
2004
Springer
121views Algorithms» more  APPROX 2004»
14 years 4 months ago
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
Andris Ambainis, Adam Smith