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...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of cryptology Vol. 36; no. 3; p. 29
Main Authors:	Dowerah, Uddipana, Dutta, Subhranil, Mitrokotsa, Aikaterini, Mukherjee, Sayantan, Pal, Tapas
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.07.2023 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!