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!

Buďte první, kdo okomentuje tento záznam!