Secure multi-party computation protocol for sequencing problem
type: Item
instance of: scholarly article
title: Secure multi-party computation protocol for sequencing problem
zbMATH Open document ID: 1267.68053
author: Guihua Shi
author: Zheng-An Yao
author: Chun-Ming Tang
publication date: 2013-07-03T00:00:00Z
full work available at URL: s11432-011-4272-1
Mathematics Subject Classification ID: 68M12
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 6183256
zbMATH Keywords: secure multi-party computation
zbMATH Keywords: sequencing problem
zbMATH Keywords: secret sharing
MaRDI profile type: Publication
OpenAlex ID: W2027154656
cites work: Practical Two-Party Computation Based on the Conditional Gate
cites work: Q4823929
cites work: Strong Conditional Oblivious Transfer and Computing on Intervals
cites work: Q2724463
cites work: An Efficient Solution to the Millionaires’ Problem Based on Homomorphic Encryption
cites work: A proof of security of Yao's protocol for two-party computation
cites work: Q3374918
cites work: How to share a secret
DOI: 10.1007/S11432-011-4272-1
published in: Science China Information Sciences
description: scientific article; zbMATH DE number 6183256