On the existence of extractable one-way functions
From MaRDI portal
Publication:2829449
DOI10.1137/140975048zbMATH Open1353.94039OpenAlexW2541837597MaRDI QIDQ2829449FDOQ2829449
Authors: Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen 
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
Recommendations
Cites Work
- \(i\)-hop homomorphic encryption and rerandomizable Yao circuits
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Minimum disclosure proofs of knowledge
- Lower bounds for non-black-box zero knowledge
- Efficient oblivious transfer protocols
- Title not available (Why is that?)
- Simultaneously resettable arguments of knowledge
- Universal Arguments and their Applications
- Title not available (Why is that?)
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
- Foundations of Cryptography
- On the Composition of Zero-Knowledge Proof Systems
- Advances in Cryptology - CRYPTO 2003
- Definitions and properties of zero-knowledge proof systems
- The Knowledge Complexity of Interactive Proof Systems
- How to delegate computations
- Title not available (Why is that?)
- Zaps and Their Applications
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Title not available (Why is that?)
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- How to use indistinguishability obfuscation
- Separating succinct non-interactive arguments from all falsifiable assumptions
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Secure two-party computation with low communication
- Short pairing-based non-interactive zero-knowledge arguments
- Succinct NP Proofs from an Extractability Assumption
- Computationally Sound Proofs
- Title not available (Why is that?)
- Advances in Cryptology – CRYPTO 2004
- Smooth projective hashing and two-message oblivious transfer
- Towards a Theory of Extractable Functions
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Succinct non-interactive arguments via linear interactive proofs
- Quadratic span programs and succinct NIZKs without PCPs
- Candidate Multilinear Maps from Ideal Lattices
- One-Way Functions and (Im)perfect Obfuscation
- Title not available (Why is that?)
- Succinct randomized encodings and their applications
- Constrained pseudorandom functions and their applications
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- A uniform-complexity treatment of encryption and zero-knowledge
- Indistinguishability obfuscation for Turing machines with unbounded memory
- Succinct garbling and indistinguishability obfuscation for RAM programs
- Functional signatures and pseudorandom functions
- On the impossibility of approximate obfuscation and applications to resettable cryptography
- Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
- Polylogarithmic two-round argument systems
- Targeted malleability: homomorphic encryption for restricted computations
- Limits of extractability assumptions with distributional auxiliary input
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- The hunting of the SNARK
- Succinct arguments from multi-prover interactive proofs and their efficiency benefits
- Extractable Perfectly One-Way Functions
- Towards Plaintext-Aware Public-Key Encryption Without Random Oracles
- On the composition of public-coin zero-knowledge protocols
Cited In (13)
- On the existence of extractable one-way functions
- On extractability obfuscation
- Extractable Perfectly One-Way Functions
- Plumo: an ultralight blockchain client
- Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge
- Absolute results concerning one-way functions and their applications
- Weakly extractable one-way functions
- Monotone-policy aggregate signatures
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
- Toward RSA-OAEP without random oracles
- Verifiable private information retrieval
- Limits of extractability assumptions with distributional auxiliary input
- Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness
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 Q2829449)
