Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions

DOI10.1007/978-3-662-46497-7_14zbMath1319.94073OpenAlexW2921336504MaRDI QIDQ5261683

Ilan Komargodski, Eylon Yogev, Gil Segev

Publication date: 6 July 2015

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46497-7_14

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (8)

Limits on the Power of Indistinguishability Obfuscation and Functional Encryption ⋮ Verifiable Computation for Randomized Algorithm ⋮ From Cryptomania to Obfustopia Through Secret-Key Functional Encryption ⋮ Function-private functional encryption in the private-key setting ⋮ Strongly full-hiding inner product encryption ⋮ Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions ⋮ From Minicrypt to Obfustopia via Private-Key Functional Encryption ⋮ Unnamed Item

This page was built for publication: Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions