TY - GEN
T1 - CCA-secure ABE using tag and pair encoding
AU - Blazy, Olivier
AU - Mukherjee, Sayantan
N1 - Publisher Copyright:
© Springer Nature Switzerland AG 2020.
PY - 2020/1/1
Y1 - 2020/1/1
N2 - Jutla and Roy (Asiacrypt 2013) proposed the first tag-based identity-based encryption which Chen and Gong (Asiacrypt 2017) extended to construct CPA-secure attribute-based encryption (ABE) in prime-order groups. However, Chen and Gong used predicate encoding for ABE construction. In literature, there exists a more powerful encoding, namely, pair encoding which Attrapadung (Eurocrypt 2014, Asiacrypt 2016) introduced as a generic framework to construct CPA-secure attribute-based encryptions in prime order groups. In reality, however, CPA-secure encryptions are not always sufficient as a security requirement. Yamada et al. (PKC 2011, PKC 2012) suggested generic techniques to get CCA secure attribute-based encryptions from CPA-secure attribute-based encryptions. In this work, we achieve two-fold improvements. We provide a tag-based ABE construction that uses pair encoding and at the same time achieves CCA security from the matrix Diffie-Hellman assumption in the standard model. As a result, our tag-based ABE can be utilized to construct new attribute-based encryptions with multiple randomnesses required in both the secret key and the ciphertext. Moreover, the cost we pay for CCA security is still significantly less than the cost of generic approach of Yamada et al.
AB - Jutla and Roy (Asiacrypt 2013) proposed the first tag-based identity-based encryption which Chen and Gong (Asiacrypt 2017) extended to construct CPA-secure attribute-based encryption (ABE) in prime-order groups. However, Chen and Gong used predicate encoding for ABE construction. In literature, there exists a more powerful encoding, namely, pair encoding which Attrapadung (Eurocrypt 2014, Asiacrypt 2016) introduced as a generic framework to construct CPA-secure attribute-based encryptions in prime order groups. In reality, however, CPA-secure encryptions are not always sufficient as a security requirement. Yamada et al. (PKC 2011, PKC 2012) suggested generic techniques to get CCA secure attribute-based encryptions from CPA-secure attribute-based encryptions. In this work, we achieve two-fold improvements. We provide a tag-based ABE construction that uses pair encoding and at the same time achieves CCA security from the matrix Diffie-Hellman assumption in the standard model. As a result, our tag-based ABE can be utilized to construct new attribute-based encryptions with multiple randomnesses required in both the secret key and the ciphertext. Moreover, the cost we pay for CCA security is still significantly less than the cost of generic approach of Yamada et al.
U2 - 10.1007/978-3-030-65277-7_31
DO - 10.1007/978-3-030-65277-7_31
M3 - Conference contribution
AN - SCOPUS:85098238826
SN - 9783030652760
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 691
EP - 714
BT - Progress in Cryptology – INDOCRYPT 2020 - 21st International Conference on Cryptology in India 2020, Proceedings
A2 - Bhargavan, Karthikeyan
A2 - Oswald, Elisabeth
A2 - Prabhakaran, Manoj
PB - Springer Science and Business Media Deutschland GmbH
T2 - 21st International Conference on Cryptology in India, INDOCRYPT 2020
Y2 - 13 December 2020 through 16 December 2020
ER -