Analysis of privacy-preserving element reduction of a multiset
2
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
The element reduction of a multiset S is to reduce the number of repetitions of an element in S by a predetermined number. Privacy-preserving element reduction of a multiset is an important tool in private computation over multisets. It can be used by itself or by combination with other private set operations. Recently, an efficient privacy-preserving element reduction method was proposed by Kissner and Song [7]. In this paper, we point out a mathematical flaw in their polynomial representation that is used for the element reduction protocol and provide its correction. Also we modify their over-threshold set-operation protocol, using an element reduction with the corrected representation, which is used to output the elements that appear over the predetermined threshold number of times in the multiset resulting from other privacy-preserving set operations.
Abstract
The element reduction of a multiset S is to reduce the number of repetitions of an element in S by a predetermined number. Privacy-preserving element reduction of a multiset is an important tool in private computation over multisets. It can be used by itself or by combination with other private set operations. Recently, an efficient privacy-preserving element reduction method was proposed by Kissner and Song [7]. In this paper, we point out a mathematical flaw in their polynomial representation that is used for the element reduction protocol and provide its correction. Also we modify their over-threshold set-operation protocol, using an element reduction with the corrected representation, which is used to output the elements that appear over the predetermined threshold number of times in the multiset resulting from other privacy-preserving set operations.
참고문헌 (10)
- R. Agrawal, "Information sharing across private databases", Proceedings of the 2003 ACM SIGMOD international conference on Management of data, pp.86~97 (2003), ACM Press
- D. Boneh, "Evaluating 2-DNF formulas on ciphertexts, In TCC 2005", Lecture Notes in Comput. Sci., 3378, pp.325~341 (2005)
- P.-A. Fouque, "Threshold cryptosystems secure against chosenciphertext attacks, In Advances in Cryptology—Asiacrypt 2000", Lecture Notes in Comput. Sci., 1976, pp.573~584 (2000)
- M. Freedman, "Efficient private matching and set intersection, Advances in cryptology—EUROCRYPT 2004", Lecture Notes in Comput. Sci., 3027, pp.1~19 (2004)
- O. Goldreich, "The Foundations of Cryptography" (2004), Cambridge University Press
- "Privacy-preserving distributed information sharing"[URL]
- L. Kissner, "Privacy-preserving set operations, Advances in cryptology— CRYPTO 2005", Lecture Notes in Comput. Sci., 3621, pp.241~257 (2005)
- Private and threshold set-intersection, Technical Report CMU-CS-05-113, "L. Kissner", Carnegie Mellon University, ~ (2005)
- P. Pallier, "Public-key cryptosystems based on composite degree residuosity classes, In Advances in Cryptology—Eurocrypt 1999", Lecture Notes in Comput. Sci., 1592, pp.223~238 (1999)
- J. Seo, "Analysis of privacy-preserving element reduction of a multiset, Memoir of the 2nd cryptology paper contest", arranged by a government organization, 77~91 (2006)