Sciweavers

51 search results - page 5 / 11
» Efficient Public Key Encryption Based on Ideal Lattices
Sort
View
EUROCRYPT
2010
Springer
13 years 12 months ago
Efficient Lattice (H)IBE in the Standard Model
We construct an efficient identity based encryption system based on the standard learning with errors (LWE) problem. Our security proof holds in the standard model. The key step in...
Shweta Agrawal, Dan Boneh, Xavier Boyen
APNOMS
2007
Springer
14 years 15 days ago
Security Management in Wireless Sensor Networks with a Public Key Based Scheme
This paper proposes an efficient approach for managing the security in WSN. Our approach uses the notion of public key cryptography in which two different keys are used for encrypt...
Al-Sakib Khan Pathan, Jae Hyun Ryu, Md. Mokammel H...
CANS
2010
Springer
150views Cryptology» more  CANS 2010»
13 years 6 months ago
Predicate Encryption with Partial Public Keys
Abstract. Predicate encryption is a new powerful cryptographic primitive which allows for fine-grained access control for encrypted data: the owner of the secret key can release pa...
Carlo Blundo, Vincenzo Iovino, Giuseppe Persiano
ASIACRYPT
2009
Springer
14 years 3 months ago
Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
Abstract. We describe a public-key encryption scheme based on lattices — specifically, based on the hardness of the learning with error (LWE) problem — that is secure against ...
Jonathan Katz, Vinod Vaikuntanathan
CSFW
2009
IEEE
14 years 3 months ago
Universally Composable Symmetric Encryption
For most basic cryptographic tasks, such as public key encryption, digital signatures, authentication, key exchange, and many other more sophisticated tasks, ideal functionalities...
Ralf Küsters, Max Tuengerthal