A Tag Based Encoding: An Efficient Encoding for Predicate Encryption in Prime Order Groups

We introduce a tag based encoding, a new generic framework for modular design of Predicate Encryption PE schemes in prime order groups. Our framework is equipped with a compiler which is adaptively secure in prime order groups under the standard Decisional Linear Assumption DLIN. Compared with prior encoding frameworks in prime order groups which require multiple group elements to interpret a tuple of an encoding in a real scheme, our framework has a distinctive feature which is that each element of an encoding can be represented with only a group element and an integer. This difference allows us to construct a more efficient encryption scheme. In the current literature, the most efficient compiler was proposed by Chen, Gay and Wee CGW in Eurocrypt'15. It features one tuple of an encoding into two group elements under the Symmetric External Diffie-Hellman assumption SXDH. Compared with their compiler, our encoding construction saves the size of either private keys or ciphertexts up-to 25i?ź% and reduces decryption time and the size of public key up-to 50i?ź% in 128 security level. Several new schemes such as inner product encryption with short keys, dual spatial encryption with short keys and hierarchical identity based encryption with short ciphertexts are also introduced as instances of our encoding.

[1]  Brent Waters,et al.  Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions , 2009, IACR Cryptol. ePrint Arch..

[2]  Tatsuaki Okamoto,et al.  Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption , 2010, IACR Cryptol. ePrint Arch..

[3]  Tatsuaki Okamoto,et al.  Hierarchical Predicate Encryption for Inner-Products , 2009, ASIACRYPT.

[4]  Tatsuaki Okamoto,et al.  Fully Secure Unbounded Inner-Product and Attribute-Based Encryption , 2012, ASIACRYPT.

[5]  Somindu C. Ramanna.  More Efficient Constructions for Inner-Product Encryption , 2016, ACNS.

[6]  P. MuraliKrishna,et al.  SECURE SCHEMES FOR SECRET SHARING AND KEY DISTRIBUTION USING PELL'S EQUATION , 2013 .

[7]  Melissa Chase,et al.  A Study of Pair Encodings: Predicate Encryption in Prime Order Groups , 2016, TCC.

[8]  Allison Bishop,et al.  New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts , 2010, IACR Cryptol. ePrint Arch..

[9]  Sanjit Chatterjee,et al.  Variants of Waters' Dual-System Primitives Using Asymmetric Pairings , 2012, IACR Cryptol. ePrint Arch..

[10]  Cheng Chen,et al.  Fully Secure Doubly-Spatial Encryption under Simple Assumptions , 2012, ProvSec.

[11]  Allison Bishop,et al.  New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques , 2012, CRYPTO.

[12]  Hoeteck Wee,et al.  Dual System Groups and its Applications - Compact HIBE and More , 2014, IACR Cryptol. ePrint Arch..

[13]  Hoeteck Wee,et al.  Dual System Encryption via Predicate Encodings , 2014, TCC.

[14]  Nuttapong Attrapadung,et al.  Functional encryption for public-attribute inner products: Achieving constant-size ciphertexts with adaptive security or support for negation , 2012, J. Math. Cryptol..

[15]  Nuttapong Attrapadung,et al.  Dual System Encryption Framework in Prime-Order Groups via Computational Pair Encodings , 2016, ASIACRYPT.

[16]  Nuttapong Attrapadung,et al.  Duality in ABE: Converting Attribute Based Encryption for Dual Predicate and Dual Policy via Computational Encodings , 2015, CT-RSA.

[17]  Jae Hong Seo.  On the (Im)possibility of Projecting Property in Prime-Order Setting , 2012, ASIACRYPT.

[18]  David Mandell Freeman,et al.  Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups , 2010, EUROCRYPT.

[19]  Hoeteck Wee,et al.  Improved Dual System ABE in Prime-Order Groups via Predicate Encodings , 2015, EUROCRYPT.

[20]  Jorge Luis Villar,et al.  An Algebraic Framework for Diffie–Hellman Assumptions , 2015, Journal of Cryptology.

[21]  Sourav Mukhopadhyay,et al.  Fully Secure Self-Updatable Encryption in Prime Order Bilinear Groups , 2014, ISC.

[22]  Aurore Guillevic,et al.  Comparing the Pairing Efficiency over Composite-Order and Prime-Order Elliptic Curves , 2013, ACNS.

[23]  Dennis Hofheinz,et al.  Polynomial Spaces: A New Framework for Composite-to-Prime-Order Transformations , 2014, IACR Cryptol. ePrint Arch..

[24]  Dong Hoon Lee,et al.  Self-updatable encryption: Time constrained access control with hidden attributes and better efficiency , 2013, Theor. Comput. Sci..

[25]  Allison Bishop,et al.  Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption , 2010, EUROCRYPT.

[26]  Hoeteck Wee,et al.  Fully, (Almost) Tightly Secure IBE and Dual System Groups , 2013, CRYPTO.

[27]  Hoeteck Wee,et al.  Doubly spatial encryption from DBDH , 2014, Theor. Comput. Sci..

[28]  Michael Hamburg,et al.  Spatial Encryption , 2011, IACR Cryptol. ePrint Arch..

[29]  Brent Waters,et al.  Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles) , 2006, CRYPTO.

[30]  Allison Bishop,et al.  Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting , 2012, EUROCRYPT.

[31]  Nuttapong Attrapadung,et al.  Dual System Encryption via Doubly Selective Security: Framework, Fully-secure Functional Encryption for Regular Languages, and More , 2014, IACR Cryptol. ePrint Arch..