Indistinguishability obfuscation from well-founded assumptions
From MaRDI portal
Publication:6065171
DOI10.1145/3406325.3451093arXiv2008.09317OpenAlexW3082860856WikidataQ130961341 ScholiaQ130961341MaRDI QIDQ6065171
Huijia Lin, Amit Sahai, Aayush Jain
Publication date: 14 November 2023
Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.09317
Related Items (59)
Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration ⋮ Deniable fully homomorphic encryption from learning with errors ⋮ Counterexamples to new circular security assumptions underlying iO ⋮ Cryptanalysis of candidate obfuscators for affine determinant programs ⋮ Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) ⋮ Incompressible cryptography ⋮ Unclonable polymers and their cryptographic applications ⋮ Distributed (correlation) samplers: how to remove a trusted dealer in one round ⋮ Dynamic collusion bounded functional encryption from identity-based encryption ⋮ Bounded Collusion ABE for TMs from IBE ⋮ Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs ⋮ SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption ⋮ On the optimal succinctness and efficiency of functional encryption and attribute-based encryption ⋮ Registered attribute-based encryption ⋮ Multi-key and multi-input predicate encryption from learning with errors ⋮ Broadcast, trace and revoke with optimal parameters from polynomial hardness ⋮ Structure-preserving compilers from new notions of obfuscations ⋮ Beyond the Csiszár-Körner bound: best-possible wiretap coding via obfuscation ⋮ Transparent batchable time-lock puzzles and applications to Byzantine consensus ⋮ Pattern matching in encrypted stream from inner product encryption ⋮ Functional encryption against probabilistic queries: definition, construction and applications ⋮ Decentralized multi-authority attribute-based inner-product FE: large universe and unbounded ⋮ TIDE: a novel approach to constructing timed-release encryption ⋮ Unbounded predicate inner product functional encryption from pairings ⋮ Multi-input quadratic functional encryption: stronger security, broader functionality ⋮ Rate-1 incompressible encryption from standard assumptions ⋮ Fully-secure MPC with minimal trust ⋮ The power of natural properties as oracles ⋮ Homomorphic encryption: a mathematical survey ⋮ Trustworthy sealed-bid auction with low communication cost atop blockchain ⋮ Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes ⋮ Witness encryption and null-iO from evasive LWE ⋮ Worst-case subexponential attacks on PRGs of constant degree or constant locality ⋮ Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \) ⋮ Generic constructions of master-key KDM secure attribute-based encryption ⋮ The pseudorandom oracle model and ideal obfuscation ⋮ Computational wiretap coding from indistinguishability obfuscation ⋮ Candidate witness encryption from lattice techniques ⋮ Multi-input attribute based encryption and predicate encryption ⋮ Beyond software watermarking: traitor-tracing for pseudorandom functions ⋮ Forward-secure public key encryption without key update from proof-of-stake blockchain ⋮ Beyond the Csiszár-Korner bound: best-possible wiretap coding via obfuscation ⋮ Public-key watermarking schemes for pseudorandom functions ⋮ The direction of updatable encryption does matter ⋮ Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation ⋮ Lower bounds for the number of decryption updates in registration-based encryption ⋮ PPAD is as hard as LWE and iterated squaring ⋮ Instantiability of classical random-oracle-model encryption transforms ⋮ Impossibilities in succinct arguments: black-box extraction and more ⋮ Non-interactive zero-knowledge from non-interactive batch arguments ⋮ Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN ⋮ Streaming functional encryption ⋮ How to use (plain) witness encryption: registered ABE, flexible broadcast, and more ⋮ Indistinguishability obfuscation ⋮ Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) ⋮ Succinct LWE sampling, random polynomials, and obfuscation ⋮ Short attribute-based signatures for arbitrary Turing machines from standard assumptions ⋮ Candidate iO from homomorphic encryption schemes ⋮ Obfustopia built on secret-key functional encryption
This page was built for publication: Indistinguishability obfuscation from well-founded assumptions
