Through introducing the access structure into attribute-based encryption, users can achieve the fine-grained access control to the ciphertext. Any access structure can be realized by general circuit. Therefore, designing attribute-based encryption for general circuit is difficult in this field. Garg etc. presented the first general circuit access structure based on multilinear maps. However the usability of the access structures is rather limited as gate can only output layer by layer and the depth of the circuit are fixed in l. In order to solve this limitation, this paper proposes a key-policy attribute-based encryption scheme for general circuits based on the Garg's scheme. In key generation step, the new scheme implements any circuit that depth is greater than 1 and less than or equal to l by equivalent conversion of the circuit and addition of the conversion key. It also achieves cross layer output by adding its child node depth into every non-leaf node's key component. Selective security of the proposed scheme in the standard model is proved under the decisional multilinear Diffie-Hellman assumption.
[1] Sahai A, Waters B. Fuzzy identity-based encryption. In: Proc. of the EUROCRYPT 2005. Springer-Verlag, 2005. 457-473. [doi: 10.1007/11426639_27]
[2] Goyal V, Pandey O, Sahai A, Waters B. Attribute-Based encryption for fine grained access control of encrypted data. In: Proc. of the ACM Conf. on Computer and Communications Security. ACM Press, 2006. 89-98. [doi: 10.1145/1180405.1180418]
[3] Bethencourt J, Sahai A, Waters B. Ciphertext-Policy attribute-based encryption. In: Proc. of the IEEE Symp. on Security and Privacy. IEEE Press, 2007. 321-334. [doi: 10.1109/SP.2007.11]
[4] Garg S, Gentry C, Halevi S, Sahai A, Waters B. Attribute-Based encryption for circuits from multilinear maps. In: Canetti R, Garay JA, eds. Advances in Cryptology CRYPTO 2013. LNCS 8043, Springer-Verlag, 2013. 479-499. [doi: 10.1007/978-3-642-40084- 1_27]
[5] Garg S, Gentry C, Halevi S. Candidate multilinear maps from ideal lattices. In: Proc. of the EUROCRYPT 2013. LNCS 7881, Springer-Verlag, 2013. 1-17. [doi: 10.1007/978-3-642-38348-9_1]
[6] Kangro K. On attribute-based encryption for circuits from multilinear maps [Bachelor Thesis]. Faculty of Mathematics and Computer Science, Institute of Computer Science, University of Tartu, 2013. http://comserv.cs.ut.ee/forms/ati_report/downloader.php?file=C586399CB9A43098CC0FF1BE9F33FC0218BEC3AE
[7] Stinson D. Cryptography: Theory and Practice. 3rd ed., CRC Press, 2005.
[8] Osreovsky R, Sahai A, Waters B. Attribute-Based encryption with non-monotonic access structures. In: Proc. of the 14th ACM Conf. on Computer and Communications Security. ACM Press, 2007. 195-203. [doi: 10.1145/1315245.1315270]
[9] Bellare M, Hoang VT, Rogaway P. Foundations of garbled circuits. In: Proc. of the 2012 ACM Conf. on Computer and Communications Security. ACM Press, 2012. 784-796. [doi: 10.1145/2382196.2382279]
[10] Boneh D, Franklin MK. Identity-Based encryption from the Weil pairing. In: Proc. of the 21st Annual Int'l Cryptology Conf. on Advances in Cryptology. Springer-Verlag, 2001. 213-229. [doi: 10.1007/3-540-44647-8_13]
[11] Beimel A. Secure schemes for secret sharing and key distribution [Ph.D. Thesis]. Technion-Israel Institute of Technology, Faculty of Computer Science, 1996.
[12] Ţiplea FL, Drăgan CC. Key-Policy attribute-based encryption for Boolean circuits from bilinear maps. In: Ors B, Preneel B, eds. Cryptography and Information Security in the Balkans. LNCS 9024, Springer-Verlag, 2015. 175-193. [doi: 10.1007/978-3-319- 21356-9_12]
[13] Xu J, Wen QY, Li WM, Jin ZP. Circuit ciphertext-policy attribute-based hybrid encryption with verifiable delegation in cloud computing. IEEE Trans. on Parallel and Distributed Systems, 2015, 119-129. [doi: 10.1109/TPDS.2015.2392752]
[14] Waters B. Ciphertext-Policy attribute-based encryption: An expressive, efficient, and provably secure realization. In: Proc. of the Public Key Cryptography 2011. LNCS 6571, Springer-Verlag, 2011. 53-70. [doi: 10.1007/978-3-642-19379-8_4]