Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation

Patra, Arpita; Ravi, Divya

doi:10.1007/978-3-030-34578-5_17

Cited by 9 publications

(5 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…1]) excluded security with unanimous abort for the case of an honest majority, but only for protocols that are defined in the plain model, without any trusted setup assumptions. Indeed, as pointed out by the authors in [62], their proof technique does not extend to the setting with private-coin setup. In more detail, and to illustrate the difference, consider the setting where the first round is over broadcast (and possibly point-to-point channels) and the second is over pointto-point.…”

Section: Impossibility Resultsmentioning

confidence: 99%

“…Patra and Ravi [60] showed that in the plain model (without any setup assumptions, such as a PKI) security with unanimous abort cannot be achieved in two point-to-point rounds, and even if the first round can use a broadcast channel. As pointed out in [62], the lower-bounds proofs from [60] do not extend to a setting with private-coins setup. While advancing our understanding of what kind of security can be achieved in two rounds, the picture derived from the results above is only partial and does not resolve the question of whether the feasibility results can be pushed further.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Broadcast-Optimal Two Round MPC with an Honest Majority

Damgård

Magri

Ravi

et al. 2021

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

Section: Impossibility Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Broadcast-Optimal Two Round MPC with an Honest Majority

Damgård

Magri

Ravi

et al. 2021

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…Computational security stands to the assumption that an adversary has limited computing power that prevents him from solving complex mathematical problems. While unconditional security means that the security persists even if the adversary has unlimited computing power [11][12][13][14]. It led Cabello et al [15] to propose two unconditionally secure linear schemes against cheaters, classified as a robust scheme and a secure scheme.…”

Section: Security Analysis Of Sssmentioning

confidence: 99%

Application of Recursive Algorithm on Shamir's Scheme Reconstruction for Cheating Detection and Identification

2022

View full text Add to dashboard Cite

Information data protection is necessary to ward off and overcome various fraud attacks that may be encountered. A secret sharing scheme that implements cryptographic methods intends to maintain the security of confidential data by a group of trusted parties is the answer. In this paper, we choose the application of recursive algorithm on Shamir-based linear scheme as the primary method. In the secret reconstruction stage and since the beginning of the share distribution stage, these algorithms have been integrated by relying on a detection parameter to ensure that the secret value sought is valid. Although the obtained scheme will be much simpler because it utilizes the Vandermonde matrix structure, the security aspect of this scheme is not reduced. Indeed, it is supported by two detection parameters formulated from a recursive algorithm to detect cheating and identify the cheater(s). Therefore, this scheme is guaranteed to be unconditionally secure and has a high time efficiency (polynomial running time).

show abstract

Section: Introductionmentioning

confidence: 99%

“…1]) excluded security with unanimous abort for the case of an honest majority, but only for protocols that are defined in the plain model, without any trusted setup assumptions. Indeed, as pointed out by the authors in [ 62 ], their proof technique does not extend to the setting with private-coin setup. In more detail, and to illustrate the difference, consider the setting where the first round is over broadcast (and possibly point-to-point channels) and the second is over point-to-point.…”

Section: Introductionmentioning

confidence: 99%

Broadcast-Optimal Two-Round MPC

Cohen

Garay

Zikas

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

An intensive effort by the cryptographic community to minimize the round complexity of secure multi-party computation (MPC) has recently led to optimal two-round protocols from minimal assumptions. Most of the proposed solutions, however, make use of a broadcast channel in every round, and it is unclear if the broadcast channel can be replaced by standard point-to-point communication in a round-preserving manner, and if so, at what cost on the resulting security. In this work, we provide a complete characterization of the trade-off between number of broadcast rounds and achievable security level for two-round MPC tolerating arbitrarily many active corruptions. Specifically, we consider all possible combinations of broadcast and point-to-point rounds against the three standard levels of security for maliciously secure MPC protocols, namely, security with identifiable, unanimous, and selective abort. For each of these notions and each combination of broadcast and point-to-point rounds, we provide either a tight feasibility or an infeasibility result of two-round MPC. Our feasibility results hold assuming two-round OT in the CRS model, whereas our impossibility results hold given any correlated randomness.

show abstract

Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation

Cited by 9 publications

References 36 publications

Broadcast-Optimal Two Round MPC with an Honest Majority

Broadcast-Optimal Two Round MPC with an Honest Majority

Application of Recursive Algorithm on Shamir's Scheme Reconstruction for Cheating Detection and Identification

Broadcast-Optimal Two-Round MPC

Contact Info

Product

Resources

About