Name
Abstract | ||
|---|---|---|
Identity-based encryption (IBE) is an exciting alternative to public-key encryption, as IBE eliminates the need for a Public Key Infrastructure (PKI). The senders using an IBE do not need to look up the public keys and the corresponding certificates of the receivers, the identities (e.g. emails or IP addresses) of the latter are sufficient to encrypt. Any setting, PKI- or identity-based, must provide a means to revoke users from the system. Efficient revocation is a well-studied problem in the traditional PKI setting. However in the setting of IBE, there has been little work on studying the revocation mechanisms. The most practical solution requires the senders to also use time periods when encrypting, and all the receivers (regardless of whether their keys have been compromised or not) to update their private keys regularly by contacting the trusted authority. We note that this solution does not scale well -- as the number of users increases, the work on key updates becomes a bottleneck. We propose an IBE scheme that significantly improves key-update efficiency on the side of the trusted party (from linear to logarithmic in the number of users), while staying efficient for the users. Our scheme builds on the ideas of the Fuzzy IBE primitive and binary tree data structure, and is provably secure. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1145/1455770.1455823 | IACR Cryptology ePrint Archive |
Keywords | DocType | Volume |
users increase,ip address,revocation mechanism,fuzzy ibe,efficient revocation,ibe scheme,practical solution,identity-based encryption,traditional pki setting,public key infrastructure,binary tree,data structure,public key encryption,provable security | Journal | 2012 |
Citations | PageRank | References |
169 | 5.53 | 25 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexandra Boldyreva | 1 | 2297 | 114.80 |
| Vipul Goyal | 2 | 2859 | 129.53 |
| Virendra Kumar | 3 | 169 | 5.53 |