Abstract
Many applications require performing set operations without publishing individual datesets. In this article, we address this problem for five fundamental set operations including set intersection, cardinality of set intersection, element reduction, overthreshold set-union, and subset relation. Our protocols are obtained in the universally composable security framework, in the assumption of the probabilistic polynomial time bounded adversary, which actively controls a fixed set of t parties and the assumption of an authenticated broadcast channel. Our constructions utilize building blocks of nonmalleable NonInteractive Zero-Knowledge (NIZK) arguments, which are based on a (t + 1,N)-threshold version (N is the number of parties in the protocol) of the boneh-goh-nissim (BGN) cryptosystem whose underlying group supports bilinear maps, in the assumption that the public key and shares of the secret key have been generated by a trusted dealer. The previous studies were all based on the stand-alone model with the same assumptions on the adversary, broadcast channel, and key generation. For the first four operations, we propose protocols that improve the previously known results by an O(N) factor in the computation and communication complexities. For the subset relation, our protocol is the first one secure against the active adversary. Our constructions of NIZK have independent interest in that, though also mentioned as building blocks, the previous work did not illustrate how to construct them. We construct these NIZK with an additional nonmalleable property, the same complexity as claimed in the previous work, and also an improvement on the communication complexity.
- Adida, B. and Wikstrom, D. 2007. How to shuffle in public. In Proceedings of the 4th Theory of Cryptography Conference (TCC'07). Springer, Berlin, 555--574. Google Scholar
Digital Library
- Aggarwal, G., Mishra, N., and Pinkas, B. 2004. Secure computation of the 8th-ranked element. In Proceedings of Advances in Cryptology (EUROCRYPT'04). Springer, Berlin, 40--55.Google Scholar
- Barreto, P., Kim, H., Lynn, B., and Scott, M. 2002. Efficient algorithms for pairing-based cryptosystems. In Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology (CRYPTO'02). Springer, Berlin, 354--369. Google Scholar
Digital Library
- Boneh, D. and Franklin, M. 2003. Identity-based encryption from the Weil pairing. SIAM J. Comput. 32, 3, 586--615. Google Scholar
Digital Library
- Boneh, D., Goh, E., and Nissim, K. 2005. Evaluating 2-DNF formulas on ciphertexts. In Proceedings of the 2nd Theory of Cryptography Conference (TCC'05). Springer, Berlin, 325--341. Google Scholar
Digital Library
- Canetti, R. 2001. Universally composable security: A new paradigm for cryptographic protocols. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS'01). IEEE, Los Alamitos, CA, 136--145. Google Scholar
Digital Library
- Cramer, R., Damgard, I., and Nielsen, J. 2001. Multiparty computation from threshold homomorphic encryption. In Proceedings of Advances in Cryptology (EUROCRYPT'01). Springer, Berlin, 280--300. Google Scholar
Digital Library
- Frankel, Y., MacKenzie, P., and Yung, M. 1998. Robust efficient distributed RSA-key generation. In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing. ACM, New York, 320--330. Google Scholar
Digital Library
- Freedman, M., Nissim, K., and Pinkas, B. 2004. Efficient private matching and set intersection. In Proceedings of Advances in Cryptology (ERUROCRYPT'04). Springer, Berlin, 1--19.Google Scholar
- Frikken, K. 2007. Privacy-preserving set union. In Proceedings of the 5th International Conference on Applied Cryptography and Network Security (ACNS'07). Springer, Berlin, 237--252. Google Scholar
Digital Library
- Galbraith, S. D. 2002. Elliptic curve paillier schemes. J. Cryptology 15, 2,129--138.Google Scholar
Digital Library
- Goldreich, O. 2004. Foundations of Cryptography, vol. 2. Cambridge University Press, Cambridge, UK. Google Scholar
Digital Library
- Goldreich, O., Micali, S., and Wigderson, A. 1987. How to play any mental game. In Proceedings of the 19th Annual ACM Symposium on the Theory of Computing (STOC'87). ACM, New York, 218--229. Google Scholar
Digital Library
- Groth, J., Ostrovsky, R., and Sahai, A. 2006. Perfect non-interactive zero-knowledge for NP. In Proceedings of Advances in Cryptology (EUROCRYPT'06). Springer, Berlin, 338--359. Google Scholar
Digital Library
- Groth, J. and Sahai, A. 2008. Efficient non-interactive proof systems for bilinear groups. In Proceedings of Advances in Cryptology (EUROCRYPT'08). Springer, Berlin, 415--432. Google Scholar
Digital Library
- Hohenberger, S. and Weis, S. 2006. Honest-verifier private disjointness testing without random oracles. In Proceedings of the 6th International Workshop of Privacy Enhancing Technologies (PET'06). Springer, Berlin, 277--294. Google Scholar
Digital Library
- Kissner, L. and Song, D. 2005. Privacy-preserving set operations. In Advances in Cryptology (CRYPTO'05). Springer, Berlin, 241--257. Google Scholar
Digital Library
- Kissner, L. and Song, D. 2006. Privacy-preserving set operations. Tech. rep. CMU-CS-05-113, Carnegie Mellon University.Google Scholar
- Lamport, L., Shostack, R., and Pease, M. 1982. The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4, 3, 382--401. Google Scholar
Digital Library
- Li, R. and Wu, C. 2007. An unconditionally secure protocol for multi-party set intersection. In Proceedings of the 5th International Conference on Applied Cryptography and Network Security (ACNS'07). Springer, Berlin, 226--236. Google Scholar
Digital Library
- Lindell, Y. 2003. Parallel coin-tossing and constant-round secure two-party computation. J. Cryptology 16, 3, 143--184.Google Scholar
Cross Ref
- Menezes, A., Vanstone, S., and Okamoto, T. 1993. Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Trans. Inf. Theory 39, 5, 1639--1646.Google Scholar
Digital Library
- Menezes, A., Oorschot, P., and Vanstone, S. 1996. Handbook of Applied Cryptography. CRC Press, Boca Raton, FL. Google Scholar
Digital Library
- Miller, V. 2004. The Weil pairing, and its efficient calculation. J. Cryptology 17, 4, 235--261. Google Scholar
Digital Library
- Mohassel, P. and Franklin, M. 2006. Efficient polynomial operations in the shared-coefficients setting. In Proceedings of Public Key Cryptography (PKC'06). Springer, Berlin, 44--57. Google Scholar
Digital Library
- Pedersen, T. 1991. A threshold cryptosystem without a trusted party. In Proceedings of Advances in Cryptology (EUROCRYPT'91). Springer, Berlin, 522--526.Google Scholar
Cross Ref
- Sahai, A. 1999. Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS'99). IEEE, Los Alamitos, CA, 543--553. Google Scholar
Digital Library
- Sang, Y., Shen, H., Tan, Y., and Xiong, N. 2006. Efficient protocols for privacy preserving matching against distributed datasets. In Proceedings of the 8th International Conference on Information and Communications Security (ICICS'06). Springer, Berlin, 210--227. Google Scholar
Digital Library
- Sang, Y. and Shen, H. 2007. Privacy preserving set intersection protocol secure against malicious behaviors. In Proceedings of the 8th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT'07). IEEE, Los Alamitos, CA. Google Scholar
Digital Library
- Sang, Y. and Shen, H. 2008. Privacy preserving set intersection protocols based on bilinear groups. In Proceedings of the 31st Australasian Computer Science Conference (ACSC'08). Austrailian Computer Society, West Melbourne, Australia. Google Scholar
Digital Library
- Seo, J., Yoon, H., Cheon, J., and Hong, D. 2006. Analysis of privacy-preserving element reduction of multiset. Cryptology ePrint Archive: Report 2006/418. http://eprint.iacr.org/2006/418.Google Scholar
- Shamir, A. 1979. How to share a secret. Comm. ACM 22, 11, 612--613. Google Scholar
Digital Library
- Vaidya, J., and Clifton, C. 2002. Privacy preserving association rule mining in vertically partitioned data. In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, New York, 639--644. Google Scholar
Digital Library
- Yamamura, A. and Saito, T. 2001. Private information retrieval based on the subgroup membership problem. In Proceedings of the Australian Conference on Information Security and Privacy (ACISP'01). Springer, Berlin, 206--220. Google Scholar
Digital Library
- Yao, A. 1982. Protocols for secure computations. In Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'82). IEEE, Los Alamitos, CA, 160--164. Google Scholar
Digital Library
Index Terms
Efficient and secure protocols for privacy-preserving set operations
Recommendations
Privacy preserving set intersection based on bilinear groups
ACSC '08: Proceedings of the thirty-first Australasian conference on Computer science - Volume 74We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication complexities (N is the number of parties in the protocol). Our protocol is ...
Efficient and short certificateless signatures secure against realistic adversaries
The notion of certificateless cryptography is aimed to eliminate the use of certificates in traditional public key cryptography and also to solve the key-escrow problem in identity-based cryptography. Many kinds of security models have been designed for ...
Improved security for linearly homomorphic signatures: a generic framework
PKC'12: Proceedings of the 15th international conference on Practice and Theory in Public Key CryptographyWe propose a general framework that converts (ordinary) signature schemes having certain properties into linearly homomorphic signature schemes, i.e., schemes that allow authentication of linear functions on signed data. The security of the homomorphic ...






Comments