On the existence of extractable one-way functions
From MaRDI portal
(Redirected from On the existence of extractable one-way functions)
On the existence of extractable one-way functions (scientific article; zbMATH DE number 6451580)
On the existence of extractable one-way functions (scientific article; zbMATH DE number 6451580)
Recommendations
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
(47)- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
- The hunting of the SNARK
- Reductions in \textbf{PPP}
- On subversion-resistant SNARKs
- Weakly extractable one-way functions
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- On instantiating the algebraic group model from falsifiable assumptions
- Succinct non-interactive secure computation
- Practical algorithm substitution attack on extractable signatures
- A note on perfect correctness by derandomization
- On the (In)security of Kilian-based SNARGs
- The magic of ELFs
- Limits of extractability assumptions with distributional auxiliary input
- Contention in cryptoland: obfuscation, leakage and UCE
- Point-function obfuscation: a framework and generic constructions
- On the existence of extractable one-way functions
- The Magic of ELFs
- On constant-round concurrent zero-knowledge from a knowledge assumption
- NIZKs with an untrusted CRS: security in the face of parameter subversion
- A shuffle argument secure in the generic model
- 3-message zero knowledge against human ignorance
- On the (in)security of SNARKs in the presence of oracles
- Extractable Perfectly One-Way Functions
- Absolute results concerning one-way functions and their applications
- Weak Zero-Knowledge beyond the Black-Box Barrier
- Toward RSA-OAEP without random oracles
- A note on perfect correctness by derandomization
- Lattice-based SNARGs and their application to more efficient obfuscation
- Explicit two-source extractors and resilient functions
- Magic adversaries versus individual reduction: science wins either way
- On extractability obfuscation
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Knowledge encryption and its applications to simulatable protocols with low round-complexity
- Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
- To label, or not to label (in generic groups)
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation
- Non-interactive zero-knowledge from non-interactive batch arguments
- A simple and efficient framework of proof systems for NP
- Witness semantic security
- Constant-size zk-SNARKs in ROM from falsifiable assumptions
- A pure indistinguishability obfuscation approach to adaptively-sound SNARGs for NP
- On deniable authentication against malicious verifiers
- Public-coin three-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
- Malleable SNARKs and their applications
- Batching adaptively-sound SNARGs for NP
- Single-round proofs of quantumness from knowledge assumptions
- On succinct non-interactive secure computation with malicious security
This page was built for publication: On the existence of extractable one-way functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5259586)
