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)- Practical witness-key-agreement for blockchain-based dark pools financial trading
- Dynamic collusion bounded functional encryption from identity-based encryption
- Obfuscation combiners
- Efficient and Provable White-Box Primitives
- scientific article; zbMATH DE number 7561499 (Why is no real title available?)
- Patchable indistinguishability obfuscation: \(i\mathcal {O}\) for evolving software
- Breaking the sub-exponential barrier in obfustopia
- Lattice-based SNARGs and their application to more efficient obfuscation
- Constraining pseudorandom functions privately
- From Minicrypt to Obfustopia via private-key functional encryption
- Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
- Finding shortest lattice vectors in the presence of gaps
- Simple and efficient FE for quadratic functions
- Signatures Resilient to Uninvertible Leakage
- Efficient obfuscation for CNF circuits and applications in cloud computing
- Cryptographic agents: towards a unified theory of computing on encrypted data
- Secure multiparty RAM computation in constant rounds
- Semi-adaptive security and bundling functionalities made generic and easy
- Obfuscating circuits via composite-order graded encoding
- Attribute based encryption for deterministic finite automata from DLIN
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact
- Dual system framework in multilinear settings and applications to fully secure (compact) ABE for unbounded-size circuits
- Multi-input non-interactive functional encryption: constructions and applications
- Hardness of \(k\)-LWE and applications in traitor tracing
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- On virtual grey box obfuscation for general circuits
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
- Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications
- Offline witness encryption
- Generalized hardness assumption for self-bilinear map with auxiliary information
- Matrix PRFs: constructions, attacks, and applications to obfuscation
- Candidate iO from homomorphic encryption schemes
- Compact NIZKs from standard assumptions on bilinear maps
- Optimal broadcast encryption from pairings and LWE
- Software watermarking: a semantics-based approach
- Multilinear maps from obfuscation
- Functional encryption for cubic polynomials and implementation
- Algorithms for CRT-variant of approximate greatest common divisor problem
- Cumulatively all-lossy-but-one trapdoor functions from standard assumptions
- Adaptive simulation security for inner product functional encryption
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Multi-input functional encryption and its application in outsourcing computation
- Structure versus hardness through the obfuscation lens
- Proofs of Work from worst-case assumptions
- Lower bounds on obfuscation from all-or-nothing encryption primitives
- Decentralized multi-client functional encryption for inner product
- Multi-input functional encryption with unbounded-message security
- Private functional encryption: indistinguishability-based definitions and constructions from obfuscation
- How to Generate and Use Universal Samplers
- Function-private functional encryption in the private-key setting
- Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation
- On the complexity of compressing obfuscation
- Functional encryption for randomized functionalities in the private-key setting from minimal assumptions
- Hardness of continuous local search: query complexity and cryptographic lower bounds
- Efficient and scalable universal circuits
- Three-round secure multiparty computation from black-box two-round oblivious transfer
- Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
- scientific article; zbMATH DE number 6866300 (Why is no real title available?)
- Three-round public-coin bounded-auxiliary-input zero-knowledge arguments of knowledge
- Fully secure functional encryption with a large class of relations from the decisional linear assumption
- Public key encryption with equality test from generic assumptions in the random oracle model
- White-box cryptography: don't forget about grey-box attacks
- Practical multi-party quantum homomorphic encryption
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
- Robust transforming combiners from indistinguishability obfuscation to functional encryption
- On Removing Graded Encodings from Functional Encryption
- Lattice-based cryptography: a survey
- Witness encryption from smooth projective hashing system
- Limits on the power of indistinguishability obfuscation and functional encryption
- Delegating RAM computations with adaptive soundness and privacy
- Compactness vs collusion resistance in functional encryption
- Single-key to multi-key functional encryption with polynomial loss
- Combiners for functional encryption, unconditionally
- Fully secure functional encryption for inner products, from standard assumptions
- On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models
- On the round complexity of black-box secure MPC
- 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
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Practical order-revealing encryption with limited leakage
- Indistinguishability obfuscation from functional encryption
- Access control encryption: enforcing information flow with cryptography
- 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
- Registration-based encryption: removing private-key generator from IBE
- Upgrading to functional encryption
- Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs
- 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
- Receiver Selective Opening Security from Indistinguishability Obfuscation
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
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)
