Secure Comparison and Interval Test Protocols based on Three-party MPC

Fujii, Wataru; Iwamura, Keiichi; Inamura, Masaki

doi:10.5220/0009161406980704

Cited by 1 publication

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…3.2, there are other considerations in choosing the prime. For instance, for efficiency reasons BFV [15,5] requires special prime modulus, where p´1 has a large factor (around 2 14 -2 16 ). One such prime is p " 2 64 ´83, where 33196 p´1 and φp33196q"16128 (with φ the Euler's Totient function), which would be secure given the 16k degree and appropriately chosen modulus q.…”

Section: Statistical Closenessmentioning

confidence: 99%

“…This way the problem of comparison only needs to be addressed on smaller strings (the blocks), and equality testing can be applied to the larger strings (to allow for the necessary reduction of the size of the blocks on which comparison is to be performed). Other recent concretely-efficient comparison protocols such as [16,32,33,31] also eliminate the need for a slack but operate in fixed adversarial models and are tied to a 3-party MPC setting.…”

Section: Protocol Communication Computation Rounds Security Adversary...mentioning

confidence: 99%

See 1 more Smart Citation

$$\mathsf {Rabbit}$$: Efficient Comparison for Secure Multi-Party Computation

Makri

Rotaru

Vercauteren

et al. 2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Secure comparison has been a fundamental challenge in privacypreserving computation, since its inception as Yao's millionaires' problem (FOCS 1982). In this work, we present a novel construction for general nparty private comparison, secure against an active adversary, in the dishonest majority setting. For the case of comparisons over fields, our protocol is more efficient than the best prior work (edaBits: Crypto 2020), with "1.5ˆbetter throughput in most adversarial settings, over 2.3ˆbetter throughput in particular in the passive, honest majority setting, and lower communication. Our comparisons crucially eliminate the need for bounded inputs as well as the need for statistical security that prior works require. An important consequence of removing this "slack" (a gap between the bit-length of the input and the MPC representation) is that multi-party computation (MPC) protocols can be run in a field of smaller size, reducing the overhead incurred by privacy-preserving computations. We achieve this novel construction using the commutative nature of addition over rings and fields. This makes the protocol both simple to implement and highly efficient and we provide an implementation in MP-SPDZ (CCS 2020).

show abstract

Section: Statistical Closenessmentioning

confidence: 99%

Section: Protocol Communication Computation Rounds Security Adversary...mentioning

confidence: 99%