{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T13:21:19Z","timestamp":1725715279646},"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.8664363","type":"proceedings-article","created":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T23:49:11Z","timestamp":1552348151000},"page":"535-539","source":"Crossref","is-referenced-by-count":1,"title":["Accuracy\/Efficiency Trade-Off for Privacy-Preserving Division Protocol"],"prefix":"10.23919","author":[{"given":"Satsuya","family":"Ohata","sequence":"first","affiliation":[]},{"given":"Hiraku","family":"Morita","sequence":"additional","affiliation":[]},{"given":"Goichiro","family":"Hanaoka","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"235","article-title":"Privacy-Preserving Face Recognition","author":"erkin","year":"2009","journal-title":"Proceedings of PETS 2009"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656"},{"key":"ref12","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":"Proc of STOC 1987"},{"key":"ref13","article-title":"Applications of Division by Convergence","author":"goldschmidt","year":"1964","journal-title":"M Sc dissertation"},{"key":"ref14","first-page":"375","article-title":"Modulo Reduction for Paillier Encryptions and Application to Secure Statistical Analysis","author":"guajardo","year":"2010","journal-title":"Proc FCCM 2010"},{"key":"ref15","first-page":"283","article-title":"Secure Computation of the Mean and Related Statistics","author":"kiltz","year":"2005","journal-title":"Proc of TCC 2005"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/WIFS.2011.6123132"},{"key":"ref17","first-page":"146","article-title":"Software Division and Square Root Using Goldschmidt’s Algorithms","author":"markstein","year":"2004","journal-title":"Proc of RNC 2004"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.12"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.23919\/ISITA.2018.8664337"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-012-0177-2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/WIFS.2009.5386460"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/DEXA.2009.84"},{"key":"ref5","first-page":"486","article-title":"Secure Two-Party K-Means Clustering","author":"bunn","year":"2007","journal-title":"Proc of CCS 2007"},{"key":"ref8","first-page":"164","article-title":"On Secure Two-Party Integer Division","author":"dahl","year":"2012","journal-title":"Proceedings of FCV 2012"},{"key":"ref7","first-page":"35","article-title":"Secure Computation with Fixed-Point Numbers","author":"catrina","year":"2010","journal-title":"Proc FCCM 2010"},{"key":"ref2","first-page":"420","article-title":"Efficient Multiparty Protocols Using Circuit Randomization","author":"beaver","year":"1991","journal-title":"Proc of CRYPTO 1991 LNCS 576"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1029179.1029204"},{"key":"ref9","first-page":"285","article-title":"Unconditionally Secure Constant-Rounds Multi-Party Computation for Equality, Comparison, Bits and Exponentiation","author":"damg\u00e5rd","year":"2006","journal-title":"Proc TCC 2006"},{"key":"ref20","first-page":"522","article-title":"Efficient Binary Conversion for Paillier Encrypted Values","author":"schoenmakers","year":"2006","journal-title":"Proc 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 thesis"},{"key":"ref24","first-page":"162","article-title":"How to Generate and Exchange Secrets (Extended Abstract)","author":"yao","year":"1986","journal-title":"Proc of FOCS 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)","start":{"date-parts":[[2018,10,28]]},"location":"Singapore","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\/08664363.pdf?arnumber=8664363","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T04:10:36Z","timestamp":1643256636000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8664363\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":24,"URL":"https:\/\/doi.org\/10.23919\/isita.2018.8664363","relation":{},"subject":[],"published":{"date-parts":[[2018,10]]}}}