{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T00:18:20Z","timestamp":1715300300351},"reference-count":20,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2022,8,1]]},"DOI":"10.1587\/transinf.2021edp7187","type":"journal-article","created":{"date-parts":[[2022,7,31]],"date-time":"2022-07-31T22:19:37Z","timestamp":1659305977000},"page":"1418-1430","source":"Crossref","is-referenced-by-count":0,"title":["Locally Differentially Private Minimum Finding"],"prefix":"10.1587","volume":"E105.D","author":[{"given":"Kazuto","family":"FUKUCHI","sequence":"first","affiliation":[{"name":"University of Tsukuba"},{"name":"Center for Advanced Intelligence Project, RIKEN"}]},{"given":"Chia-Mu","family":"YU","sequence":"additional","affiliation":[{"name":"National Yang Ming Chiao Tung University"}]},{"given":"Jun","family":"SAKUMA","sequence":"additional","affiliation":[{"name":"University of Tsukuba"},{"name":"Center for Advanced Intelligence Project, RIKEN"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] C. Dwork, F. McSherry, K. Nissim, and A. Smith, \u201cCalibrating noise to sensitivity in private data analysis,\u201d Theory of Cryptography, ed. S. Halevi and T. Rabin, Berlin, Heidelberg, pp.265-284, Springer Berlin Heidelberg, 2006. 10.1007\/11681878_14","DOI":"10.1007\/11681878_14"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] A. Evfimievski, J. Gehrke, and R. Srikant, \u201cLimiting privacy breaches in privacy preserving data mining,\u201d Proc. twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pp.211-222, ACM, June 2003. 10.1145\/773153.773174","DOI":"10.1145\/773153.773174"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] J.C. Duchi, M.I. Jordan, and M.J. Wainwright, \u201cLocal privacy and statistical minimax rates,\u201d 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp.429-438, 2013. 10.1109\/FOCS.2013.53","DOI":"10.1109\/FOCS.2013.53"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] \u00da. Erlingsson, V. Pihur, and A. Korolova, \u201cRAPPOR: Randomized aggregatable privacy-preserving ordinal response,\u201d Proc. 2014 ACM SIGSAC Conference on Computer and Communications Security (CCS), pp.1054-1067, ACM, Nov. 2013. 10.1145\/2660267.2660348","DOI":"10.1145\/2660267.2660348"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] G.C. Fanti, V. Pihur, and U. Erlingsson, \u201cBuilding a RAPPOR with the unknown: Privacy-preserving learning of associations and data dictionaries,\u201d Proceedings on Privacy Enhancing Technologies (PoPETs), vol.2016, no.3, pp.41-61, 2016. 10.1515\/popets-2016-0015","DOI":"10.1515\/popets-2016-0015"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] X. Ren, C.M. Yu, W. Yu, S. Yang, X. Yang, J.A. McCann, and P.S. Yu, \u201cLoPub: High-dimensional crowdsourced data publication with local differential privacy,\u201d IEEE Trans. Inf. Forensics Security, vol.13, no.9, pp.2151-2166, Sept. 2018. 10.1109\/TIFS.2018.2812146","DOI":"10.1109\/TIFS.2018.2812146"},{"key":"7","unstructured":"[7] T. Murakami and Y. Kawamoto, \u201cUtility-optimized local differential privacy mechanisms for distribution estimation,\u201d Proc. 28th USENIX Conference on Security Symposium, SEC&apos;19, USA, p.1877-1894, USENIX Association, 2019."},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] R. Bassily and A.D. Smith, \u201cLocal, Private, efficient protocols for succinct histograms,\u201d Proc. Forty-Seventh Annual ACM on Symposium on Theory of Computing (STOC), pp.127-135, ACM, June 2015. 10.1145\/2746539.2746632","DOI":"10.1145\/2746539.2746632"},{"key":"9","unstructured":"[9] M. Gaboardi, R. Rogers, and O. Sheffet, \u201cLocally private mean estimation: <i>z<\/i>-test and tight confidence intervals,\u201d Proc. Machine Learning Research, ed. K. Chaudhuri and M. Sugiyama, Proc. Machine Learning Research, vol.89, pp.2545-2554, PMLR, 2019."},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] M. Joseph, J. Mao, S. Neel, and A. Roth, \u201cThe role of interactivity in local differential privacy,\u201d 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), pp.94-105, IEEE, Nov. 2019. 10.1109\/FOCS.2019.00015","DOI":"10.1109\/FOCS.2019.00015"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] S.L. Warner, \u201cRandomized response: A survey technique for eliminating evasive answer bias,\u201d J. American Statistical Association, 1965. 10.1080\/01621459.1965.10480775","DOI":"10.1080\/01621459.1965.10480775"},{"key":"12","unstructured":"[12] B. Ding, J. Kulkarni, and S. Yekhanin, \u201cCollecting telemetry data privately,\u201d Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems (NIPS), pp.3574-3583, 2017."},{"key":"13","unstructured":"[13] T.T. Nguy\u00ean, X. Xiao, Y. Yang, S.C. Hui, H. Shin, and J. Shin, \u201cCollecting and analyzing data from smart device users with local differential privacy,\u201d ArXiv e-prints, 2016. 10.48550\/arXiv.1606.05053"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] B. Ding, H. Nori, P. Li, and A. Joshua, \u201cComparing population means under local differential privacy: with significance and power,\u201d Proc. Thirty-Second AAAI Conference on Artificial Intelligence, pp.26-33, AAAI Press, Feb. 2018.","DOI":"10.1609\/aaai.v32i1.11301"},{"key":"15","unstructured":"[15] P. Kairouz, S. Oh, and P. Viswanath, \u201cExtremal mechanisms for local differential privacy,\u201d J. Mach. Learn. Res. (JMLR), vol.17, pp.17:1-17:51, 2016."},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] B. Cyphers and K. Veeramachaneni, \u201cAnonML: Locally private machine learning over a network of peers,\u201d IEEE Int. Conf. Data Science and Advanced Analytics (DSAA), pp.549-560, IEEE, 2017. 10.1109\/DSAA.2017.80","DOI":"10.1109\/DSAA.2017.80"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] Z. Qin, Y. Yang, T. Yu, I. Khalil, K. Xiao, and K. Ren, \u201cHeavy hitter estimation over set-valued data with local differential privacy,\u201d ACM Conference on Computer and Communications Security (CCS), 2016. 10.1145\/2976749.2978409","DOI":"10.1145\/2976749.2978409"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] T. Wang, N. Li, and S. Jha, \u201cLocally differentially private frequent itemset mining,\u201d IEEE Symposium on Security and Privacy (S&amp;P), pp.127-143, IEEE, 2018. 10.1109\/SP.2018.00035","DOI":"10.1109\/SP.2018.00035"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] S. Boucheron, G. Lugosi, and P. Massart, \u201cConcentration inequalities using the entropy method,\u201d The Annals of Probability, vol.31, no.3, pp.1583-1614, 7 2003. 10.1214\/aop\/1055425791","DOI":"10.1214\/aop\/1055425791"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] J. Duchi, M. Wainwright, and M. Jordan, \u201cMinimax optimal procedures for locally private estimation,\u201d J. American Statistical Association, vol.113, no.521, pp.182-201, 2018.","DOI":"10.1080\/01621459.2017.1389735"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E105.D\/8\/E105.D_2021EDP7187\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T04:55:52Z","timestamp":1715230552000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E105.D\/8\/E105.D_2021EDP7187\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,1]]},"references-count":20,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2022]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2021edp7187","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,1]]},"article-number":"2021EDP7187"}}