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)- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
- Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications
- Simultaneous-message and succinct secure computation
- Unique NIZKs and steganography detection
- Towards tight adaptive security of non-interactive key exchange
- Adaptively secure MPC with sublinear communication complexity
- Functional encryption for randomized functionalities in the private-key setting from minimal assumptions
- A modular approach to unclonable cryptography
- Non-interactive zero-knowledge from LPN and MQ
- Time-lock puzzles from lattices
- Backward private dynamic searchable encryption with update pattern
- On quantum money and evasive obfuscation
- Quasi-linear indistinguishability obfuscation via mathematical proofs of equivalence and applications
- Universal computational extractors and multi-bit AIPO from lattice assumptions
- Generic anamorphic encryption, revisited: new limitations and constructions
- Somewhat homomorphic encryption from linear homomorphism and sparse LPN
- Symmetric Key Exchange with Full Forward Security and Robust Synchronization
- Constrained pseudorandom functions from functional encryption
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
- Homomorphic indistinguishability obfuscation and its applications
- The Complexity of Public-Key Cryptography
- Adaptively sound zero-knowledge SNARKs for UP
- Adaptive security in SNARGs via iO and lossy functions
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation
- A new approach to efficient non-malleable zero-knowledge
- NIZK from SNARGs
- Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)
- An efficient structural attack on NIST submission DAGS
- Complexity theory. Abstracts from the workshop held June 2--7, 2024
- On the existence of extractable one-way functions
- Efficiently obfuscating re-encryption program under DDH assumption
- Dynamic collusion bounded functional encryption from identity-based encryption
- One-Way Functions and (Im)perfect Obfuscation
- Optimal bounded-collusion secure functional encryption
- Indistinguishability obfuscation: from approximate to exact
- Short attribute-based signatures for arbitrary Turing machines from standard assumptions
- Adaptively secure puncturable pseudorandom functions via puncturable identity-based KEMs
- Functional encryption for cubic polynomials and implementation
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- Fully deniable interactive encryption
- Deniable cryptosystems: simpler constructions and achieving leakage resilience
- Bounded KDM security from iO and OWF
- Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
- Robust transforming combiners from indistinguishability obfuscation to functional encryption
- Leakage resilience from program obfuscation
- Puncturable key wrapping and its applications
- Chosen ciphertext security via BARGs
- Deny whatever you want: dual-deniable public-key encryption
- Securely instantiating `Half Gates' garbling in the standard model
- Non-interactive key exchange: new notions, new constructions, and forward security
- Non-committing identity based encryption: constructions and applications
- Adaptively-secure big-key identity-based encryption
- Black-box timed commitments from time-lock puzzles
- Unclonable cryptography with unbounded collusions and impossibility of hyperefficient shadow tomography
- Multi-authority functional encryption with bounded collusions from standard assumptions
- Batching adaptively-sound SNARGs for NP
- Unbounded leakage-resilience and intrusion-detection in a quantum world
- Towards general-purpose program obfuscation via local mixing
- Indistinguishability obfuscation from bilinear maps and LPN variants
- Signature-based witness encryption with compact ciphertext
- 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
- Leakage-resilient incompressible cryptography: constructions and barriers
- 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
- Indistinguishability obfuscation from well-founded assumptions
- 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
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)
