How to use indistinguishability obfuscation
From MaRDI portal
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
- 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
- scientific article; zbMATH DE number 5485440 (Why is no real title available?)
- scientific article; zbMATH DE number 5485574 (Why is no real title available?)
- 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)- 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
- On the bit security of cryptographic primitives
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Towards breaking the exponential barrier for general secret sharing
- Proofs of Work from worst-case assumptions
- On virtual grey box obfuscation for general circuits
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
- Leakage-resilient cryptography from puncturable primitives and obfuscation
- Functional encryption for randomized functionalities in the private-key setting from minimal assumptions
- Function-private functional encryption in the private-key setting
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
- Functional encryption for cubic polynomials and implementation
- Compact designated verifier NIZKs from the CDH assumption without pairings
- Limits on the efficiency of (ring) LWE-based non-interactive key exchange
- Private information retrieval with sublinear online time
- Candidate iO from homomorphic encryption schemes
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Compact NIZKs from standard assumptions on bilinear maps
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
- Statistical ZAP arguments
- Quantum-access-secure message authentication via blind-unforgeability
- 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
- 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
- Fully deniable interactive encryption
- Delegation with updatable unambiguous proofs and PPAD-hardness
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- Hidden cosets and applications to unclonable cryptography
- Deniable fully homomorphic encryption from learning with errors
- Constructions for quantum indistinguishability obfuscation
- Simpler constructions of asymmetric primitives from obfuscation
- Cryptanalysis of candidate obfuscators for affine determinant programs
- COA-secure obfuscation and applications
- On the multi-user security of short Schnorr signatures with preprocessing
- Dynamic collusion bounded functional encryption from identity-based encryption
- From cryptomania to obfustopia through secret-key functional encryption
- From minicrypt to obfustopia via private-key functional encryption
- Optimal bounded-collusion secure functional encryption
- KDM security for identity-based encryption: constructions and separations
- Functional broadcast encryption with applications to data sharing for cloud storage
- Constrained pseudorandom functions from functional encryption
- Deniable searchable symmetric encryption
- Leakage resilience from program obfuscation
- The magic of ELFs
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
- Survey of information security
- Secret-sharing for NP
- On constructing one-way permutations from indistinguishability obfuscation
- Toward non-interactive zero-knowledge proofs for NP from LWE
- Security reductions for white-box key-storage in mobile payments
- Towards tight adaptive security of non-interactive key exchange
- Short attribute-based signatures for arbitrary Turing machines from standard assumptions
- Lower bounds on assumptions behind indistinguishability obfuscation
- Indistinguishability obfuscation: from approximate to exact
- Output-compressing randomized encodings and applications
- On the correlation intractability of obfuscated pseudorandom functions
- Reconfigurable cryptography: a flexible approach to long-term security
- Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
- CCA-secure keyed-fully homomorphic encryption
- How to avoid obfuscation using witness PRFs
- Cutting-edge cryptography through the lens of secret sharing
- On constructing one-way permutations from indistinguishability obfuscation
- Contention in cryptoland: obfuscation, leakage and UCE
- Point-function obfuscation: a framework and generic constructions
- Constrained PRFs for unbounded inputs with short keys
- Fiat-Shamir for highly sound protocols is instantiable
- Signatures Resilient to Uninvertible Leakage
- Shorter circuit obfuscation in challenging security models
- Bounded KDM security from iO and OWF
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
- On statistically secure obfuscation with approximate correctness
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- On the existence of extractable one-way functions
- Spooky interaction and its discontents: compilers for succinct two-message argument systems
- Fine-Grained Cryptography
- How to Generate and Use Universal Samplers
- Leakage-resilient IND-CCA KEM from the extractable hash proofs with indistinguishability obfuscation
- 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
- Deniable Attribute Based Encryption for Branching Programs from LWE
- Single-key to multi-key functional encryption with polynomial loss
- Compactness vs collusion resistance in functional encryption
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)
