{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T16:37:50Z","timestamp":1725986270781},"publisher-location":"Singapore","reference-count":15,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811076404"},{"type":"electronic","value":"9789811076411"}],"license":[{"start":{"date-parts":[[2018,8,2]],"date-time":"2018-08-02T00:00:00Z","timestamp":1533168000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-981-10-7641-1_31","type":"book-chapter","created":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T05:36:16Z","timestamp":1533101776000},"page":"357-363","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Secure Sum Computation Using Homomorphic Encryption"],"prefix":"10.1007","author":[{"given":"Rashid","family":"Sheikh","sequence":"first","affiliation":[]},{"given":"Durgesh Kumar","family":"Mishra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,2]]},"reference":[{"key":"31_CR1","unstructured":"http:\/\/en.wikipedia.org\/wiki\/Secure_multi-party_computation"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Clifton C, Kantarcioglu M, Vaidya J, Lin X, Zhu MY (2002) Tools for privacy-preserving distributed data mining. J. SIGKDD Explor Newsl 4(2):28\u201334. ACM Press","DOI":"10.1145\/772862.772867"},{"key":"31_CR3","unstructured":"Sheikh R, Kumar B, Mishra DK (2010) Changing neighbors k-secure sum protocol for secure multi-party computation. Int J of Comput Sci Inf Secur, USA, 7(1) (Accepted for publication)"},{"key":"31_CR4","unstructured":"Sheikh R, Kumar B, Mishra DK (2009) Privacy-preserving k-secure sum protocol. Int J Comput Sci Inf Secur, USA, 6(2):184\u2013188"},{"key":"31_CR5","unstructured":"Sheikh R, Kumar B, Mishra DK (2009) A distributed k-secure sum protocol for secure multi-party computation. Submitted to a journal"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Yao AC (1982) Protocol for secure computations. In: Proceedings of the 23rd annual IEEE symposium on foundation of computer science, pp 160\u2013164","DOI":"10.1109\/SFCS.1982.38"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Goldreich O, Micali S, Wigderson A (1987) How to play any mental game. In: STOC\u201987: Proceedings of the nineteenth annual ACM conference on theory of computing, New York, NY, USA: ACM, pp 218\u2013229","DOI":"10.1145\/28395.28420"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Chor B, Gilbao N (1997) Computationally private information retrieval (extended abstract). In: Proceedings of 29th annual ACM symposium on theory of computing, El Paso, TX USA, May 1997","DOI":"10.1145\/258533.258609"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Chor B, Kushilevitz E, Goldreich O, Sudan M (1995) Private information retrieval. In: Proceedings of the 36th annual IEEE symposium on foundations of computer science, Milwaukee\u00a0WI, pp 41\u201350, Oct 1995","DOI":"10.1109\/SFCS.1995.492461"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Lindell Y, Pinkas B (2000) Privacy preserving data mining in advances in cryptography-Crypto2000, lecture notes in computer science, vol 1880","DOI":"10.1007\/3-540-44598-6_3"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (2000) Privacy-preserving data mining. In: Proceedings of the 2000 ACM SIGMOD on management of data, Dallas, TX USA, pp 439\u2013450, 15\u201318 May 2000","DOI":"10.1145\/342009.335438"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Atallah MJ, Du W (2001) Secure multiparty computational geometry. In: Proceedings of seventh international workshop on algorithms and data structures (WADS2001). Providence, Rhode Island, USA, pp 165\u2013179, 8\u201310 Aug 2001","DOI":"10.1007\/3-540-44634-6_16"},{"key":"31_CR13","unstructured":"Du W, Atallah MJ (2001) Privacy-preserving cooperative scientific computations. In: 14th IEEE computer security foundations workshop, Nova Scotia, Canada, pp 273\u2013282, 11\u201313 Jun 2001"},{"key":"31_CR14","unstructured":"Du W, Atallah MJ (2001) Privacy-preserving statistical analysis. In: Proceedings of the 17th annual computer security applications conference, New Orleans, Louisiana, USA, pp 102\u2013110, 10\u201314 Dec 2001"},{"key":"31_CR15","doi-asserted-by":"crossref","unstructured":"Paillier P (1999) Public-key cryptosystems based on composite degree residuosity classes. In: EUROCRYPT\u201999, Prague, Czech Republic, pp 223\u2013238, 2\u20136 May 1999","DOI":"10.1007\/3-540-48910-X_16"}],"container-title":["Lecture Notes on Data Engineering and Communications Technologies","Data Science and Big Data Analytics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-7641-1_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,21]],"date-time":"2019-10-21T12:54:03Z","timestamp":1571662443000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-7641-1_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,2]]},"ISBN":["9789811076404","9789811076411"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-7641-1_31","relation":{},"ISSN":["2367-4512","2367-4520"],"issn-type":[{"type":"print","value":"2367-4512"},{"type":"electronic","value":"2367-4520"}],"subject":[],"published":{"date-parts":[[2018,8,2]]}}}