Abstract
Bilinear groups of composite order are groups with an efficient bilinear map where the group order is a product of two large primes. Such groups are constructed from pairing friendly curves over a finite field. Composite order bilinear groups were recently used in a number of interesting cryptographic constructions. This talk will survey three applications:
-
1
Private Information Retrieval
-
1
Anonymous Identity Based Encryption
-
1
Non-Interactive Zero Knowledge.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boneh, D. (2007). Bilinear Groups of Composite Order. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds) Pairing-Based Cryptography – Pairing 2007. Pairing 2007. Lecture Notes in Computer Science, vol 4575. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73489-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-73489-5_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73488-8
Online ISBN: 978-3-540-73489-5
eBook Packages: Computer ScienceComputer Science (R0)