Polynomial expressions of p-ary auction functions
One of the common ways to design secure multi-party computation is twofold: to realize secure fundamental operations and to decompose a target function to be securely computed into them. In the setting of fully homomorphic encryption, as well as some kinds of secret sharing, the fundamental operatio...
Main Authors: | Kaji Shizuo, Maeno Toshiaki, Nuida Koji, Numata Yasuhide |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2019-06-01
|
Series: | Journal of Mathematical Cryptology |
Subjects: | |
Online Access: | https://doi.org/10.1515/jmc-2018-0016 |
Similar Items
-
Undecidability of polynomial inequalities in weighted graph homomorphism densities
by: Grigoriy Blekherman, et al.
Published: (2024-01-01) -
A note on limits of sequences of binary trees
by: Rudolf Grübel
Published: (2023-05-01) -
Variance and Covariance of Several Simultaneous Outputs of a Markov Chain
by: Sara Kropf
Published: (2016-06-01) -
Polynomial Solutions of Equivariant Polynomial Abel Differential Equations
by: Llibre Jaume, et al.
Published: (2018-08-01) -
Determining the Hausdorff Distance Between Trees in Polynomial Time
by: Aleksander Kelenc
Published: (2021-08-01)