On the existence of extractable one-way functions

DOI10.1145/2591796.2591859zbMath1315.94059OpenAlexW2090853363MaRDI QIDQ5259586

Omer Paneth, Alon Rosen, Nir Bitansky, Ran Canetti

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: http://hdl.handle.net/1721.1/107895

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (30)

Practical algorithm substitution attack on extractable signatures ⋮ Toward RSA-OAEP Without Random Oracles ⋮ 3-Message Zero Knowledge Against Human Ignorance ⋮ On the (In)Security of SNARKs in the Presence of Oracles ⋮ A note on perfect correctness by derandomization ⋮ On the (In)security of Kilian-based SNARGs ⋮ On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption ⋮ On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input ⋮ NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion ⋮ A Shuffle Argument Secure in the Generic Model ⋮ 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 ⋮ The hunting of the SNARK ⋮ Non-interactive zero-knowledge from non-interactive batch arguments ⋮ Reductions in \textbf{PPP} ⋮ Magic Adversaries Versus Individual Reduction: Science Wins Either Way ⋮ Contention in Cryptoland: Obfuscation, Leakage and UCE ⋮ Point-Function Obfuscation: A Framework and Generic Constructions ⋮ On subversion-resistant SNARKs ⋮ The magic of ELFs ⋮ The Magic of ELFs ⋮ Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics ⋮ A Note on Perfect Correctness by Derandomization ⋮ Lattice-Based SNARGs and Their Application to More Efficient Obfuscation ⋮ Weak Zero-Knowledge beyond the Black-Box Barrier ⋮ On instantiating the algebraic group model from falsifiable assumptions ⋮ Succinct non-interactive secure computation

Uses Software

• SuLQ

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: On the existence of extractable one-way functions