Optimal bounded-collusion secure functional encryption

DOI10.1007/978-3-030-36030-6_8zbMath1455.94110OpenAlexW2991473697MaRDI QIDQ2175911

Vinod Vaikuntanathan, Prabhanjan V. Ananth

Publication date: 30 April 2020

Full work available at URL: https://hdl.handle.net/1721.1/130062

zbMATH Keywords

public-key functional encryption schemesbounded-keyprivate-key functional encryption schemes

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (12)

Functional encryption for Turing machines with dynamic bounded collusion from LWE ⋮ Dynamic collusion bounded functional encryption from identity-based encryption ⋮ Optimal bounded-collusion secure functional encryption ⋮ Bounded Collusion ABE for TMs from IBE ⋮ Bounded functional encryption for Turing machines: adaptive security from general assumptions ⋮ Functional encryption with secure key leasing ⋮ Watermarkable public key encryption with efficient extraction under standard assumptions ⋮ Public-key watermarking schemes for pseudorandom functions ⋮ ABE for DFA from LWE against bounded collusions, revisited ⋮ Obfustopia built on secret-key functional encryption ⋮ Impossibility results for lattice-based functional encryption schemes ⋮ New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts

Cites Work

• Unnamed Item
• Two-round MPC: information-theoretic and black-box
• Perfect secure computation in two rounds
• Traitor-tracing from LWE made simple and attribute-based
• Anonymous IBE, leakage resilience and circular security from new assumptions
• Two-round multiparty secure computation from minimal assumptions
• \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
• Stronger security for reusable garbled circuits, general definitions and attacks
• Identity-based encryption from the Diffie-Hellman assumption
• Functional encryption for bounded collusions, revisited
• From selective IBE to full IBE and selective HIBE
• Round-optimal secure multiparty computation with honest majority
• Optimal bounded-collusion secure functional encryption
• Bounded-Collusion IBE from Key Homomorphism
• Functional Encryption with Bounded Collusions via Multi-party Computation
• Functional Encryption: Definitions and Challenges
• From Cryptomania to Obfustopia Through Secret-Key Functional Encryption
• Single-Key to Multi-Key Functional Encryption with Polynomial Loss
• Compactness vs Collusion Resistance in Functional Encryption
• Indistinguishability Obfuscation from Compact Functional Encryption
• Bounded CCA2-Secure Encryption
• Indistinguishability Obfuscation from Functional Encryption
• How to use indistinguishability obfuscation
• Fuzzy Identity-Based Encryption
• Reusable garbled circuits and succinct functional encryption
• Bounded-Collusion Attribute-Based Encryption from Minimal Assumptions
• Topics in Cryptology – CT-RSA 2004
• Obfustopia built on secret-key functional encryption

This page was built for publication: Optimal bounded-collusion secure functional encryption