Collusion-resistant functional encryption for RAMs
From MaRDI portal
(Redirected from Collusion-resistant functional encryption for RAMs)
Recommendations
- Functional encryption for Turing machines with dynamic bounded collusion from LWE
- Functional encryption with bounded collusions via multi-party computation
- Functional encryption for bounded collusions, revisited
- Functional encryption for cubic polynomials and implementation
- Compactness vs collusion resistance in functional encryption
Cites work
- A simple construction of iO for Turing machines
- Adaptive garbled RAM from laconic oblivious transfer
- Adaptive succinct garbled RAM or: how to delegate your database
- Adaptively secure and succinct functional encryption: improving security and efficiency, simultaneously
- Adaptively secure garbling schemes for parallel computations
- Adaptively secure garbling with near optimal online complexity
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Black-box parallel garbled RAM
- Can we access a database both locally and privately?
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Constrained pseudorandom functions and their applications
- Cryptography for parallel RAM from indistinguishability obfuscation
- Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
- Delegating RAM computations with adaptive soundness and privacy
- Efficient maliciously secure multiparty computation for RAM
- FE and iO for Turing machines from minimal assumptions
- From selective to adaptive security in functional encryption
- Fully succinct garbled RAM
- Functional Encryption for Turing Machines
- Functional encryption: definitions and challenges
- Functional signatures and pseudorandom functions
- Fuzzy Identity-Based Encryption
- Garbled RAM from one-way functions
- Garbled RAM revisited
- Hardness of non-interactive differential privacy from one-way functions
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- Indistinguishability obfuscation for Turing machines with unbounded memory
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation from functional encryption
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Laconic oblivious transfer and its applications
- Oblivious parallel RAM and applications
- On the achievability of simulation-based security for functional encryption
- On the plausibility of fully homomorphic encryption for RAMs
- Permuted puzzles and cryptographic hardness
- Private anonymous data access
- Reusable garbled circuits and succinct functional encryption
- Reusable garbled deterministic finite automata from learning with errors
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Secure multiparty RAM computation in constant rounds
- Software protection and simulation on oblivious RAMs
- Succinct garbling and indistinguishability obfuscation for RAM programs
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- Succinct randomized encodings and their applications
- Towards doubly efficient private information retrieval
- Two-round secure MPC from indistinguishability obfuscation
- Watermarking public-key cryptographic primitives
Cited in
(13)- Functional encryption for cubic polynomials and implementation
- Updatable functional encryption
- Forward secret encrypted RAM: lower bounds and applications
- Compactness vs collusion resistance in functional encryption
- On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
- The pseudorandom oracle model and ideal obfuscation
- Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
- Laconic function evaluation, functional encryption and obfuscation for RAMs with sublinear computation
- Certified everlasting secure collusion-resistant functional encryption, and more
- Key-homomorphic computations for RAM: fully succinct randomised encodings and more
- Adaptively secure streaming functional encryption
- Attribute-based encryption for circuits of unbounded depth from lattices: garbled circuits of optimal size, laconic functional evaluation, and more
- How to copy-protect malleable-puncturable cryptographic functionalities under arbitrary challenge distributions: a unified solution to quantum protection
This page was built for publication: Collusion-resistant functional encryption for RAMs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135396)
