Perfectly Secure Asynchronous Agreement on a Core Set in Constant Expected Time.

Ittai Abraham; Gilad Asharov; Arpita Patra; Gilad Stern

Perfectly Secure Asynchronous Agreement on a Core Set in Constant Expected Time.

Ittai Abraham, Gilad Asharov, Arpita Patra, Gilad Stern

Research output: Other contribution

Abstract

A major challenge of any asynchronous MPC protocol is the need to reach agreement on the set of private inputs to be used as input for the MPC functionality. Ben-Or, Canetti and Goldreich [STOC 93] call this problem Agreement on a Core Set (ACS) and solve it by running n
n parallel instances of asynchronous binary Byzantine agreements. To the best of our knowledge, all results in the perfect and statistical security setting used this same paradigm for solving ACS. This leads to a fundamental barrier of expected
Ω (log n) Ω(logn) rounds for any asynchronous MPC protocol (even for constant depth circuits).
We provide a new solution for Agreement on a Core Set that runs in expected O(1)
O(1) rounds, is perfectly secure, and resilient to t<n/3
corruptions. Our solution is based on a new notion of Asynchronously Validated Asynchronous Byzantine Agreement (AVABA) and new information theoretic analogs to techniques used in the authenticated model. We show a similar result with statistical security for t<n/3

.

Original language	Danish
Publisher	Cryptology ePrint Archive
Number of pages	1130
Volume	2023/1130
State	Published - 2023

Bibliographical note

DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

Access to Document

https://dblp.org/rec/journals/iacr/AbrahamAPS23License: Other
https://eprint.iacr.org/2023/1130License: Unspecified

Cite this

@misc{f690f980defa4e0fa4b463a3b5574ae0,

title = "Perfectly Secure Asynchronous Agreement on a Core Set in Constant Expected Time.",

abstract = "A major challenge of any asynchronous MPC protocol is the need to reach agreement on the set of private inputs to be used as input for the MPC functionality. Ben-Or, Canetti and Goldreich [STOC 93] call this problem Agreement on a Core Set (ACS) and solve it by running nn parallel instances of asynchronous binary Byzantine agreements. To the best of our knowledge, all results in the perfect and statistical security setting used this same paradigm for solving ACS. This leads to a fundamental barrier of expected Ω (log n) Ω(logn) rounds for any asynchronous MPC protocol (even for constant depth circuits).We provide a new solution for Agreement on a Core Set that runs in expected O(1)O(1) rounds, is perfectly secure, and resilient to t corruptions. Our solution is based on a new notion of Asynchronously Validated Asynchronous Byzantine Agreement (AVABA) and new information theoretic analogs to techniques used in the authenticated model. We show a similar result with statistical security for t .",

author = "Ittai Abraham and Gilad Asharov and Arpita Patra and Gilad Stern",

note = "DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.",

year = "2023",

language = "דנית",

volume = "2023/1130",

publisher = " Cryptology ePrint Archive",

type = "Other",

}

TY - GEN

T1 - Perfectly Secure Asynchronous Agreement on a Core Set in Constant Expected Time.

AU - Abraham, Ittai

AU - Asharov, Gilad

AU - Patra, Arpita

AU - Stern, Gilad

N1 - DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

PY - 2023

Y1 - 2023

N2 - A major challenge of any asynchronous MPC protocol is the need to reach agreement on the set of private inputs to be used as input for the MPC functionality. Ben-Or, Canetti and Goldreich [STOC 93] call this problem Agreement on a Core Set (ACS) and solve it by running nn parallel instances of asynchronous binary Byzantine agreements. To the best of our knowledge, all results in the perfect and statistical security setting used this same paradigm for solving ACS. This leads to a fundamental barrier of expected Ω (log n) Ω(logn) rounds for any asynchronous MPC protocol (even for constant depth circuits).We provide a new solution for Agreement on a Core Set that runs in expected O(1)O(1) rounds, is perfectly secure, and resilient to t corruptions. Our solution is based on a new notion of Asynchronously Validated Asynchronous Byzantine Agreement (AVABA) and new information theoretic analogs to techniques used in the authenticated model. We show a similar result with statistical security for t .

AB - A major challenge of any asynchronous MPC protocol is the need to reach agreement on the set of private inputs to be used as input for the MPC functionality. Ben-Or, Canetti and Goldreich [STOC 93] call this problem Agreement on a Core Set (ACS) and solve it by running nn parallel instances of asynchronous binary Byzantine agreements. To the best of our knowledge, all results in the perfect and statistical security setting used this same paradigm for solving ACS. This leads to a fundamental barrier of expected Ω (log n) Ω(logn) rounds for any asynchronous MPC protocol (even for constant depth circuits).We provide a new solution for Agreement on a Core Set that runs in expected O(1)O(1) rounds, is perfectly secure, and resilient to t corruptions. Our solution is based on a new notion of Asynchronously Validated Asynchronous Byzantine Agreement (AVABA) and new information theoretic analogs to techniques used in the authenticated model. We show a similar result with statistical security for t .

M3 - ???researchoutput.researchoutputtypes.othercontribution.other???

VL - 2023/1130

PB - Cryptology ePrint Archive

ER -