Non-interactive secure computation from one-way functions
type: Item
instance of: scholarly article
title: Non-interactive secure computation from one-way functions
zbMATH Open document ID: 1447.94019
DOI: 10.1007/978-3-030-03332-3_5
author: Saikrishna Badrinarayanan
author: Abhishek Jain
author: Rafail Ostrovsky
author: Ivan Visconti
publication date: 2019-01-23T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7005636
zbMATH Keywords: secure computation
zbMATH Keywords: hardware tokens
MaRDI profile type: Publication
full work available at URL: 978-3-030-03332-3 5
OpenAlex ID: W2898444587
cites work: Non-Interactive Secure Computation Based on Cut-and-Choose
cites work: Two-message witness indistinguishability and secure computation in the plain model from new assumptions
cites work: On the impossibility of approximate obfuscation and applications to resettable cryptography
cites work: On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
cites work: Universally Composable Security with Global Setup
cites work: Resettable zero-knowledge (extended abstract)
cites work: New Constructions for UC Secure Computation Using Tamper-Proof Hardware
cites work: (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens
cites work: 4-Round Resettably-Sound Zero Knowledge
cites work: Non-black-box simulation from one-way functions and applications to resettable security
cites work: Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token
cites work: From Stateful Hardware to Resettable Hardware Using Symmetric Assumptions
cites work: Q3729902
cites work: Definitions and properties of zero-knowledge proof systems
cites work: One-Time Programs
cites work: The Knowledge Complexity of Interactive Proof Systems
cites work: Founding Cryptography on Tamper-Proof Hardware Tokens
cites work: Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
cites work: Efficient Non-interactive Secure Computation
cites work: Universally Composable Multi-party Computation Using Tamper-Proof Hardware
cites work: Advances in Cryptology – CRYPTO 2004
cites work: Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens
cites work: Non-interactive Secure 2PC in the Offline/Online and Batch Settings
cites work: David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
cites work: Bit commitment using pseudorandomness
Recommended article: Q5215785
Recommended article: Efficient Non-interactive Secure Computation
Recommended article: Succinct non-interactive secure computation
Recommended article: Non-Interactive Secure Multiparty Computation
Recommended article: Hardness of non-interactive differential privacy from one-way functions
Recommended article: One-Way Functions and (Im)perfect Obfuscation
Recommended article: Theory and application of computationally-independent one-way functions: interactive proof of ability -- revisited
Recommended article: Reusable non-interactive secure computation
Recommended article: On hardness of one-way functions
Recommended article: Statistical concurrent non-malleable zero-knowledge from one-way functions
description: scientific article; zbMATH DE number 7005636