The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
이 논문은 비대화형이며 최적의 탄력성을 갖춘 분산 곱셈 방식을 제시합니다. 비대화형이란 중단이 발생하지 않는 한 플레이어가 다른 플레이어와 동기화할 필요 없이 발신 통신 채널을 한 번만 사용해야 함을 의미합니다. 우리의 프로토콜은 플레이어의 절반 미만까지 부패한 플레이어를 견딜 수 있으므로 최적의 탄력성을 제공합니다. 더욱이, 공유된 비밀은 무한히 강력한 적들로부터도 안전합니다. 이산대수 문제의 난해성 가정 하에서 보안성이 입증되었습니다. 이러한 속성은 단일 증명자와 분산 검증자 간의 일종의 비대화형 증명 시스템으로 이론적으로 안전한 비대화형 검증 가능한 비밀 공유를 사용하여 달성됩니다. 동일한 설정의 이전 대화형 솔루션과 비교할 때 비용은 검증 가능한 비밀 공유에 사용되는 임계값 요소에 의해 결정되는 로컬 계산 및 통신 복잡성의 증가입니다.
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.
부
Masayuki ABE, "Non-interactive and Optimally Resilient Distributed Multiplication" in IEICE TRANSACTIONS on Fundamentals,
vol. E83-A, no. 4, pp. 598-605, April 2000, doi: .
Abstract: This paper presents a non-interactive and optimally resilient distributed multiplication scheme. By non-interactive we mean that the players need to use outgoing communication channels only once without the need to synchronize with the other players as long as no disruption occurs. Our protocol withstands corrupt players up to less than the half of the players, so it provides optimal resiliency. Furthermore, the shared secrets are secure even against infinitely powerful adversaries. The security is proven under the intractability assumption of the discrete logarithm problem. Those properties are achieved by using an information theoretically secure non-interactive verifiable secret sharing as a kind of non-interactive proof system between a single prover and distributed verifiers. Compared to a former interactive solution in the same setting, the cost is an increase in local computation and communication complexity that is determined by the factor of the threshold used in the verifiable secret sharing.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e83-a_4_598/_p
부
@ARTICLE{e83-a_4_598,
author={Masayuki ABE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Non-interactive and Optimally Resilient Distributed Multiplication},
year={2000},
volume={E83-A},
number={4},
pages={598-605},
abstract={This paper presents a non-interactive and optimally resilient distributed multiplication scheme. By non-interactive we mean that the players need to use outgoing communication channels only once without the need to synchronize with the other players as long as no disruption occurs. Our protocol withstands corrupt players up to less than the half of the players, so it provides optimal resiliency. Furthermore, the shared secrets are secure even against infinitely powerful adversaries. The security is proven under the intractability assumption of the discrete logarithm problem. Those properties are achieved by using an information theoretically secure non-interactive verifiable secret sharing as a kind of non-interactive proof system between a single prover and distributed verifiers. Compared to a former interactive solution in the same setting, the cost is an increase in local computation and communication complexity that is determined by the factor of the threshold used in the verifiable secret sharing.},
keywords={},
doi={},
ISSN={},
month={April},}
부
TY - JOUR
TI - Non-interactive and Optimally Resilient Distributed Multiplication
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 598
EP - 605
AU - Masayuki ABE
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E83-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 2000
AB - This paper presents a non-interactive and optimally resilient distributed multiplication scheme. By non-interactive we mean that the players need to use outgoing communication channels only once without the need to synchronize with the other players as long as no disruption occurs. Our protocol withstands corrupt players up to less than the half of the players, so it provides optimal resiliency. Furthermore, the shared secrets are secure even against infinitely powerful adversaries. The security is proven under the intractability assumption of the discrete logarithm problem. Those properties are achieved by using an information theoretically secure non-interactive verifiable secret sharing as a kind of non-interactive proof system between a single prover and distributed verifiers. Compared to a former interactive solution in the same setting, the cost is an increase in local computation and communication complexity that is determined by the factor of the threshold used in the verifiable secret sharing.
ER -