Sciweavers

25 search results - page 5 / 5
» Identity-based encryption with efficient revocation
Sort
View
PAIRING
2010
Springer
133views Cryptology» more  PAIRING 2010»
13 years 3 months ago
Pairing Computation on Elliptic Curves with Efficiently Computable Endomorphism and Small Embedding Degree
Scott uses an efficiently computable isomorphism in order to optimize pairing computation on a particular class of curves with embedding degree 2. He points out that pairing implem...
Sorina Ionica, Antoine Joux
ITIIS
2010
200views more  ITIIS 2010»
13 years 10 days ago
New Techniques for Anonymous HIBE with Short Ciphertexts in Prime Order Groups
Anonymous hierarchical identity based encryption (HIBE) is an extension of identity based encryption (IBE) that can use an arbitrary string like an e-mail address for a public key...
Kwangsu Lee, Dong Hoon Lee
CCS
2010
ACM
13 years 5 months ago
Practical leakage-resilient identity-based encryption from simple assumptions
We provide new constructions of Leakage-Resilient IdentityBased Encryption systems (IBE) in the Standard model. We apply a hash proof technique in the existing IBE schemes of Bone...
Sherman S. M. Chow, Yevgeniy Dodis, Yannis Rousela...
FC
2000
Springer
150views Cryptology» more  FC 2000»
13 years 9 months ago
Self-Scrambling Anonymizers
For the two last decades, people have tried to provide practical electronic cash schemes, with more or less success. Indeed, the most secure ones generally suffer from inefficiency...
David Pointcheval
CHES
2006
Springer
105views Cryptology» more  CHES 2006»
13 years 9 months ago
Implementing Cryptographic Pairings on Smartcards
Abstract. Pairings on elliptic curves are fast coming of age as cryptographic primitives for deployment in new security applications, particularly in the context of implementations...
Michael Scott, Neil Costigan, Wesam Abdulwahab