Bounded Collusion ABE for TMs from IBE
From MaRDI portal
Publication:6041291
DOI10.1007/978-3-030-92068-5_13zbMATH Open1514.94089OpenAlexW4205741571MaRDI QIDQ6041291FDOQ6041291
Ridwan Syed, Brent Waters, Rishab Goyal
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
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 (3)
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 👍 👎
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)
