How to use polynomially-hard iO: Turing machine obfuscation and more
From MaRDI portal
Cites work
- A pure indistinguishability obfuscation approach to adaptively-sound SNARGs for NP
- Adaptive multiparty NIKE
- Adaptive NIKE for unbounded parties
- Adaptive security in SNARGs via iO and lossy functions
- Advances in Cryptology - CRYPTO 2003
- An algebraic framework for silent preprocessing with trustless setup and active security
- Breaking the sub-exponential barrier in obfustopia
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Constrained pseudorandom functions and their applications
- Constrained pseudorandom functions from homomorphic secret sharing
- Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
- Fiat-Shamir: from practice to theory
- Function secret sharing
- Functional signatures and pseudorandom functions
- Homomorphic time-lock puzzles and applications
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 3557241 (Why is no real title available?)
- scientific article; zbMATH DE number 1775406 (Why is no real title available?)
- scientific article; zbMATH DE number 7829334 (Why is no real title available?)
- Impossibilities in succinct arguments: black-box extraction and more
- Incrementally verifiable computation for NP from standard assumptions
- Indistinguishability obfuscation from bilinear maps and LPN variants
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation from functional encryption
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation from well-founded assumptions
- Indistinguishability obfuscation via mathematical proofs of equivalence
- Key-homomorphic computations for RAM: fully succinct randomised encodings and more
- Large message homomorphic secret sharing from DCR and applications
- Limits on the power of indistinguishability obfuscation and functional encryption
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Obfuscation from polynomial hardness: beyond decomposable obfuscation
- Obfuscation of probabilistic circuits and applications
- On homomorphic secret sharing from polynomial-modulus LWE
- On the (im)possibility of obfuscating programs (extended abstract)
- On the cryptographic hardness of finding a Nash equilibrium
- Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
- Privately constraining and programming PRFs, the LWE way
- Quasi-linear indistinguishability obfuscation via mathematical proofs of equivalence and applications
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Single-key to multi-key functional encryption with polynomial loss
- Spooky Encryption and Its Applications
- Structure vs. hardness through the obfuscation lens
- Succinct PPRFs via memory-tight reductions
- The Magic of ELFs
- The relative efficiency of propositional proof systems
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
- Time-lock puzzles from randomized encodings
- Transparent batchable time-lock puzzles and applications to Byzantine consensus
- Witness encryption and its applications
This page was built for publication: How to use polynomially-hard iO: Turing machine obfuscation and more
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443212)