Invertible polynomial representation for private set operations
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cheon, J.H. | - |
dc.contributor.author | Hong, H. | - |
dc.contributor.author | Lee, H.T. | - |
dc.date.accessioned | 2023-03-08T20:26:51Z | - |
dc.date.available | 2023-03-08T20:26:51Z | - |
dc.date.issued | 2014-01 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.issn | 1611-3349 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/64762 | - |
dc.description.abstract | 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. | - |
dc.format.extent | 16 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Springer Verlag | - |
dc.title | Invertible polynomial representation for private set operations | - |
dc.type | Article | - |
dc.identifier.doi | 10.1007/978-3-319-12160-4_17 | - |
dc.identifier.bibliographicCitation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v.8565, pp 277 - 292 | - |
dc.description.isOpenAccess | Y | - |
dc.identifier.wosid | 000345114800017 | - |
dc.identifier.scopusid | 2-s2.0-84911031706 | - |
dc.citation.endPage | 292 | - |
dc.citation.startPage | 277 | - |
dc.citation.title | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | - |
dc.citation.volume | 8565 | - |
dc.type.docType | Proceedings Paper | - |
dc.publisher.location | 미국 | - |
dc.subject.keywordAuthor | Polynomial factorization | - |
dc.subject.keywordAuthor | Polynomial representation | - |
dc.subject.keywordAuthor | Privacy-preserving set union | - |
dc.subject.keywordAuthor | Root finding | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
84, Heukseok-ro, Dongjak-gu, Seoul, Republic of Korea (06974)02-820-6194
COPYRIGHT 2019 Chung-Ang University All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.