ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Large Universe Subset Predicate Encryption Based on Static Assumption (Without Random Oracle)

Chatterjee, S and Mukherjee, S (2019) Large Universe Subset Predicate Encryption Based on Static Assumption (Without Random Oracle). In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11405 . pp. 62-82.

[img] PDF
Lar_Uni_Sub_Pre_Enc_Bas_Sta_Ass_2019.pdf - Published Version
Restricted to Registered users only

Download (437kB)
Official URL: https://dx.doi.org/10.1007/978-3-030-12612-4_4


In a recent work, Katz et al. (CANS�17) generalized the notion of Broadcast Encryption to define Subset Predicate Encryption (SPE) that emulates subset containment predicate in the encrypted domain. They proposed two selective secure constructions of SPE in the small universe settings. Their first construction is based on q-type assumption while the second one is based on DBDH. Both achieve constant size secret key while the ciphertext size depends on the size of the privileged set. They also showed some black-box transformation of SPE to well-known primitives like WIBE and ABE to establish the richness of the SPE structure. This work investigates the question of large universe realization of SPE scheme based on static assumption without random oracle. We propose two constructions both of which achieve constant size secret key. First construction (Formula Presented), instantiated in composite order bilinear groups, achieves constant size ciphertext and is proven secure in a restricted version of selective security model under the subgroup decision assumption (SDP). Our main construction (Formula Presented) is adaptive secure in the prime order bilinear group under the symmetric external Diffie-Hellman assumption (SXDH). Thus (Formula Presented) is the first large universe instantiation of SPE to achieve adaptive security without random oracle. Both our constructions have efficient decryption function suggesting their practical applicability. Thus the primitives like WIBE and ABE resulting through black-box transformation of our constructions become more practical. © 2019, Springer Nature Switzerland AG.

Item Type: Journal Article
Additional Information: Copyright for this article belongs to Springer Verlag
Keywords: Security of data, Adaptive security; Bilinear groups; Broadcast encryption; Constant size ciphertext; Diffie-Hellman assumption; First constructions; Predicate encryptions; Without random oracles, Cryptography
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Depositing User: Id for Latest eprints
Date Deposited: 15 Apr 2019 05:25
Last Modified: 15 Apr 2019 05:25
URI: http://eprints.iisc.ac.in/id/eprint/62100

Actions (login required)

View Item View Item