5 search results - page 1 / 1 » Verifiable Random Functions from Identity-Based Key Encapsul... |
110
Voted
EUROCRYPT
2009
Springer
16 years 1 months ago
2009
Springer
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-...
118
click to vote
EUROCRYPT
2007
Springer
15 years 4 months ago
2007
Springer
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 [...
121
Voted
DCC
2010
IEEE
15 years 27 days ago
2010
IEEE
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...
112
Voted
WINET
2010
14 years 11 months ago
2010
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...
113
Voted
SENSYS
2003
ACM
15 years 6 months ago
2003
ACM
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...