{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T22:51:25Z","timestamp":1781823085537,"version":"3.54.5"},"reference-count":24,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.23919\/isita.2018.8664337","type":"proceedings-article","created":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T23:49:11Z","timestamp":1552348151000},"page":"530-534","source":"Crossref","is-referenced-by-count":12,"title":["Secure Division Protocol and Applications to Privacy-preserving Chi-squared Tests"],"prefix":"10.23919","author":[{"given":"Hiraku","family":"Morita","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nuttapong","family":"Attrapadung","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Satsuya","family":"Ohata","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Koji","family":"Nuida","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shota","family":"Yamada","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kana","family":"Shimizu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Goichiro","family":"Hanaoka","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kiyoshi","family":"Asai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","first-page":"285","article-title":"Unconditionally secure constant-rounds multi-party compu-tation for equality, comparison, bits and exponentiation","author":"damg\u00e5rd","year":"2006","journal-title":"TCC 2006"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2015.23113"},{"key":"ref12","first-page":"235","article-title":"Privacy-preserving face recognition","author":"erkin","year":"2009","journal-title":"PETS 2009"},{"key":"ref13","first-page":"218","article-title":"How to play any mental game or A completeness theorem for protocols with honest majority","author":"goldreich","year":"1987","journal-title":"19th Annual ACM Symposium on Theory of Computing 1987"},{"key":"ref14","article-title":"Applications of division by convergence","author":"elliot goldschmidt","year":"1964","journal-title":"M Sc dissertation"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14577-3_32"},{"key":"ref16","first-page":"283","article-title":"Secure computation of the mean and related statistics","author":"kiltz","year":"2005","journal-title":"TCC 2005"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/WIFS.2011.6123132"},{"key":"ref18","first-page":"146","article-title":"Software division and square root using goldschmidt’s algorithms","author":"markstein","year":"0"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.12"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/WIFS.2009.5386460"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1029179.1029204"},{"key":"ref6","first-page":"486","article-title":"Secure two-party k-means clustering","author":"bunn","year":"2007","journal-title":"CCS 2007"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-012-0177-2"},{"key":"ref8","first-page":"35","article-title":"Secure computation with fixed-point numbers","author":"catrina","year":"2010","journal-title":"FC 2010"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/DEXA.2009.84"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978331"},{"key":"ref1","year":"0"},{"key":"ref9","first-page":"164","article-title":"On secure two-party integer division","author":"dahl","year":"2012","journal-title":"FC 2012 volume 7397 of Lecture Notes in Computer Science"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1007\/11761679_31","article-title":"Efficient binary conversion for paillier encrypted values","author":"schoenmakers","year":"2006","journal-title":"Eurocrypt 2006"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/WIFS.2010.5711448"},{"key":"ref21","article-title":"A comprehensive protocol suite for secure two-party computation","author":"siim","year":"2016","journal-title":"Master’s thesis"},{"key":"ref24","first-page":"162","article-title":"How to generate and exchange secrets (extended abstract)","author":"chi-chih yao","year":"1986","journal-title":"27th Annual Symposium on Foundations of Computer Science 1986"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1504\/IJACT.2014.062738"}],"event":{"name":"2018 International Symposium on Information Theory and Its Applications (ISITA)","location":"Singapore","start":{"date-parts":[[2018,10,28]]},"end":{"date-parts":[[2018,10,31]]}},"container-title":["2018 International Symposium on Information Theory and Its Applications (ISITA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8660385\/8664205\/08664337.pdf?arnumber=8664337","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T06:28:00Z","timestamp":1643264880000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8664337\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":24,"URL":"https:\/\/doi.org\/10.23919\/isita.2018.8664337","relation":{},"subject":[],"published":{"date-parts":[[2018,10]]}}}