Invertible polynomial representation for private set operations

Citations

WEB OF SCIENCE

0
Citations

SCOPUS

0

초록

In many private set operations, a set is represented by a polynomial over a ring ℤσfor a composite integer σ, where ℤσis the message space of some additive homomorphic encryption. While it is useful for implementing set operations with polynomial additions and multiplications, it has a limitation that it is hard to recover a set from a polynomial due to the hardness of polynomial factorization over ℤσ. We propose a new representation of a set by a polynomial over ℤσ, in which σ is a composite integer with known factorization but a corresponding set can be efficiently recovered from a polynomial except negligible probability. Since ℤσ[x] is not a unique factorization domain, a polynomial may be written as a product of linear factors in several ways. To exclude irrelevant linear factors, we introduce a special encoding function which supports early abort strategy. Our representation can be efficiently inverted by computing all the linear factors of a polynomial in ℤσ[x] whose roots locate in the image of the encoding function. As an application of our representation, we obtain a constant-round private set union protocol. Our construction improves the complexity than the previous without honest majority.

키워드

Polynomial factorization; Polynomial representation; Privacy-preserving set union; Root finding
제목
Invertible polynomial representation for private set operations
저자
Cheon, J.H.; Hong, H.; Lee, H.T.
DOI
10.1007/978-3-319-12160-4_17
발행일
2014-01
유형
Proceedings Paper
저널명
Lecture Notes in Computer Science
권
8565
페이지
277 ~ 292

파일 다운로드

Thumbnail