Collusion-resistant functional encryption for RAMs
From MaRDI portal
Publication:6135396
DOI10.1007/978-3-031-22963-3_6zbMath1519.94031MaRDI QIDQ6135396
Kai-Min Chung, Prabhanjan V. Ananth, Luowen Qian, Xiong Fan
Publication date: 25 August 2023
Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)
Related Items (2)
On the optimal succinctness and efficiency of functional encryption and attribute-based encryption ⋮ The pseudorandom oracle model and ideal obfuscation
Cites Work
- Unnamed Item
- Adaptive garbled RAM from laconic oblivious transfer
- A simple construction of iO for Turing machines
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- FE and iO for Turing machines from minimal assumptions
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Adaptively secure garbling with near optimal online complexity
- Efficient maliciously secure multiparty computation for RAM
- Hardness of non-interactive differential privacy from one-way functions
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Laconic oblivious transfer and its applications
- Black-box parallel garbled RAM
- Can we access a database both locally and privately?
- Towards doubly efficient private information retrieval
- Adaptively secure garbling schemes for parallel computations
- Permuted puzzles and cryptographic hardness
- On the plausibility of fully homomorphic encryption for RAMs
- Private anonymous data access
- Watermarking public-key cryptographic primitives
- Adaptively secure and succinct functional encryption: improving security and efficiency, simultaneously
- Functional Encryption for Turing Machines
- Oblivious Parallel RAM and Applications
- Fully Succinct Garbled RAM
- Cryptography for Parallel RAM from Indistinguishability Obfuscation
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- On the Achievability of Simulation-Based Security for Functional Encryption
- Constrained Pseudorandom Functions and Their Applications
- Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
- Succinct Garbling and Indistinguishability Obfuscation for RAM Programs
- Succinct Randomized Encodings and their Applications
- Garbled RAM From One-Way Functions
- Functional Encryption: Definitions and Challenges
- Secure Multiparty RAM Computation in Constant Rounds
- Delegating RAM Computations with Adaptive Soundness and Privacy
- Adaptive Succinct Garbled RAM or: How to Delegate Your Database
- From Selective to Adaptive Security in Functional Encryption
- Indistinguishability Obfuscation from Compact Functional Encryption
- Software protection and simulation on oblivious RAMs
- Indistinguishability Obfuscation from Functional Encryption
- Reusable Garbled Deterministic Finite Automata from Learning With Errors
- How to use indistinguishability obfuscation
- Fuzzy Identity-Based Encryption
- Functional Signatures and Pseudorandom Functions
- Garbled RAM Revisited
- Reusable garbled circuits and succinct functional encryption
- Two-Round Secure MPC from Indistinguishability Obfuscation
- Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
This page was built for publication: Collusion-resistant functional encryption for RAMs
