Secure computation of the vector dominance problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4991 LNCS, Issue , 2008, Pages 319-333

  Yuan, Jin ^a   Ye, Qingsong ^a   Wang, Huaxiong ^a,b   Pieprzyk, Josef ^a  

^a MACQUARIE UNIVERSITY   (Australia)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; NETWORK PROTOCOLS; PROBLEM SOLVING; VECTORS;

ROUND COMPLEXITY; SECURE COMPUTATION; VECTOR DOMINANCE;

SECURITY SYSTEMS;

EID: 41549152568     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79104-1_23     Document Type: Conference Paper

References (19)

1. Atallah, M.J., Du, W.: Secure Multi-Party Computational Geometry. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol. 2125, pp. 165-179. Springer, Heidelberg (2001)
2. Blake, I.F., Kolesnikov, V.: Strong Conditional Oblivious Transfer and Computing on Intervals. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol. 3329, pp. 515-529. Springer, Heidelberg (2004)
3. Blake, I.F., Kolesnikov, V.: Conditional Encrypted Mapping and Comparing Encrypted Numbers. In: Di Crescenzo, G., Rubin, A. (eds.) FC 2006. LNCS, vol. 4107, pp. 206-220. Springer, Heidelberg (2006)
4. Boneh, D., Goh, E., Nissim, K.: Evaluating 2-DNF Formulas on Ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 325-341. Springer, Heidelberg (2005)
5. Cramer, R., Damgård, I.: Zero-Knowledge Proof for Finite Field Arithmetic, or: Can Zero-Knowledge Be For Free. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 424-441. Springer, Heidelberg (1998)
6. Cramer, R., Damgård, I., Schoenmakers, B.: Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. In: Desmedt, Y. G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 174-187. Springer, Heidelberg (1994)
7. Fischlin, M.: A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 457-471. Springer, Heidelberg (2001)
8. Freedman, M.J., Nissim, K., Pinkas, B.: Effective Private Matching and Set Interseciton. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 1-19. Springer, Heidelberg (2004)
9. Fujisaki., E., Okamoto, T.: Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 16-30. Springer, Heidelberg (1997)
10. Hohenberger, S., Weis, S.A.: Honest-Verifier Private Disjointness Testing Without Random Oracles. In: Danezis, G., Golle, P (eds.) PET 2006. LNCS, vol. 4258, pp. 277-294. Springer, Heidelberg (2006)
11. Ioannidis., I., Grama, G.: An Efficient Protocol for Yao's Millionaires Problem. In: HICSS 2003, vol. 07(7), p. 205. IEEE, Los Alamitos (2003)
12. Kiayias., A., Mitrofanova, A.: Testing Disjointness of Private Datasets. In: S. Patrick, A., Yung, M. (eds.) FC 2005. LNCS, vol. 3570, pp. 109-124. Springer, Heidelberg (2005)
13. Lin, H.Y., Tzeng, W.G.: An Efficient Solution to the Millionaires Problem Based on Homomorphic Encryption. In: Ioannidis, J., Keromytis, A.D., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 456-466. Springer, Heidelberg (2005)
14. Paillier, P.: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223-238. Springer, Heidelberg (1999)
15. Sang, Y.: Efficient Solutions to Several Privacy Preserving Computation Problems. Ph.D. thesis, Japan Advanced Institute of Science and Technology (2007)
16. Sang, Y., Shen, H., Zhang, Z.: An Efficient Protocol for the Problem of Secure Two-Party Vector Dominance. In: 6th International Conference on Parallel and Distributed Computing, Applications and Technologies, pp. 488-492. IEEE, Los Alamitos (2005)
17. Schoenmakers, B., Tuyls, P.: Practical Two-Party Computation Based on the Conditional Gate. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol. 3329, pp. 119-136. Springer, Heidelberg (2004)
18. Schnorr, C.P.: Efficient Signature Generation by Smart Cards. Journal of Cryptology 4(3), 161-174 (1997)
19. Yao, A.C.: Protocols for Secure Computations. In: 23rd IEEE Symp. on Foundations of Computer Science, pp. 160-164. IEEE Computer Society Press, Los Alamitos (1982)