How to use indistinguishability obfuscation
From MaRDI portal
Publication:5259583
Recommendations
- How to use indistinguishability obfuscation: deniable encryption, and more
- Using indistinguishability obfuscation via UCEs
- Indistinguishability obfuscation with non-trivial efficiency
- Indistinguishability obfuscation: from approximate to exact
- Indistinguishability obfuscation from functional encryption
- Indistinguishability obfuscation from compact functional encryption
- scientific article; zbMATH DE number 1088228
- Practical Deniable Encryption
- Limits on the power of indistinguishability obfuscation and functional encryption
- Indistinguishability obfuscation from circular security
Cites work
- scientific article; zbMATH DE number 5485440 (Why is no real title available?)
- scientific article; zbMATH DE number 5485574 (Why is no real title available?)
- Advances in Cryptology – CRYPTO 2004
- Answering \(n^{2+o(1)}\) counting queries with differential privacy is hard
- Bounds on the sample complexity for private learning and private data release
- Characterizing the sample complexity of private learners
- Collusion-secure fingerprinting for digital data
- Differential privacy and the fat-shattering dimension of linear queries
- Efficient algorithms for privately releasing marginals via convex relaxations
- Faster algorithms for privately releasing marginals
- Faster private release of marginals on small databases
- Interactive privacy via the median mechanism
- Iterative Constructions and Private Data Release
- Lower bounds in differential privacy
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
- On the complexity of differentially private data release, efficient algorithms and hardness results
- On the geometry of differential privacy
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
- Theory of Cryptography
Cited in
(only showing first 100 items - show all)- Leakage resilience from program obfuscation
- Puncturable key wrapping and its applications
- Delegation with updatable unambiguous proofs and PPAD-hardness
- KDM security for identity-based encryption: constructions and separations
- How to Generate and Use Universal Samplers
- Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \)
- On Removing Graded Encodings from Functional Encryption
- Public-key watermarking schemes for pseudorandom functions
- On black-box knowledge-sound commit-and-prove SNARKs
- Structure-preserving compilers from new notions of obfuscations
- Candidate iO from homomorphic encryption schemes
- Succinct classical verification of quantum computation
- Functional broadcast encryption with applications to data sharing for cloud storage
- (Inner-product) functional encryption with updatable ciphertexts
- SNARGs for monotone policy batch NP
- Constant-size CCA-secure multi-hop unidirectional proxy re-encryption from indistinguishability obfuscation
- Hidden cosets and applications to unclonable cryptography
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- On constructing one-way permutations from indistinguishability obfuscation
- Point-function obfuscation: a framework and generic constructions
- The pseudorandom oracle model and ideal obfuscation
- Toward non-interactive zero-knowledge proofs for NP from LWE
- 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
- Quantum-access-secure message authentication via blind-unforgeability
- The magic of ELFs
- Beyond software watermarking: traitor-tracing for pseudorandom functions
- Designing proof of human-work puzzles for cryptocurrency and beyond
- Subverting deniability
- Universal samplers with fast verification
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
- Cutting-edge cryptography through the lens of secret sharing
- Upgrading to functional encryption
- A simple construction of iO for Turing machines
- FE and iO for Turing machines from minimal assumptions
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks
- The final nail in the coffin of statistically-secure obfuscator
- Session resumption protocols and efficient forward security for TLS 1.3 0-RTT
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Towards breaking the exponential barrier for general secret sharing
- Cutting-edge cryptography through the lens of secret sharing
- Strong hardness of privacy from weak traitor tracing
- Limits on the efficiency of (ring) LWE-based non-interactive key exchange
- Survey of information security
- Deniable fully homomorphic encryption from learning with errors
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
- Fiat-Shamir for highly sound protocols is instantiable
- Lower bounds on assumptions behind indistinguishability obfuscation
- Output-compressing randomized encodings and applications
- Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
- Watermarking cryptographic capabilities
- How to avoid obfuscation using witness PRFs
- A new paradigm for public-key functional encryption for degree-2 polynomials
- Fiat-Shamir for highly sound protocols is instantiable
- Limits on the power of indistinguishability obfuscation and functional encryption
- Compactness vs collusion resistance in functional encryption
- Single-key to multi-key functional encryption with polynomial loss
- Compact NIZKs from standard assumptions on bilinear maps
- 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
- Nonmalleable digital lockers and robust fuzzy extractors in the plain model
- Better two-round adaptive multi-party computation
- 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
- Private puncturable PRFs from standard lattice assumptions
- Leakage-resilient IND-CCA KEM from the extractable hash proofs with indistinguishability obfuscation
- From cryptomania to obfustopia through secret-key functional encryption
- From minicrypt to obfustopia via private-key functional encryption
- Steganography-free zero-knowledge
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
- On constructing one-way permutations from indistinguishability obfuscation
- On the correlation intractability of obfuscated pseudorandom functions
- Universal ring signatures in the standard model
- Registered (inner-product) functional encryption
- A plausibly deniable encryption scheme utilizing PUF's thermo-sensitivity
- Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof?
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- Can PPAD hardness be based on standard cryptographic assumptions?
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Explainable arguments
- Simple and generic constructions of succinct functional encryption
- Constrained (Verifiable) Pseudorandom Function from Functional Encryption
- On the complexity of compressing obfuscation
- Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
- Secret-sharing for NP
- The journey from NP to TFNP hardness
- Impossibilities in succinct arguments: black-box extraction and more
- A map of witness maps: new definitions and connections
- The Boneh-Katz transformation, revisited: pseudorandom/obliviously-samplable PKE from lattices and codes and its application
- Simpler constructions of asymmetric primitives from obfuscation
- Instantiability of classical random-oracle-model encryption transforms
- Collusion-resistant functional encryption for RAMs
- CCA-secure keyed-fully homomorphic encryption
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
This page was built for publication: How to use indistinguishability obfuscation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5259583)
