1 |
O. Goldreich, 'Secure Multi-Party Computation (Final Draft, Version 1.4)', http://www.wisdom.weizmann.ac.il/home/oded/public_html/foc.html, 2002
|
2 |
M. Atallah, M. Bykova, J. Li, K. Frikken, M. Topkara, 'Private collaborative forecasting and benchmarking', WEPS2004, 2004
|
3 |
W. Du, M. Atallah, 'Secure multiparty computation problems and their applications: A review and open problems', Proceedings of New Security Paradigms Workshop, pp. 11-20, 2001
|
4 |
L. Kissner, D. Song, 'Privacy-Preserving Set Operation', Advances in Cryptology - CRYPTO 2005, LNCS 3621, Springer-Verlag, pp. 241-257, 2005
|
5 |
M. Freedman, K. Nissim, B. Pinkas, 'Efficient private matching and set intersection', Advances in Cryptology-Eurocrypt 2004, LNCS 3027, Springer- Verlag, pp. 1-19, 2004
|
6 |
M. Naor, B. Pinkas, 'Oblivious transfer and polynomial evaluation', Proceedings of the 31th ACMSTC, pp. 245-254, 1999
|
7 |
W. Du, M.Atallah, 'Privacy-preserving cooperative scientific computations', 14th IEEE Computer Security Foundations Workshop, pp. 273-282, 2001
|
8 |
O. Goldreich, S. Micali, A. Wigderson, 'How to play any mental game', Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pp. 218- 229, 1987
|
9 |
Y. Lindell, B. Pinkas, 'Privacy preserving data mining', CRYPTO 2000, LNCS 1880, 2000
|
10 |
W. Du, M. Atallah, 'Protocols for secure remote database access with approximate matching', ACMCCS2000, 2000
|
11 |
H. Anton, R. C. Busby, Contemporary Linear Algebra, John Wiley & Sons, 2003
|
12 |
A.C. Yao, 'Protocols for secure computations', Proceedings of the 23th Annual IEEE Symposium on Foundations of Computer Science, 1982
|
13 |
R. Cramer, I. Damgard, 'Secure distributed linear algebra in a constant number of rounds', CRYPTO 2001, LNCS 2139, pp. 119-136, 2001
|