Secure multiparty overall mean computation via oblivious polynomial evaluation

Security of Information and Networks - Proceedings of the 1st International Conference on Security of Information and Networks, SIN 2007

Volumn , Issue , 2008, Pages 84-95

  Özarar, Mert ^a   Özgit, Attila ^a  

^a MIDDLE EAST TECHNICAL UNIVERSITY   (Turkey)

Author keywords

Oblivious Polynomial Evaluation; Overall Mean; Secure Multiparty Computation

Indexed keywords

PRIVACY-PRESERVING TECHNIQUES;

COMPUTATION PROBLEMS; COOPERATIVE COMPUTATION; CRYPTOGRAPHICS; DATA VALUES; INTERNET TECHNOLOGY; OBLIVIOUS POLYNOMIAL EVALUATION; OVERALL MEAN; PRIVACY PRESERVING; PRIVATE DATA; SECURE MULTI-PARTY COMPUTATION;

POLYNOMIALS;

EID: 84893160367     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Atallah M. J. and Du W.: Secure Multi-Party Computational Geometry. In Proceedings of 7th International Workshop on Algorithms and Data Structures (WADS 2001), 165-179
2. Canetti R.: Security and composition of multi-party cryptographic protocols. Journal of Cryptology, (2000) 13(1):143-202
3. Du W. and Atallah M. J.: Privacy-preserving cooperative statistical analysis. In Annual ComputerSecurity Applications Conference ACSAC) (2001) 102-110
4. Du W. and Atallah M. J.: Privacy-Preserving Cooperative Scientific Computations. In 14th IEEE Computer Security Foundations Workshop, (2001), 273-282
5. Du W. and Atallah M J.: Secure Multi-Party Computation Problems and their Applications: Review and Open Problems. In New Security Paradigms Workshop (2001) 11-20
6. Du W. and Atallah M. J.: A Practical Approach to Solve Secure Multi-party Computation Problems. In New Security Paradigms Workshop (2002) 127-135
7. Duda R.O., Hart P.E. and Stork D.G.: Pattern Classification. John Wiley & Sons, (2001)
8. Goethals B., Laur S., Lipmaa H. and Mielikäinen T.: On Private Scalar Product Computation for Privacy-Preserving Data Mining. The 7th Annual International Conference in Information Security and Cryptology (ICISC 2004), volume 3506 of Lecture Notes in Computer Science, (2004) 104-120
9. Goldreich O., Micali S. and Wigderson A.: How to play any mental game - a completeness theorem for protocols with honest majority. In 19th Symposium on Theory of Computer Science, (1987) 218-229
10. Goldreich O.: Foundations of Cryptography: Volume 2, Basic Applications. Cambridge University Press, (2004)
11. Jha S., Kruger L. and McDaniel P.: Privacy Preserving Clustering 10th European Symposium On Research In Computer Security (ESORICS), Milan, (2005)
12. Lindell Y. and Pinkas B.: Privacy preserving data mining. In Advances in Cryptology (Crypto 2000), (2000) 36-54
13. Naor M. and Pinkas B.: Oblivious transfer and polynomial evaluation. In 31st Symposium on Theory of Computer Science, (1999) 245-254
14. Naor M. and Pinkas B.: Computationally Secure Oblivious Transfer Journal of Cryptology, Vol. 18, No. 1, 2005
15. Paillier P.: Public-key cryptosystems based on composite degree residuosity classes. In Proceedings of Advances in Cryptology (EUROCRYPT'99), 1999
16. Pinkas B.: Cryptographic Techniques for Privacy-Preserving Data Mining SIGKDD Explorations, the newsletter of the ACM Special Interest Group on Knowledge Discovery and Data Mining, (2003)
17. Rabin M.: How to exchange secrets by oblivious transfer. Technical Report Tech. Memo TR-81, Aiken Computation Laboratory, 1981
18. Yao A.C.: How to generate and exchange secrets. In 27th IEEE Symposium on Foundations of Computer Science, (1986) 162-167