Candidate indistinguishability obfuscation and functional encryption for all circuits
From MaRDI portal
Publication:2816296
Recommendations
- Indistinguishability obfuscation from functional encryption
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- On extractability obfuscation
- Limits on the power of indistinguishability obfuscation and functional encryption
Cites work
- scientific article; zbMATH DE number 1583797 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- scientific article; zbMATH DE number 1406785 (Why is no real title available?)
- scientific article; zbMATH DE number 4185024 (Why is no real title available?)
- (Leveled) fully homomorphic encryption without bootstrapping
- Advances in Cryptology - EUROCRYPT 2004
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Attribute-based encryption for circuits
- Attribute-based encryption for circuits from multilinear maps
- Bit commitment using pseudorandomness
- Candidate Multilinear Maps from Ideal Lattices
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Computational Complexity
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption over the integers with shorter public keys
- Fully homomorphic encryption using ideal lattices
- Functional encryption for inner product predicates from learning with errors
- Functional encryption with bounded collusions via multi-party computation
- Functional encryption: definitions and challenges
- Functional encryption: new perspectives and lower bounds
- Fuzzy Identity-Based Encryption
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- How to delegate and verify in public: verifiable computation from attribute-based encryption
- How to obfuscate programs directly
- Identity-based cryptosystems and signature schemes
- Making NTRU as secure as worst-case problems over ideal lattices
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Obfuscating circuits via composite-order graded encoding
- On Best-Possible Obfuscation
- On the (im)possibility of obfuscating programs
- On the achievability of simulation-based security for functional encryption
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Perfect Non-interactive Zero Knowledge for NP
- Practical multilinear maps over the integers
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Reusable garbled circuits and succinct functional encryption
- Semantically secure order-revealing encryption: multi-input functional encryption without obfuscation
- Trapdoors for hard lattices and new cryptographic constructions
- Witness encryption and its applications
Cited in
(only showing first 100 items - show all)- Efficient and scalable universal circuits
- On the security of functional encryption in the generic group model
- Functional encryption against probabilistic queries: definition, construction and applications
- On the implausibility of constant-round public-coin zero-knowledge proofs
- Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions
- Leakage resilience from program obfuscation
- Matrix PRFs: constructions, attacks, and applications to obfuscation
- Hardness of continuous local search: query complexity and cryptographic lower bounds
- Cryptographic agents: towards a unified theory of computing on encrypted data
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
- Generalized hardness assumption for self-bilinear map with auxiliary information
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Multi-input quadratic functional encryption: stronger security, broader functionality
- (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps
- Obfuscating finite automata
- How to Generate and Use Universal Samplers
- mrNISC from LWE with polynomial modulus
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes
- Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \)
- On Removing Graded Encodings from Functional Encryption
- Structure-preserving compilers from new notions of obfuscations
- Three-round secure multiparty computation from black-box two-round oblivious transfer
- Offline witness encryption with semi-adaptive security
- Candidate iO from homomorphic encryption schemes
- Another step towards realizing random oracles: non-malleable point obfuscation
- Permuted puzzles and cryptographic hardness
- Functional broadcast encryption with applications to data sharing for cloud storage
- Multi-input non-interactive functional encryption: constructions and applications
- How to Compute in the Presence of Leakage
- Cryptanalysis of the CLT13 multilinear map
- (Inner-product) functional encryption with updatable ciphertexts
- SNARGs for monotone policy batch NP
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Reusable two-round MPC from LPN
- Lattice-based cryptography: a survey
- An improved affine equivalence algorithm for random permutations
- Efficient obfuscation for CNF circuits and applications in cloud computing
- On extractability obfuscation
- On constructing one-way permutations from indistinguishability obfuscation
- Random walks and concurrent zero-knowledge
- Point-function obfuscation: a framework and generic constructions
- Generic constructions of master-key KDM secure attribute-based encryption
- Computational wiretap coding from indistinguishability obfuscation
- The pseudorandom oracle model and ideal obfuscation
- Public key encryption with equality test from generic assumptions in the random oracle model
- Signatures Resilient to Uninvertible Leakage
- Function-private functional encryption in the private-key setting
- scientific article; zbMATH DE number 6866298 (Why is no real title available?)
- Deniable Attribute Based Encryption for Branching Programs from LWE
- Fully secure functional encryption with a large class of relations from the decisional linear assumption
- White-box cryptography: don't forget about grey-box attacks
- The magic of ELFs
- Non-interactive anonymous router with quasi-linear router computation
- Fully secure functional encryption for inner products, from standard assumptions
- Designing proof of human-work puzzles for cryptocurrency and beyond
- Universal samplers with fast verification
- CCA-secure inner-product functional encryption from projective hash functions
- Multi-input inner-product functional encryption from pairings
- Simplifying design and analysis of complex predicate encryption schemes
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
- Registration-based encryption: removing private-key generator from IBE
- Upgrading to functional encryption
- A ciphertext-size lower bound for order-preserving encryption with limited leakage
- A simple construction of iO for Turing machines
- Fine-grained secure computation
- FE and iO for Turing machines from minimal assumptions
- Return of GGH15: provable security against zeroizing attacks
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks
- Watermarking PRFs under standard assumptions: public marking and security with extraction queries
- How to build time-lock encryption
- Time-release cryptography from minimal circuit assumptions
- Multilinear maps from obfuscation
- Cutting-edge cryptography through the lens of secret sharing
- Verifiable functional encryption
- Strong hardness of privacy from weak traitor tracing
- Survey of information security
- Deniable fully homomorphic encryption from learning with errors
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
- Minicrypt primitives with algebraic structure and applications
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
- Functional encryption without obfuscation
- Cryptanalysis of GGH15 multilinear maps
- Indistinguishability obfuscation from compact functional encryption
- On the power of rewinding simulators in functional encryption
- Indistinguishability obfuscation from functional encryption
- Witness encryption from smooth projective hashing system
- Multi-input functional encryption and its application in outsourcing computation
- Multi-client functional encryption for separable functions
- Multi-input functional encryption with unbounded-message security
- Private functional encryption: indistinguishability-based definitions and constructions from obfuscation
- Watermarking cryptographic functionalities from standard lattice assumptions
- Impossibility of VBB obfuscation with ideal constant-degree graded encodings
- Lower bounds on assumptions behind indistinguishability obfuscation
- Output-compressing randomized encodings and applications
- Order-revealing encryption and the hardness of private learning
- Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
- Cryptographic assumptions: a position paper
- Watermarking cryptographic capabilities
- How to avoid obfuscation using witness PRFs
- On zero-knowledge with strict polynomial-time simulation and extraction from differing-input obfuscation for circuits
This page was built for publication: Candidate indistinguishability obfuscation and functional encryption for all circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2816296)
