Polynomial Spaces: A New Framework for Composite-to-Prime-Order Transformations

作者: Gottfried Herold , Julia Hesse , Dennis Hofheinz , Carla Ràfols , Andy Rupp

DOI: 10.1007/978-3-662-44371-2_15

关键词: Prime (order theory)Computer sciencePoint (geometry)AlgebraOrder of magnitudeTransformation (function)Composite numberPolynomialCryptosystem

摘要: At Eurocrypt 2010, Freeman presented a framework to convert cryptosystems based on composite-order groups into ones that use prime-order groups. Such transformation is interesting not only from conceptual point of view, but also since for relevant parameters, operations in are faster than by an order magnitude. Since Freeman’s work, several other works have shown improvements, lower bounds the efficiency such conversions.

参考文章(36)
Jean-Sébastien Coron, Tancrède Lepoint, Mehdi Tibouchi, Practical Multilinear Maps over the Integers international cryptology conference. ,vol. 2013, pp. 476- 493 ,(2013) , 10.1007/978-3-642-40041-4_26
Alex Escala, Jens Groth, Fine-Tuning Groth-Sahai Proofs public key cryptography. ,vol. 8383, pp. 630- 649 ,(2014) , 10.1007/978-3-642-54631-0_36
Jae Hong Seo, Jung Hee Cheon, Beyond the limitation of prime-order bilinear groups, and round optimal blind signatures theory of cryptography conference. pp. 133- 150 ,(2012) , 10.1007/978-3-642-28914-9_8
Kristian Gjøsteen, Symmetric Subgroup Membership Problems Public Key Cryptography - PKC 2005. pp. 104- 119 ,(2005) , 10.1007/978-3-540-30580-4_8
Jonathan Katz, Amit Sahai, Brent Waters, Predicate encryption supporting disjunctions, polynomial equations, and inner products international cryptology conference. pp. 146- 162 ,(2008) , 10.1007/978-3-540-78967-3_9
Sanjam Garg, Craig Gentry, Shai Halevi, Candidate Multilinear Maps from Ideal Lattices theory and application of cryptographic techniques. pp. 1- 17 ,(2013) , 10.1007/978-3-642-38348-9_1
Advances in Cryptology - EUROCRYPT 2010 Lecture Notes in Computer Science. ,vol. 6110, ,(2010) , 10.1007/978-3-642-13190-5
Allison Lewko, Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting Advances in Cryptology – EUROCRYPT 2012. pp. 318- 335 ,(2012) , 10.1007/978-3-642-29011-4_20
Christof Paar, André Weimerskirch, Generalizations of the Karatsuba Algorithm for Efficient Implementations. IACR Cryptology ePrint Archive. ,vol. 2006, pp. 224- ,(2006)