Constant-Round Client-Aided Two-Server Secure Comparison Protocol and Its Applications

Morita, Hiraku; Attrapadung, Nuttapong; Teruya, Tadanori; Ohata, Satsuya; Nuida, Koji; Hanaoka, Goichiro

doi:10.1587/transfun.2019cip0023

Search citation statements

Order By: Relevance

Paper Sections

Select...

Higher-level Secure Protocols1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2020

Publication Types

Select...

Article1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We need to O(log n) communication rounds since we calculate the overflow from the lower bits. If we adopt not the shares over Z 2 n but Z p (p: prime), we can construct constant-round Comparison via the different strategy [43], [44].…”

Section: Higher-level Secure Protocolsmentioning

confidence: 99%

Recent Advances in Practical Secure Multi-Party Computation

Ohata¹

2020

IEICE Trans. Fundamentals

Self Cite

View full text Add to dashboard Cite

Secure multi-party computation (MPC) allows a set of parties to compute a function jointly while keeping their inputs private. MPC has been actively studied, and there are many research results both in the theoretical and practical research fields. In this paper, we introduce the basic matters on MPC and show recent practical advances. We first explain the settings, security notions, and cryptographic building blocks of MPC. Then, we show and discuss current situations on higher-level secure protocols, privacy-preserving data analysis, and frameworks/compilers for implementing MPC applications with low-cost.

show abstract

Section: Higher-level Secure Protocolsmentioning

confidence: 99%