Article details

Title: On Bilinear Groups of Composite Order
Author(s): Ciprian Baetu   Petru Cehan   Dan Marculet         

Abstract: The paper under consideration is aimed at developing new results about bilinear groups of composite order, including relationships on hard problems and the existence of self-bilinear maps on such groups.

Keywords: bilinear map, bilinear group, hard problem.

References:

[1] A. MENEZES, S. VANSTONE, T. OKAMOTO – Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field, Proc. of the Twenty-third Annual ACM Symposium on Theory of Computing, STOC ’91, pp. 80-89, New Orleans, Louisiana, May 05-08, 1991
[2] G. FREY, M. MULLER, H.-G. RUCK – The Tate Pairing and the Discrete Logarithm Applied to Elliptic Curve Cryptosystems, IEEE Transactions on Information Theory, Vol. 45, No. 5, pp. 1717-1719, Jul. 1999
[3]A. JOUX – A One Round Protocol for Tripartite Diffie-Hellman, Journal of Cryptology, Vol. 17, No. 4, pp. 263-276, 2004
[4] D. BONEH, M. FRANKLIN – Advances in Cryptology , CRYPTO 2001, Proc. of the 21st Annual International Cryptology Conference, Santa Barbara, CA, Aug. 19-23, 2001
[5] V. GOYAL, O. PANDEY, A. SAHAI, B. WATERS – Attribute-Based Encryption for Fine-Grained Access Control of Encrypted Data, Proc. of the 13th ACM Conference on Computer and Communications Security, CCS ’06, pp. 89-98, Alexandria, Virginia, Oct. 30-Nov. 03, 2006
[6] F.L. ȚIPLEA, C.C. DRĂGAN – KeyPolicy Attribute-Based Encryption for Boolean Circuits from Bilinear Maps, In B. Ors, B. Preneel (Eds.), “Cryptography and Information Security in the Balkans”, Revised Selected Papers, pp. 175-193, First International Conference, BalkanCryptSec 2014, Istanbul, Turkey, Oct. 16-17, 2014
[7]C.C. DRĂGAN, F.L. ȚIPLEA – Key-Policy Attribute-Based Encryption for General Boolean Circuits from Secret Sharing and Multi-linear Maps, In E. Pasalic, L.R. Knudsen (Eds.), “Cryptography and Information Security in the Balkans”, Revised Selected Papers, pp. 112-133, Second International Conference, BalkanCryptSec 2015, Koper, Slovenia, Sep. 3-4, 2015
[8] D. BONEH, E.J. GOH, K. NISSIM - In “Theory of Cryptography”, pp. 325-341, Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, Feb. 10-12, 2005
[9] D. BONEH, E.J. GOH, K. NISSIM - Evaluating 2-DNF Formulas on Ciphertexts, In “Theory of Cryptography”, pp. 325-341, Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, Feb. 10-12, 2005
[10] D.M. FREEMAN – Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups, Proc. of the 29th Annual International Conference on Theory and Applications of Cryptographic Techniques, EUROCRYPT’10, pp. 44-61, French Riviera, France, May 30-Jun. 03, 2010
[11] J.H. CHEON, D.H. LEE - A Note on Self-Bilinear Maps, Bulletin of the Korean Mathematical Society, Vol. 46, No. 2, pp. 303-309, Mar. 2009
[12] D. BONEH - Bilinear Groups of Composite Order, In T. Takagi, T. Okamoto, E. Okamoto, T. Okamoto (Eds.), “Pairing-Based Cryptography – Pairing 2007”, pp. 1-1, Proc. of the First International Conference, Tokyo, Japan, Jul. 2-4, 2007
[13] S. MEIKLEJOHN, H. SHACHAM - New Trapdoor Projection Maps for Composite-Order Bilinear Groups, Cryptology ePrint Archive, Report 2013/657, 2013, http://eprint.iacr.org/
[14] A. JOUX - The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems, In C. Fieker, D.R. Kohel (Eds.), “Algorithmic Number Theory”, Vol. 2369, pp. 20-32, Proc. of the 5th International Symposium, ANTS-V Sydney, Australia, Jul. 7-12, 2002
[15] Z. CAO, L. LIU - A Note on Bilinear Groups of a Large Composite Order, Cryptology ePrint Archive, Report 2013/812, 2013, http://eprint.iacr. org/2013/812.pdf