IEICE TRANSACTIONS on Information
Secure Multi-Party Computation over Networks
Summary :
Consider a set of parties who do not trust each other but want to compute some agreed function of their inputs in a secure way. This problem is known as multi-party computation. It has various interesting applications including election over the internet, electric contracts, private and secret database, joint signatures, and others. A number of techniques for the problem have been proposed. Secure protocols for multi-paty computation known so far are mainly based on threshold secret sharing, verifiable secret sharing, zero-knowledge proofs, and error-correcting codes. We survey important and interesting results on secure multi-party computation under the existence of various types of adversaries.
- Publication
- IEICE TRANSACTIONS on Information Vol.E83-D No.3 pp.561-569
- Publication Date
- 2000/03/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- INVITED SURVEY PAPER
- Category
- Parallel and Distributed Algorithms
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yasuaki NISHITANI, Yoshihide IGARASHI, "Secure Multi-Party Computation over Networks" in IEICE TRANSACTIONS on Information,
vol. E83-D, no. 3, pp. 561-569, March 2000, doi: .
Abstract: Consider a set of parties who do not trust each other but want to compute some agreed function of their inputs in a secure way. This problem is known as multi-party computation. It has various interesting applications including election over the internet, electric contracts, private and secret database, joint signatures, and others. A number of techniques for the problem have been proposed. Secure protocols for multi-paty computation known so far are mainly based on threshold secret sharing, verifiable secret sharing, zero-knowledge proofs, and error-correcting codes. We survey important and interesting results on secure multi-party computation under the existence of various types of adversaries.
URL: https://global.ieice.org/en_transactions/information/10.1587/e83-d_3_561/_p
Copy
@ARTICLE{e83-d_3_561,
author={Yasuaki NISHITANI, Yoshihide IGARASHI, },
journal={IEICE TRANSACTIONS on Information},
title={Secure Multi-Party Computation over Networks},
year={2000},
volume={E83-D},
number={3},
pages={561-569},
abstract={Consider a set of parties who do not trust each other but want to compute some agreed function of their inputs in a secure way. This problem is known as multi-party computation. It has various interesting applications including election over the internet, electric contracts, private and secret database, joint signatures, and others. A number of techniques for the problem have been proposed. Secure protocols for multi-paty computation known so far are mainly based on threshold secret sharing, verifiable secret sharing, zero-knowledge proofs, and error-correcting codes. We survey important and interesting results on secure multi-party computation under the existence of various types of adversaries.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - Secure Multi-Party Computation over Networks
T2 - IEICE TRANSACTIONS on Information
SP - 561
EP - 569
AU - Yasuaki NISHITANI
AU - Yoshihide IGARASHI
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E83-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 2000
AB - Consider a set of parties who do not trust each other but want to compute some agreed function of their inputs in a secure way. This problem is known as multi-party computation. It has various interesting applications including election over the internet, electric contracts, private and secret database, joint signatures, and others. A number of techniques for the problem have been proposed. Secure protocols for multi-paty computation known so far are mainly based on threshold secret sharing, verifiable secret sharing, zero-knowledge proofs, and error-correcting codes. We survey important and interesting results on secure multi-party computation under the existence of various types of adversaries.
ER -
English
