Non-interactive secure computation from one-way functions
From MaRDI portal
Recommendations
- Secure multiparty computation without one-way functions
- Efficient non-interactive secure computation
- Succinct non-interactive secure computation
- Non-interactive secure multiparty computation
- Hardness of non-interactive differential privacy from one-way functions
- One-Way Functions and (Im)perfect Obfuscation
- Theory and application of computationally-independent one-way functions: interactive proof of ability -- revisited
- Reusable non-interactive secure computation
- On hardness of one-way functions
- Statistical concurrent non-malleable zero-knowledge from one-way functions
Cites work
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens
- 4-round resettably-sound zero knowledge
- Advances in Cryptology – CRYPTO 2004
- Bit commitment using pseudorandomness
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
- David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
- Definitions and properties of zero-knowledge proof systems
- Efficient non-interactive secure computation
- Founding Cryptography on Tamper-Proof Hardware Tokens
- From stateful hardware to resettable hardware using symmetric assumptions
- New Constructions for UC Secure Computation Using Tamper-Proof Hardware
- Non-black-box simulation from one-way functions and applications to resettable security
- Non-black-box simulation from one-way functions and applications to resettable security
- Non-interactive secure 2PC in the offline/online and batch settings
- Non-interactive secure computation based on cut-and-choose
- On non-black-box simulation and the impossibility of approximate obfuscation
- On the impossibility of approximate obfuscation and applications to resettable cryptography
- One-Time Programs
- Resettable zero-knowledge (extended abstract)
- The Knowledge Complexity of Interactive Proof Systems
- Truly efficient string oblivious transfer using resettable tamper-proof tokens
- Two-message witness indistinguishability and secure computation in the plain model from new assumptions
- Unconditional and composable security using a single stateful Tamper-proof hardware token
- Universally Composable Multi-party Computation Using Tamper-Proof Hardware
- Universally Composable Security with Global Setup
Cited in
(14)- Black-box reusable NISC with random oracles
- Fully-secure MPC with minimal trust
- Multiparty reusable non-interactive secure computation from LWE
- Unbounded multi-party computation from learning with errors
- Security-preserving hardness-amplification for any regular one-way function
- scientific article; zbMATH DE number 709841 (Why is no real title available?)
- Reusable non-interactive secure computation
- Non-interactive secure computation based on cut-and-choose
- mrNISC from LWE with polynomial modulus
- Concurrently composable non-interactive secure computation
- Blockchains enable non-interactive MPC
- Secrecy without one-way functions
- Succinct non-interactive secure computation
- Non-black-box simulation from one-way functions and applications to resettable security
This page was built for publication: Non-interactive secure computation from one-way functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1710666)
