Secure multi-party computational geometry

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

Volumn 2125, Issue , 2001, Pages 165-179

  Atallah, Mikhail J ^a   Du, Wenliang ^a  

^a Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; DATA PRIVACY; DATA STRUCTURES; GEOMETRY; RECONFIGURABLE HARDWARE;

BUILDING BLOCKES; CIRCUIT EVALUATION; COMBINATORIAL PROBLEM; COMMUNICATION COMPLEXITY; GEOMETRIC PROBLEMS; PRIVATE DATA; SECURE MULTI-PARTY COMPUTATION; SPECIFIC PROBLEMS;

PROBLEM SOLVING;

EID: 84958035648     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44634-6_16     Document Type: Conference Paper

References (16)

1. Wenliang Du, Mikhail J. Atallah and Florian Kerschbaum. Protocols for secure remote database access with approximate matching. Submitted to a journal, 2001.
2. J. Benaloh. Dense probabilistic encryption. In Proceedings of the Workshop on Selected Areas of Cryptography, pages 120–128, Kingston, ON, May 1994.
3. C. Cachin. Efficient private bidding and auctions with an oblivious third party. In Proceedings of the 6th ACM conference on Computer and communications security, pages 120–127, Singapore, November 1-4 1999.
4. G. Brassard, C. Crépeau and J. Robert. All-or-nothing disclosure of secrets. In Advances in Cryptology - Crypto86,L ecture Notes in Computer Science, volume 234-238, 1987.
5. Wenliang Du and Mikhail J. Atallah. Privacy-preserving cooperative scientific computations. In 14th IEEE Computer Security Foundations Workshop, Nova Scotia, Canada, June 11-13 2001.
6. O. Goldreich. Secure multi-party computation (working draft). Available from http://www.wisdom.weizmann.ac.il/home/oded/public html/foc.html, 1998.
7. S. Even, O. Goldreich and A. Lempel. A randomized protocol for signing contracts. Communications of the ACM, 28:637–647, 1985.
8. C. Cachin, S. Micali and M. Stadler. Computationally private information retrieval with polylogarithmic communication. Advances in Cryptology: EUROCRYPT’99, Lecture Notes in Computer Science, 1592:402–414, 1999.
9. O. Goldreich, S. Micali and A. Wigderson. How to play any mental game. In Proceedings of the 19th annual ACM symposium on Theory of computing, pages 218–229, 1987.
10. D. Naccache and J. Stern. A new cryptosystem based on higher residues. In Proceedings of the 5th ACM Conference on Computer and Communications Security, pages 59–66, 1998.
11. M. Naor and B. Pinkas. Oblivious transfer and polynomial evaluation (extended abstract). In Proceedings of the 31th ACM Symposium on Theory of Computing, pages 245–254, Atanta, GA, USA, May 1-4 1999.
12. R. Fagin, M. Naor and P. Winkler. Comparing information without leaking it. Communication of the ACM, 39:77–85, 1996.
13. T. Okamoto and S. Uchiyama. An efficient public-key cryptosystem. In Advances in Cryptology – EUROCRYPT 98, pages 308–318, 1998.
14. P. Paillier. Public-key cryptosystems based on composite degree residue classes. In Advances in Cryptology – EUROCRYPT 99, pages 223–238, 1999.
15. A.C. Yao. Protocols for secure computations. In Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, 1982.
16. A.C. Yao. How to generate and exchange secrets. In Proceedings 27th IEEE Symposium on Foundations of Computer Science, pages 162–167, 1986.