Multi-input Functional Encryption with Unbounded-Message Security

DOI10.1007/978-3-662-53890-6_18zbMath1407.94114OpenAlexW2397174171MaRDI QIDQ2953788

Aayush Jain, Vipul Goyal, Adam O'Neill

Publication date: 6 January 2017

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

Full work available at URL: https://doi.org/10.1007/978-3-662-53890-6_18

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Theory of cryptography. 12th theory of cryptography conference, TCC 2015, Warsaw, Poland, March 23--25, 2015. Proceedings, Part II
• Multi-input Functional Encryption for Unbounded Arity Functions
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
• Obfuscation Combiners
• Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
• On the Achievability of Simulation-Based Security for Functional Encryption
• On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input
• Non-Interactive Secure Multiparty Computation
• Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
• Functional Encryption: Definitions and Challenges
• Indistinguishability Obfuscation from Compact Functional Encryption
• On obfuscating point functions
• One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments
• Candidate Multilinear Maps from Ideal Lattices
• Obfuscation of Probabilistic Circuits and Applications
• Public-Coin Differing-Inputs Obfuscation and Its Applications
• Fuzzy Identity-Based Encryption
• Functional Signatures and Pseudorandom Functions
• Multi-input Functional Encryption
• Reusable garbled circuits and succinct functional encryption
• Bounds on the Efficiency of Generic Cryptographic Constructions
• Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
• On Extractability Obfuscation
• Theory of Cryptography

This page was built for publication: Multi-input Functional Encryption with Unbounded-Message Security