Unbounded Predicate Inner Product Functional Encryption from Pairings

Predicate inner product functional encryption (P-IPFE) is essentially attribute-based IPFE (AB-IPFE) which additionally hides attributes associated to ciphertexts. In a P-IPFE, a message x is encrypted under an attribute w and a secret key is generated for a pair ( y , v ) such that recovery of ⟨ x...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of cryptology Ročník 36; číslo 3; s. 29
Hlavní autoři:	Dowerah, Uddipana, Dutta, Subhranil, Mitrokotsa, Aikaterini, Mukherjee, Sayantan, Pal, Tapas
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.07.2023 Springer Nature B.V
Témata:	Access control Coding and Information Theory Combinatorics Communications Engineering Computational Mathematics and Numerical Analysis Computer Science Computing on Encrypted Data Encryption Fully attribute-hiding Inner product functional encryption Inner product predicate Messages Networks Probability Theory and Stochastic Processes Research Article Semi-adaptive security Signatures Unbounded Weak attribute-hiding Fully attribute-hiding Weak attribute-hiding Inner product predicate Semi-adaptive security Inner product functional encryption Unbounded
ISSN:	0933-2790, 1432-1378, 1432-1378
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	Predicate inner product functional encryption (P-IPFE) is essentially attribute-based IPFE (AB-IPFE) which additionally hides attributes associated to ciphertexts. In a P-IPFE, a message x is encrypted under an attribute w and a secret key is generated for a pair ( y , v ) such that recovery of ⟨ x , y ⟩ requires the vectors w , v to satisfy a linear relation. We call a P-IPFE unbounded if it can encrypt unbounded length attributes and message vectors. ∙ zero predicate IPFE . We construct the first unbounded zero predicate IPFE (UZP-IPFE) which recovers ⟨ x , y ⟩ if ⟨ w , v ⟩ = 0 . This construction is inspired by the unbounded IPFE of Tomida and Takashima (ASIACRYPT 2018) and the unbounded zero inner product encryption of Okamoto and Takashima (ASIACRYPT 2012). The UZP-IPFE stands secure against general attackers capable of decrypting the challenge ciphertext. Concretely, it provides full attribute-hiding security in the indistinguishability-based semi-adaptive model under the standard symmetric external Diffie–Hellman assumption. ∙ non-zero predicate IPFE . We present the first unbounded non-zero predicate IPFE (UNP-IPFE) that successfully recovers ⟨ x , y ⟩ if ⟨ w , v ⟩ ≠ 0 . We generically transform an unbounded quadratic FE (UQFE) scheme to weak attribute-hiding UNP-IPFE in both public and secret key setting. Interestingly, our secret key simulation secure UNP-IPFE has succinct secret keys and is constructed from a novel succinct UQFE that we build in the random oracle model. We leave the problem of constructing a succinct public key UNP-IPFE or UQFE in the standard model as an important open problem.
Bibliografie:	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ISSN:	0933-2790 1432-1378 1432-1378
DOI:	10.1007/s00145-023-09458-2