Identity-based Encryption with Efficient Revocation. Boldyreva, A., Goyal, V., & Kumar, V. 2, 2012. ![Identity-based Encryption with Efficient Revocation [link]](https://bibbase.org/img/filetypes/link.svg "link")
Website abstract bibtex Identity-based encryption (IBE) is an exciting
alternative to public-key encryption, as IBE eliminates the need for
a Public Key Infrastructure (PKI). 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.
@misc{
title = {Identity-based Encryption with Efficient Revocation},
type = {misc},
year = {2012},
keywords = {encryption,identity,revocation},
websites = {http://eprint.iacr.org/2012/052},
month = {2},
id = {876eb639-7370-35ae-9663-479bdfec30ac},
created = {2018-07-12T21:31:40.879Z},
file_attached = {false},
profile_id = {f954d000-ce94-3da6-bd26-b983145a920f},
group_id = {b0b145a3-980e-3ad7-a16f-c93918c606ed},
last_modified = {2018-07-12T21:31:40.879Z},
read = {false},
starred = {false},
authored = {false},
confirmed = {true},
hidden = {false},
citation_key = {Boldyreva2012Identitybased},
source_type = {electronic},
medium = {Cryptology ePrint Archive, Report 2012/052},
private_publication = {false},
abstract = {Identity-based encryption (IBE) is an exciting
alternative to public-key encryption, as IBE eliminates the need for
a Public Key Infrastructure (PKI). 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.},
bibtype = {misc},
author = {Boldyreva, Alexandra and Goyal, Vipul and Kumar, Virendra}
}
Downloads: 0
{"_id":"p7a9NaoXBFS6LeEHD","bibbaseid":"boldyreva-goyal-kumar-identitybasedencryptionwithefficientrevocation-2012","downloads":0,"creationDate":"2019-02-15T15:14:59.639Z","title":"Identity-based Encryption with Efficient Revocation","author_short":["Boldyreva, A.","Goyal, V.","Kumar, V."],"year":2012,"bibtype":"misc","biburl":null,"bibdata":{"title":"Identity-based Encryption with Efficient Revocation","type":"misc","year":"2012","keywords":"encryption,identity,revocation","websites":"http://eprint.iacr.org/2012/052","month":"2","id":"876eb639-7370-35ae-9663-479bdfec30ac","created":"2018-07-12T21:31:40.879Z","file_attached":false,"profile_id":"f954d000-ce94-3da6-bd26-b983145a920f","group_id":"b0b145a3-980e-3ad7-a16f-c93918c606ed","last_modified":"2018-07-12T21:31:40.879Z","read":false,"starred":false,"authored":false,"confirmed":"true","hidden":false,"citation_key":"Boldyreva2012Identitybased","source_type":"electronic","medium":"Cryptology ePrint Archive, Report 2012/052","private_publication":false,"abstract":"Identity-based encryption (IBE) is an exciting\nalternative to public-key encryption, as IBE eliminates the need for\na Public Key Infrastructure (PKI). Any setting,\nPKI- or identity-based, must provide a means to revoke users from\nthe system. Efficient revocation is a well-studied problem in the\ntraditional PKI setting. However in the setting of IBE, there has\nbeen little work on studying the revocation mechanisms. The most\npractical solution requires the senders to also use time periods\nwhen encrypting, and all the receivers (regardless of whether their\nkeys have been compromised or not) to update their private keys\nregularly by contacting the trusted authority. We note that this\nsolution does not scale well -- as the number of users increases,\nthe work on key updates becomes a bottleneck. We propose an IBE\nscheme that significantly improves key-update efficiency on the side\nof the trusted party (from linear to logarithmic in the number of\nusers), while staying efficient for the users. Our scheme builds on\nthe ideas of the Fuzzy IBE primitive and binary tree data structure,\nand is provably secure.","bibtype":"misc","author":"Boldyreva, Alexandra and Goyal, Vipul and Kumar, Virendra","bibtex":"@misc{\n title = {Identity-based Encryption with Efficient Revocation},\n type = {misc},\n year = {2012},\n keywords = {encryption,identity,revocation},\n websites = {http://eprint.iacr.org/2012/052},\n month = {2},\n id = {876eb639-7370-35ae-9663-479bdfec30ac},\n created = {2018-07-12T21:31:40.879Z},\n file_attached = {false},\n profile_id = {f954d000-ce94-3da6-bd26-b983145a920f},\n group_id = {b0b145a3-980e-3ad7-a16f-c93918c606ed},\n last_modified = {2018-07-12T21:31:40.879Z},\n read = {false},\n starred = {false},\n authored = {false},\n confirmed = {true},\n hidden = {false},\n citation_key = {Boldyreva2012Identitybased},\n source_type = {electronic},\n medium = {Cryptology ePrint Archive, Report 2012/052},\n private_publication = {false},\n abstract = {Identity-based encryption (IBE) is an exciting\nalternative to public-key encryption, as IBE eliminates the need for\na Public Key Infrastructure (PKI). Any setting,\nPKI- or identity-based, must provide a means to revoke users from\nthe system. Efficient revocation is a well-studied problem in the\ntraditional PKI setting. However in the setting of IBE, there has\nbeen little work on studying the revocation mechanisms. The most\npractical solution requires the senders to also use time periods\nwhen encrypting, and all the receivers (regardless of whether their\nkeys have been compromised or not) to update their private keys\nregularly by contacting the trusted authority. We note that this\nsolution does not scale well -- as the number of users increases,\nthe work on key updates becomes a bottleneck. We propose an IBE\nscheme that significantly improves key-update efficiency on the side\nof the trusted party (from linear to logarithmic in the number of\nusers), while staying efficient for the users. Our scheme builds on\nthe ideas of the Fuzzy IBE primitive and binary tree data structure,\nand is provably secure.},\n bibtype = {misc},\n author = {Boldyreva, Alexandra and Goyal, Vipul and Kumar, Virendra}\n}","author_short":["Boldyreva, A.","Goyal, V.","Kumar, V."],"urls":{"Website":"http://eprint.iacr.org/2012/052"},"bibbaseid":"boldyreva-goyal-kumar-identitybasedencryptionwithefficientrevocation-2012","role":"author","keyword":["encryption","identity","revocation"],"downloads":0},"search_terms":["identity","based","encryption","efficient","revocation","boldyreva","goyal","kumar"],"keywords":["encryption","identity","revocation"],"authorIDs":[]}