2021 IEEE International Performance, Computing, and Communications Conference (IPCCC) 2021
DOI: 10.1109/ipccc51483.2021.9679393
|View full text |Cite
|
Sign up to set email alerts
|

Three-Party Integer Comparison and Applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
8
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(8 citation statements)
references
References 28 publications
0
8
0
Order By: Relevance
“…The comparison of distances can be completed through integer comparison schemes. Damgård et al [15] and Ma et al [19] both proposed integer comparison schemes when studying online auction applications. In [15], the two-party integer comparison protocol based on an additively homomorphic encryption system could compare one bit each time, which took at least log 2 M bit-by-bit homomorphic operations, where M was the upper bound of the integer to be compared.…”
Section: B Comparison Of Distancesmentioning
confidence: 99%
See 4 more Smart Citations
“…The comparison of distances can be completed through integer comparison schemes. Damgård et al [15] and Ma et al [19] both proposed integer comparison schemes when studying online auction applications. In [15], the two-party integer comparison protocol based on an additively homomorphic encryption system could compare one bit each time, which took at least log 2 M bit-by-bit homomorphic operations, where M was the upper bound of the integer to be compared.…”
Section: B Comparison Of Distancesmentioning
confidence: 99%
“…In [15], the two-party integer comparison protocol based on an additively homomorphic encryption system could compare one bit each time, which took at least log 2 M bit-by-bit homomorphic operations, where M was the upper bound of the integer to be compared. However, many comparison schemes could directly compare small integers, such as [16], [18], [19]. Carlton et al [16] proposed a two-party integer comparison protocol, which has a per-bit comparison up to five times faster than [15] but required more interactions.…”
Section: B Comparison Of Distancesmentioning
confidence: 99%
See 3 more Smart Citations