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)- The magic of ELFs
- (Commit-and-prove) predictable arguments with privacy
- New techniques for traitor tracing: size \(N^{1/3}\) and more from pairings
- On succinct arguments and witness encryption from groups
- (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin
- BETA: biometric-enabled threshold authentication
- Universal proxy re-encryption
- Multi-input quadratic functional encryption from pairings
- Universal ring signatures in the standard model
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Witness encryption and null-iO from evasive LWE
- Weak Zero-Knowledge beyond the Black-Box Barrier
- On statistically secure obfuscation with approximate correctness
- Statistical security in two-party computation revisited
- Fully-secure MPC with minimal trust
- Watermarking cryptographic functionalities from standard lattice assumptions
- Candidate obfuscation via oblivious LWE sampling
- New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption
- Secure software leasing
- Towards accountability in CRS generation
- Efficient lattice-based inner-product functional encryption
- Amplifying the security of functional encryption, unconditionally
- Verifiable registration-based encryption
- Adaptive-secure identity-based inner-product functional encryption and its leakage-resilience
- Reconfigurable cryptography: a flexible approach to long-term security
- Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
- The complexity of differential privacy
- Spooky interaction and its discontents: compilers for succinct two-message argument systems
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
- Deniable Attribute Based Encryption for Branching Programs from LWE
- Cryptography with updates
- Watermarking cryptographic capabilities
- Predicate encryption from bilinear maps and one-sided probabilistic rank
- Deniable fully homomorphic encryption from learning with errors
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
- Access Control Encryption for Equality, Comparison, and More
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Contention in cryptoland: obfuscation, leakage and UCE
- Functional encryption for set intersection in the multi-client setting
- On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
- On Adaptively Secure Multiparty Computation with a Short CRS
- Offline witness encryption with semi-adaptive security
- ABE for circuits with constant-size secret keys and adaptive security
- Attribute-based access control for inner product functional encryption from LWE
- Reusable two-round MPC from LPN
- Cross-domain attribute-based access control encryption
- Optimizing registration based encryption
- Functional encryption: deterministic to randomized functions from simple assumptions
- Cryptanalysis of candidate obfuscators for affine determinant programs
- Distributed (correlation) samplers: how to remove a trusted dealer in one round
- Incompressible cryptography
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- On the multi-user security of short Schnorr signatures with preprocessing
- Unclonable polymers and their cryptographic applications
- Circular Security Separations for Arbitrary Length Cycles from LWE
- Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions
- 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
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)
