Non-interactive secure computation from one-way functions

DOI10.1007/978-3-030-03332-3_5zbMath1447.94019OpenAlexW2898444587MaRDI QIDQ1710666

Saikrishna Badrinarayanan, Ivan Visconti, Abhishek Jain, Rafail Ostrovsky

Publication date: 23 January 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-03332-3_5

zbMATH Keywords

secure computationhardware tokens

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Fully-secure MPC with minimal trust ⋮ Blockchains enable non-interactive MPC ⋮ Multiparty reusable non-interactive secure computation from LWE ⋮ Unbounded multi-party computation from learning with errors ⋮ Succinct non-interactive secure computation

Cites Work

• Unnamed Item
• Bit commitment using pseudorandomness
• Definitions and properties of zero-knowledge proof systems
• Two-message witness indistinguishability and secure computation in the plain model from new assumptions
• Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security
• Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token
• Efficient Non-interactive Secure Computation
• Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
• Resettable zero-knowledge (extended abstract)
• Founding Cryptography on Tamper-Proof Hardware Tokens
• Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens
• On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
• From Stateful Hardware to Resettable Hardware Using Symmetric Assumptions
• Universally Composable Security with Global Setup
• One-Time Programs
• The Knowledge Complexity of Interactive Proof Systems
• Non-interactive Secure 2PC in the Offline/Online and Batch Settings
• Advances in Cryptology – CRYPTO 2004
• Non-Interactive Secure Computation Based on Cut-and-Choose
• Universally Composable Multi-party Computation Using Tamper-Proof Hardware
• David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
• New Constructions for UC Secure Computation Using Tamper-Proof Hardware
• Non-black-box simulation from one-way functions and applications to resettable security
• On the impossibility of approximate obfuscation and applications to resettable cryptography
• 4-Round Resettably-Sound Zero Knowledge
• (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens

This page was built for publication: Non-interactive secure computation from one-way functions