Sciweavers

10916 search results - page 368 / 2184
» On Constructive Connectives and Systems
Sort
View
EUROCRYPT
2009
Springer
16 years 8 months ago
Verifiable Random Functions from Identity-Based Key Encapsulation
We propose a methodology to construct verifiable random functions from a class of identity based key encapsulation mechanisms (IB-KEM) that we call VRF suitable. Informally, an IB-...
Michel Abdalla, Dario Catalano, Dario Fiore
INFOCOM
2007
IEEE
16 years 1 months ago
Routing, Anycast, and Multicast for Mesh and Sensor Networks
Abstract— This paper studies routing schemes and their distributed construction in limited wireless networks, such as sensor or mesh networks. We argue that the connectivity of s...
Roland Flury, Roger Wattenhofer
IPPS
2007
IEEE
16 years 1 months ago
Topology-Transparent Duty Cycling for Wireless Sensor Networks
Our goal is to save energy in wireless sensor networks (WSNs) by periodic duty-cycling of sensor nodes. We schedule sensor nodes between active (transmit or receive) and sleep mod...
Yu Chen, Eric Fleury, Violet R. Syrotiuk
ICDCS
2005
IEEE
16 years 1 months ago
Supporting Live Development of SOAP and CORBA Servers
We present middleware for a Server Development Environment that facilitates live development of SOAP and CORBA servers. As the underlying implementation platform, we use JPie, a t...
Sajeeva L. Pallemulle, Kenneth J. Goldman, Brandon...
ACNS
2006
Springer
86views Cryptology» more  ACNS 2006»
15 years 11 months ago
Efficient Memory Bound Puzzles Using Pattern Databases
CPU bound client puzzles have been suggested as a defense mechanism against connection depletion attacks. However, the wide disparity in CPU speeds prevents such puzzles from being...
Sujata Doshi, Fabian Monrose, Aviel D. Rubin