How to use indistinguishability obfuscation
From MaRDI portal
Publication:5259583
DOI10.1145/2591796.2591825zbMath1315.94102OpenAlexW1984153141MaRDI QIDQ5259583
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
Related Items (only showing first 100 items - show all)
One-Way Functions and (Im)perfect Obfuscation ⋮ A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials ⋮ The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO ⋮ Witness Maps and Applications ⋮ Constraining and Watermarking PRFs from Milder Assumptions ⋮ The Journey from NP to TFNP Hardness ⋮ Fast and Adaptively Secure Signatures in the Random Oracle Model from Indistinguishability Obfuscation (Short Paper) ⋮ Single-Key to Multi-Key Functional Encryption with Polynomial Loss ⋮ Compactness vs Collusion Resistance in Functional Encryption ⋮ Designing Proof of Human-Work Puzzles for Cryptocurrency and Beyond ⋮ Watermarking Cryptographic Capabilities ⋮ Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings ⋮ Symmetric Key Exchange with Full Forward Security and Robust Synchronization ⋮ Explainable arguments ⋮ A map of witness maps: new definitions and connections ⋮ Structure-preserving compilers from new notions of obfuscations ⋮ White-box cryptography with global device binding from message-recoverable signatures and token-based obfuscation ⋮ Succinct classical verification of quantum computation ⋮ Batch arguments for \textsf{NP} and more from standard bilinear group assumptions ⋮ PI-Cut-Choo and friends: compact blind signatures via parallel instance cut-and-choose and more ⋮ NIZK from SNARGs ⋮ Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) ⋮ Adaptive multiparty NIKE ⋮ Puncturable key wrapping and its applications ⋮ On access control encryption without sanitization ⋮ Watermarkable public key encryption with efficient extraction under standard assumptions ⋮ Collusion-resistant functional encryption for RAMs ⋮ Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \) ⋮ (Inner-product) functional encryption with updatable ciphertexts ⋮ SNARGs for monotone policy batch NP ⋮ The pseudorandom oracle model and ideal obfuscation ⋮ Beyond software watermarking: traitor-tracing for pseudorandom functions ⋮ Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof? ⋮ The final nail in the coffin of statistically-secure obfuscator ⋮ Public-key watermarking schemes for pseudorandom functions ⋮ Constrained (Verifiable) Pseudorandom Function from Functional Encryption ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ Steganography-free zero-knowledge ⋮ Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation ⋮ Subverting deniability ⋮ Universal ring signatures in the standard model ⋮ Instantiability of classical random-oracle-model encryption transforms ⋮ Nonmalleable digital lockers and robust fuzzy extractors in the plain model ⋮ Impossibilities in succinct arguments: black-box extraction and more ⋮ Streaming functional encryption ⋮ How to use (plain) witness encryption: registered ABE, flexible broadcast, and more ⋮ A note on non-interactive zero-knowledge from CDH ⋮ Indistinguishability obfuscation ⋮ A Plausibly Deniable Encryption Scheme Utilizing PUF’s Thermo-Sensitivity ⋮ Structure Versus Hardness Through the Obfuscation Lens ⋮ On the complexity of compressing obfuscation ⋮ Better Two-Round Adaptive Multi-party Computation ⋮ Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation ⋮ Constraining Pseudorandom Functions Privately ⋮ Universal Samplers with Fast Verification ⋮ Separating IND-CPA and Circular Security for Unbounded Length Key Cycles ⋮ Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption ⋮ 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 ⋮ On Removing Graded Encodings from Functional Encryption ⋮ Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation ⋮ Cryptography with Updates ⋮ Candidate iO from homomorphic encryption schemes ⋮ Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness ⋮ Verifiable random functions from non-interactive witness-indistinguishable proofs ⋮ Simple and generic constructions of succinct functional encryption ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Constant-size CCA-secure multi-hop unidirectional proxy re-encryption from indistinguishability obfuscation ⋮ Simulation-based receiver selective opening CCA secure PKE from standard computational assumptions ⋮ Can PPAD hardness be based on standard cryptographic assumptions? ⋮ Session resumption protocols and efficient forward security for TLS 1.3 0-RTT ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ Unnamed Item ⋮ The Complexity of Public-Key Cryptography ⋮ Pseudorandom Functions: Three Decades Later ⋮ 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 ⋮ Hidden cosets and applications to unclonable cryptography ⋮ Deniable fully homomorphic encryption from learning with errors ⋮ Cutting-edge cryptography through the lens of secret sharing ⋮ Certifying trapdoor permutations, revisited ⋮ Upgrading to functional encryption ⋮ A simple construction of iO for Turing machines ⋮ Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ FE and iO for Turing machines from minimal assumptions ⋮ The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks ⋮ An efficient structural attack on NIST submission DAGS ⋮ Fiat-Shamir for highly sound protocols is instantiable ⋮ Limits on the Power of Indistinguishability Obfuscation and Functional Encryption ⋮ The GGM Function Family Is a Weakly One-Way Family of Functions ⋮ Strong Hardness of Privacy from Weak Traitor Tracing ⋮ Receiver Selective Opening Security from Indistinguishability Obfuscation ⋮ Constructions for quantum indistinguishability obfuscation ⋮ Deniable Attribute Based Encryption for Branching Programs from LWE ⋮ Survey of information security ⋮ Simpler constructions of asymmetric primitives from obfuscation ⋮ On the bit security of cryptographic primitives ⋮ Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient algorithms for privately releasing marginals via convex relaxations
- The Geometry of Differential Privacy: The Small Database and Approximate Cases
- Faster Algorithms for Privately Releasing Marginals
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- Privately Releasing Conjunctions and the Statistical Query Barrier
- 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
- Characterizing the sample complexity of private learners
- Faster private release of marginals on small databases
- Bounds on the Sample Complexity for Private Learning and Private Data Release
- Differential Privacy and the Fat-Shattering Dimension of Linear Queries
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
- Collusion-secure fingerprinting for digital data
- On the complexity of differentially private data release
- Advances in Cryptology – CRYPTO 2004
- Answering n {2+o(1)} counting queries with differential privacy is hard
- Theory of Cryptography
This page was built for publication: How to use indistinguishability obfuscation
