On the Existence of Extractable One-Way Functions
From MaRDI portal
Publication:2829449
DOI10.1137/140975048zbMath1353.94039OpenAlexW2541837597MaRDI QIDQ2829449
Omer Paneth, Alon Rosen, Ran Canetti, Nir Bitansky
Publication date: 28 October 2016
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/107895
Related Items (5)
Toward RSA-OAEP Without Random Oracles ⋮ Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge ⋮ Plumo: an ultralight blockchain client ⋮ Verifiable private information retrieval ⋮ Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth projective hashing and two-message oblivious transfer
- Minimum disclosure proofs of knowledge
- A uniform-complexity treatment of encryption and zero-knowledge
- Definitions and properties of zero-knowledge proof systems
- The hunting of the SNARK
- Lower bounds for non-black-box zero knowledge
- Limits of Extractability Assumptions with Distributional Auxiliary Input
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Targeted malleability
- Constrained Pseudorandom Functions and Their Applications
- Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes
- Secure Two-Party Computation with Low Communication
- Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
- Simultaneously Resettable Arguments of Knowledge
- Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits
- Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
- Succinct Garbling and Indistinguishability Obfuscation for RAM Programs
- Succinct Randomized Encodings and their Applications
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Succinct NP Proofs from an Extractability Assumption
- Extractable Perfectly One-Way Functions
- i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- Towards a Theory of Extractable Functions
- Polylogarithmic two-round argument systems
- Universal Arguments and their Applications
- The Knowledge Complexity of Interactive Proof Systems
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
- Computationally Sound Proofs
- Foundations of Cryptography
- On the Composition of Zero-Knowledge Proof Systems
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Candidate Multilinear Maps from Ideal Lattices
- Quadratic Span Programs and Succinct NIZKs without PCPs
- How to use indistinguishability obfuscation
- How to delegate computations
- Advances in Cryptology – CRYPTO 2004
- Functional Signatures and Pseudorandom Functions
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Advances in Cryptology - CRYPTO 2003
- Zaps and Their Applications
- Towards Plaintext-Aware Public-Key Encryption Without Random Oracles
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- On the impossibility of approximate obfuscation and applications to resettable cryptography
- One-Way Functions and (Im)perfect Obfuscation
- On the Composition of Public-Coin Zero-Knowledge Protocols
This page was built for publication: On the Existence of Extractable One-Way Functions
