Completeness in two-party secure computation: A computational view
type: Item
instance of: scholarly article
title: Completeness in two-party secure computation: A computational view
zbMATH Open document ID: 1109.68046
author: D. Harnik
author: Moni Naor
author: Omer Reingold
author: Alon Rosen
published in: Journal of Cryptology
publication date: 2007-01-24T00:00:00Z
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 5118133
zbMATH Keywords: secure function evaluation
MaRDI profile type: Publication
full work available at URL: s00145-006-0346-4
OpenAlex ID: W2159191069
DOI: 10.1007/S00145-006-0346-4
Recommended article: Completeness in two-party secure computation
Recommended article: More general completeness theorems for secure two-party computation
Recommended article: A Full Characterization of Completeness for Two-Party Randomized Function Evaluation
Recommended article: Q4941849
Recommended article: Completeness for Symmetric Two-Party Functionalities - Revisited
Recommended article: Completeness for symmetric two-party functionalities: revisited
Recommended article: Complete Fairness in Secure Two-Party Computation
Recommended article: Q3549726
Recommended article: Universally composable two-party and multi-party secure computation
Recommended article: Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions
description: scientific article; zbMATH DE number 5118133