Efficient and secure protocols for privacy-preserving set operations

ACM Transactions on Information and System Security

Volumn 13, Issue 1, 2009, Pages

  Sang, Yingpeng ^a   Shen, Hong ^a  

^a UNIVERSITY OF ADELAIDE   (Australia)

Author keywords

Bilinear groups; Cryptographic protocol; Noninteractive zeroknowledge argument; Privacy preservation; Set operations

Indexed keywords

CRYPTOGRAPHIC PROTOCOLS; NON-INTERACTIVE; PRIVACY PRESERVATION; SET OPERATION; ZERO KNOWLEDGE;

BROADCASTING; FLUORINE CONTAINING POLYMERS; NETWORK PROTOCOLS; NETWORK SECURITY; POLYNOMIAL APPROXIMATION;

CRYPTOGRAPHY;

EID: 72449139107     PISSN: 10949224     EISSN: 15577406     Source Type: Journal    
DOI: 10.1145/1609956.1609965     Document Type: Conference Paper

References (35)

1. 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.
2. 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.
3. 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.
4. BONEH, D. AND FRANKLIN, M. 2003. Identity-based encryption from the Weil pairing. SIAM J. Comput. 32, 3, 586-615.
5. 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.
6. 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.
7. 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.
8. 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.
9. 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.
10. 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.
11. GALBRAITH, S. D. 2002. Elliptic curve paillier schemes. J. Cryptology 15, 2,129-138.
12. GOLDREICH, O. 2004. Foundations of Cryptography, vol.2. Cambridge University Press, Cambridge, UK.
13. 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.
14. 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.
15. 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.
16. 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.
17. KISSNER, L. AND SONG, D. 2005. Privacy-preserving set operations. In Advances in Cryptology (CRYPTO'05). Springer, Berlin, 241-257.
18. KISSNER, L. AND SONG, D. 2006. Privacy-preserving set operations. Tech. rep. CMU-CS-05-113, Carnegie Mellon University.
19. LAMPORT, L., SHOSTACK, R., AND PEASE, M. 1982. The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4, 3,382-401.
20. 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.
21. LINDELL, Y. 2003. Parallel coin-tossing and constant-round secure two-party computation. J. Cryptology 16, 3, 143-184.
22. 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.
23. MENEZES, A.,OORSCHOT, P., ANDVANSTONE, S. 1996. Handbook of Applied Cryptography.CRCPress, Boca Raton, FL.
24. MILLER, V. 2004. The Weil pairing, and its efficient calculation. J. Cryptology 17, 4, 235-261.
25. 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.
26. PEDERSEN, T. 1991. A threshold cryptosystem without a trusted party. In Proceedings of Advances in Cryptology (EUROCRYPT'91). Springer, Berlin, 522-526.
27. 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.
28. 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.
29. 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.
30. 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.
31. 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.
32. SHAMIR, A. 1979. How to share a secret. Comm. ACM 22, 11, 612-613.
33. 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.
34. 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.
35. 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.