Bounded Collusion ABE for TMs from IBE
From MaRDI portal
Publication:6041291
DOI10.1007/978-3-030-92068-5_13zbMATH Open1514.94089OpenAlexW4205741571MaRDI QIDQ6041291FDOQ6041291
Authors: Rishab Goyal, Ridwan Syed, Brent Waters 
Publication date: 26 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-92068-5_13
Recommendations
- Bounded functional encryption for Turing machines: adaptive security from general assumptions
- Bounded-Collusion Attribute-Based Encryption from Minimal Assumptions
- Functional encryption for Turing machines with dynamic bounded collusion from LWE
- Turing machines with shortcuts: efficient attribute-based encryption for bounded functions
- Bounded-collusion IBE from key homomorphism
Cites Work
- Identity-based cryptosystems and signature schemes
- Trapdoors for hard lattices and new cryptographic constructions
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Title not available (Why is that?)
- Fuzzy Identity-Based Encryption
- Functional encryption for regular languages
- Title not available (Why is that?)
- Advances in Cryptology – CRYPTO 2004
- Title not available (Why is that?)
- Theory of Cryptography
- Identity-based encryption from the Diffie-Hellman assumption
- Functional Encryption for Turing Machines
- Functional encryption with bounded collusions via multi-party computation
- Public-coin differing-inputs obfuscation and its applications
- On extractability obfuscation
- Dual system encryption via doubly selective security: framework, fully secure functional encryption for regular languages, and more
- Adaptive garbled RAM from laconic oblivious transfer
- Laconic oblivious transfer and its applications
- Simplifying design and analysis of complex predicate encryption schemes
- Adaptively secure and succinct functional encryption: improving security and efficiency, simultaneously
- Registration-based encryption: removing private-key generator from IBE
- Be adaptive, avoid overcommitting
- Adaptive security of Yao's garbled circuits
- How to garble RAM programs?
- Garbled RAM revisited
- From selective IBE to full IBE and selective HIBE
- Dual system encryption framework in prime-order groups via computational pair encodings
- Semi-adaptive security and bundling functionalities made generic and easy
- Attribute-based encryption for finite automata from LWE
- Functional encryption for Turing machines with dynamic bounded collusion from LWE
- Optimal bounded-collusion secure functional encryption
- Adaptively secure ABE for DFA from \(k\)-Lin and more
- Attribute based encryption for deterministic finite automata from DLIN
- Compact adaptively secure ABE for \(\mathrm{NC}^1\) from \(k\)-lin
- ABE for DFA from \(k\)-lin
- Attribute-based encryption (and more) for nondeterministic finite automata from LWE
- Towards attribute-based encryption for RAMs from LWE: sub-linear decryption, and more
- Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption
- Adaptive Security of Constrained PRFs
- A quasipolynomial reduction for generalized selective decryption on trees
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Indistinguishability obfuscation from well-founded assumptions
Cited In (5)
- Turing machines with shortcuts: efficient attribute-based encryption for bounded functions
- Dynamic collusion functional encryption and multi-authority attribute-based encryption
- Bounded-collusion decentralized ABE with sublinear parameters
- Attribute based encryption for Turing machines from lattices
- Bounded functional encryption for Turing machines: adaptive security from general assumptions
This page was built for publication: Bounded Collusion ABE for TMs from IBE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041291)
