Skip to main content
Conference Proceedings

Secret sharing comparison by transformation and rotation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 4883 LNCS 169-180
DOI: 10.1007/978-3-642-10230-1_14
5Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Given any linear secret sharing scheme with a multiplication protocol, we show that a given set of players holding shares of two values for some prime p, it is possible to compute a sharing of ρ such that ρ∈= ∈(a∈

Cite

CITATION STYLE

APA

Reistad, T. I., & Toft, T. (2009). Secret sharing comparison by transformation and rotation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4883 LNCS, pp. 169–180). https://doi.org/10.1007/978-3-642-10230-1_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free