How to use indistinguishability obfuscation
From MaRDI portal
Publication:5259583
DOI10.1145/2591796.2591825zbMATH Open1315.94102OpenAlexW1984153141WikidataQ130858505 ScholiaQ130858505MaRDI QIDQ5259583FDOQ5259583
Authors: Amit Sahai, Brent Waters 
Publication date: 26 June 2015
Published in: Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2591796.2591825
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
- Theory of Cryptography
- On the geometry of differential privacy
- Interactive privacy via the median mechanism
- The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
- Lower bounds in differential privacy
- Iterative Constructions and Private Data Release
- Differential privacy and the fat-shattering dimension of linear queries
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- On the complexity of differentially private data release, efficient algorithms and hardness results
- Title not available (Why is that?)
- Collusion-secure fingerprinting for digital data
- Advances in Cryptology – CRYPTO 2004
- Title not available (Why is that?)
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
- Bounds on the sample complexity for private learning and private data release
- Answering \(n^{2+o(1)}\) counting queries with differential privacy is hard
- Characterizing the sample complexity of private learners
- Faster algorithms for privately releasing marginals
- Faster private release of marginals on small databases
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- Efficient algorithms for privately releasing marginals via convex relaxations
Cited In (only showing first 100 items - show all)
- Leakage resilience from program obfuscation
- Delegation with updatable unambiguous proofs and PPAD-hardness
- KDM security for identity-based encryption: constructions and separations
- Functional broadcast encryption with applications to data sharing for cloud storage
- Constant-size CCA-secure multi-hop unidirectional proxy re-encryption from indistinguishability obfuscation
- Hidden cosets and applications to unclonable cryptography
- On constructing one-way permutations from indistinguishability obfuscation
- Toward non-interactive zero-knowledge proofs for NP from LWE
- Title not available (Why is that?)
- Deniable Attribute Based Encryption for Branching Programs from LWE
- Subverting deniability
- The magic of ELFs
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
- Session resumption protocols and efficient forward security for TLS 1.3 0-RTT
- Deniable fully homomorphic encryption from learning with errors
- Watermarking cryptographic capabilities
- Universal ring signatures in the standard model
- Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof?
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- Constrained (Verifiable) Pseudorandom Function from Functional Encryption
- The journey from NP to TFNP hardness
- Simpler constructions of asymmetric primitives from obfuscation
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Spooky interaction and its discontents: compilers for succinct two-message argument systems
- Adaptive multiparty NIKE
- Constraining and watermarking PRFs from milder assumptions
- Contention in cryptoland: obfuscation, leakage and UCE
- On statistically secure obfuscation with approximate correctness
- Security reductions for white-box key-storage in mobile payments
- COA-secure obfuscation and applications
- Cryptanalysis of candidate obfuscators for affine determinant programs
- On the multi-user security of short Schnorr signatures with preprocessing
- Constrained PRFs for unbounded inputs with short keys
- Compact designated verifier NIZKs from the CDH assumption without pairings
- Candidate iO from homomorphic encryption schemes
- Compact NIZKs from standard assumptions on bilinear maps
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
- Private information retrieval with sublinear online time
- Statistical ZAP arguments
- Non-interactive zero knowledge from sub-exponential DDH
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
- Constrained pseudorandom functions for unconstrained inputs revisited: achieving verifiability and key delegation
- Reconfigurable cryptography: a flexible approach to long-term security
- Cryptography with updates
- Shorter circuit obfuscation in challenging security models
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- Witness maps and applications
- On access control encryption without sanitization
- On selective-opening security of deterministic primitives
- Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
- Adaptively secure constrained pseudorandom functions in the standard model
- Amplifying the security of functional encryption, unconditionally
- Deniable searchable symmetric encryption
- Towards tight adaptive security of non-interactive key exchange
- Constrained pseudorandom functions from functional encryption
- A new approach to efficient non-malleable zero-knowledge
- Functional encryption for cubic polynomials and implementation
- Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
- Bounded KDM security from iO and OWF
- Fully deniable interactive encryption
- How to Generate and Use Universal Samplers
- On Removing Graded Encodings from Functional Encryption
- Succinct classical verification of quantum computation
- Point-function obfuscation: a framework and generic constructions
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Signatures Resilient to Uninvertible Leakage
- Function-private functional encryption in the private-key setting
- Quantum-access-secure message authentication via blind-unforgeability
- 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
- Cutting-edge cryptography through the lens of secret sharing
- Strong hardness of privacy from weak traitor tracing
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Towards breaking the exponential barrier for general secret sharing
- Limits on the efficiency of (ring) LWE-based non-interactive key exchange
- Survey of information security
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
- A new paradigm for public-key functional encryption for degree-2 polynomials
- 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
- How to avoid obfuscation using witness PRFs
- 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
- Fiat-Shamir for highly sound protocols is instantiable
- Better two-round adaptive multi-party computation
- Constraining pseudorandom functions privately
- From Minicrypt to Obfustopia via private-key functional encryption
- Patchable indistinguishability obfuscation: \(i\mathcal {O}\) for evolving software
- Breaking the sub-exponential barrier in obfustopia
- Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
- Lattice-based SNARGs and their application to more efficient obfuscation
- Private puncturable PRFs from standard lattice assumptions
Uses Software
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)
