Sciweavers

5 search results - page 1 / 1
» Verifiable Random Functions from Identity-Based Key Encapsul...
Sort
View
EUROCRYPT
2009
Springer
14 years 5 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
EUROCRYPT
2007
Springer
13 years 8 months ago
Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability
Abstract. We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short). Informally, an InstD-VRF is, in some sense, a verifiable random function [...
Yi Deng, Dongdai Lin
DCC
2010
IEEE
13 years 5 months ago
Efficient hybrid encryption from ID-based encryption
This paper deals with generic transformations from ID-based key encapsulation mechanisms (IBKEM) to hybrid public-key encryption (PKE). The best generic transformation known until...
Masayuki Abe, Yang Cui, Hideki Imai, Eike Kiltz
WINET
2010
199views more  WINET 2010»
13 years 3 months ago
Secure encrypted-data aggregation for wireless sensor networks
This paper proposes a secure encrypted-data aggregation scheme for wireless sensor networks. Our design for data aggregation eliminates redundant sensor readings without using encr...
Shih-I Huang, Shiuhpyng Shieh, J. D. Tygar
SENSYS
2003
ACM
13 years 10 months ago
SIA: secure information aggregation in sensor networks
Sensor networks promise viable solutions to many monitoring problems. However, the practical deployment of sensor networks faces many challenges imposed by real-world demands. Sen...
Bartosz Przydatek, Dawn Xiaodong Song, Adrian Perr...