A note on secure multiparty computation via higher residue symbols
We generalize a protocol by Yu for comparing two integers with relatively small difference in a secure multiparty computation setting. Yu's protocol is based on the Legendre symbol. A prime number p is found for which the Legendre symbol (· | p) agrees with the sign function for integers in a c...
Main Authors: | Cascudo Ignacio, Schnyder Reto |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2021-01-01
|
Series: | Journal of Mathematical Cryptology |
Subjects: | |
Online Access: | https://doi.org/10.1515/jmc-2020-0013 |
Similar Items
-
The Eleventh Power Residue Symbol
by: Joye Marc, et al.
Published: (2020-11-01) -
Discretisation and Product Distributions in Ring-LWE
by: Murphy Sean, et al.
Published: (2020-11-01) -
Constructions of pseudorandom binary lattices using cyclotomic classes in finite fields
by: Chen Xiaolin
Published: (2020-12-01) -
On the non-idealness of cyclotomic families of pairing-friendly elliptic curves
by: Sha Min
Published: (2014-12-01) -
A subexponential construction of graph coloring for multiparty computation
by: Asghar Hassan Jameel, et al.
Published: (2014-12-01)