Perfect secure computation in two rounds
type: Item
instance of: scholarly article
title: Perfect secure computation in two rounds
zbMATH Open document ID: 1443.94042
DOI: 10.1007/978-3-030-03807-6_6
author: Benny Applebaum
author: Zvika Brakerski
author: Rotem Tsabary
publication date: 2018-12-11T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6992090
zbMATH Keywords: multi-party functionality
zbMATH Keywords: two-round protocol
zbMATH Keywords: perfect correctness
zbMATH Keywords: perfect semi-honest security
MaRDI profile type: Publication
full work available at URL: 978-3-030-03807-6 6
OpenAlex ID: W2795240423
cites work: Round-optimal secure multiparty computation with honest majority
cites work: Garbled Circuits as Randomized Encodings of Functions: a Primer
cites work: Computationally private randomizing polynomials and their applications
cites work: \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
cites work: Security and composition of multiparty cryptographic protocols
cites work: Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
cites work: A minimal model for secure computation (extended abstract)
cites work: Two-round MPC: information-theoretic and black-box
cites work: Two-round multiparty secure computation from minimal assumptions
cites work: Foundations of Cryptography
cites work: A Pseudorandom Generator from any One-way Function
cites work: Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two
cites work: Secure multi-party computation
cites work: Q4737161
cites work: Q1745579
Recommended article: Perfect Secure Computation in Two Rounds
Recommended article: Advances in Cryptology – CRYPTO 2004
Recommended article: Q4737161
Recommended article: The Exact Round Complexity of Secure Computation
Recommended article: Round-optimal secure two-party computation from trapdoor permutations
Recommended article: Q4409117
Recommended article: Two-round Multiparty Secure Computation from Minimal Assumptions
Recommended article: Two-round multiparty secure computation from minimal assumptions
Recommended article: Efficient perfectly secure computation with optimal resilience
description: scientific article; zbMATH DE number 6992090