Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions

DOI10.1007/978-3-662-49896-5_30zbMath1371.94627OpenAlexW2497530904MaRDI QIDQ5739225

Zvika Brakerski, Gil Segev, Ilan Komargodski

Publication date: 15 July 2016

Published in: Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49896-5_30

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (18)

Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound ⋮ FE and iO for Turing machines from minimal assumptions ⋮ Limits on the Power of Indistinguishability Obfuscation and Functional Encryption ⋮ From Cryptomania to Obfustopia Through Secret-Key Functional Encryption ⋮ Broadcast, trace and revoke with optimal parameters from polynomial hardness ⋮ Multi-input Functional Encryption with Unbounded-Message Security ⋮ Decentralized multi-client functional encryption for inner product ⋮ Tightly secure inner product functional encryption: multi-input and function-hiding constructions ⋮ Practical Order-Revealing Encryption with Limited Leakage ⋮ Functional encryption for randomized functionalities in the private-key setting from minimal assumptions ⋮ Function-private functional encryption in the private-key setting ⋮ From Minicrypt to Obfustopia via Private-Key Functional Encryption ⋮ Multi-input Inner-Product Functional Encryption from Pairings ⋮ Output-Compressing Randomized Encodings and Applications ⋮ Multi-client functional encryption for separable functions ⋮ Unnamed Item ⋮ Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software ⋮ Ad Hoc PSM Protocols: Secure Computation Without Coordination

This page was built for publication: Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions