Verifiable Functional Encryption

DOI10.1007/978-3-662-53890-6_19zbMath1407.94078OpenAlexW2553598483MaRDI QIDQ2953789

Amit Sahai, Aayush Jain, Vipul Goyal, Saikrishna Badrinarayanan

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_19

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (12)

Verifiable Inner Product Encryption Scheme ⋮ COA-secure obfuscation and applications ⋮ Multi-input non-interactive functional encryption: constructions and applications ⋮ Verifiable Functional Encryption ⋮ Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \) ⋮ A survey on functional encryption ⋮ More efficient verifiable functional encryption ⋮ Vector and functional commitments from lattices ⋮ Verifiable functional encryption using Intel SGX ⋮ Decentralized multi-client functional encryption for inner product ⋮ Practical fully secure unrestricted inner product functional encryption modulo \(p\) ⋮ Verifiable random functions from non-interactive witness-indistinguishable proofs

Cites Work

• Unnamed Item
• Unnamed Item
• Indistinguishability Obfuscation: From Approximate to Exact
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Functional Encryption: New Perspectives and Lower Bounds
• Delegatable Homomorphic Encryption with Applications to Secure Outsourcing of Computation
• Functional Encryption with Bounded Collusions via Multi-party Computation
• Expressive Attribute-Based Encryption with Constant-Size Ciphertexts from the Decisional Linear Assumption
• Verifiable Functional Encryption
• Functional Encryption: Definitions and Challenges
• Fully Secure Accountable-Authority Identity-Based Encryption
• Predicate Encryption for Circuits from LWE
• Indistinguishability Obfuscation from Compact Functional Encryption
• Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
• Reducing Trust in the PKG in Identity Based Cryptosystems
• Identity-Based Encryption from the Weil Pairing
• ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation
• Efficient Identity-Based Encryption Without Random Oracles
• Fuzzy Identity-Based Encryption
• Derandomization in Cryptography
• Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
• Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
• Attribute-based encryption for circuits
• Reusable garbled circuits and succinct functional encryption
• Multi-input Inner-Product Functional Encryption from Pairings
• Non-interactive Zaps and New Techniques for NIZK

This page was built for publication: Verifiable Functional Encryption