{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,12]],"date-time":"2025-04-12T05:10:26Z","timestamp":1744434626911},"reference-count":16,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"7","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2020,7,1]]},"DOI":"10.1587\/transinf.2019icp0014","type":"journal-article","created":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T22:15:35Z","timestamp":1593555335000},"page":"1598-1607","source":"Crossref","is-referenced-by-count":2,"title":["Online-Efficient Interval Test via Secure Empty-Set Check"],"prefix":"10.1587","volume":"E103.D","author":[{"given":"Katsunari","family":"SHISHIDO","sequence":"first","affiliation":[{"name":"Graduate School of Engineering, Osaka University"}]},{"given":"Atsuko","family":"MIYAJI","sequence":"additional","affiliation":[{"name":"Graduate School of Engineering, Osaka University"},{"name":"Japan Advanced Institute of Science and Technology"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] B.H. Bloom, \u201cSpace\/time trade-offs in hash coding with allowable errors,\u201d Commun. ACM, vol.13, no.7, pp.422-426, 1970. 10.1145\/362686.362692","DOI":"10.1145\/362686.362692"},{"key":"2","unstructured":"[2] M. Burkhart and X. Dimitropoulos, \u201cFast private set operations with sepia,\u201d Tech. Rep. 345, 2012."},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] E. De Cristofaro, J. Kim, and G. Tsudik, \u201cLinear-complexity private set intersection protocols secure in malicious model,\u201d In Advances in Cryptology-ASIACRYPT 2010-16th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, Dec. 5-9, 2010. Proceedings, vol.6477, pp.213-231, 2010. 10.1007\/978-3-642-17373-8_13","DOI":"10.1007\/978-3-642-17373-8_13"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] Y. Dou, H.C.B. Chan, M.H. Au, and Y. Mu, \u201cOrder-hiding range query over encrypted data without search pattern leakage,\u201d Comput. J., vol.61, no.12, pp.1806-1824, 2018. 10.1093\/comjnl\/bxy075","DOI":"10.1093\/comjnl\/bxy075"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] R. Egert, M. Fischlin, D. Gens, S. Jacob, M. Senker, and J. Tillmanns, \u201cPrivately computing set-union and set-intersection cardinality via bloom filters,\u201d In Information Security and Privacy-20th Australasian Conference, ACISP 2015, Brisbane, QLD, Australia, June 29-July 1, 2015, Proceedings, vol.9144, pp.413-430, 2015. 10.1007\/978-3-319-19962-7_24","DOI":"10.1007\/978-3-319-19962-7_24"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] L. Kissner and D.X. Song, \u201cPrivacy-preserving set operations,\u201d In Advances in Cryptology-CRYPTO 2005: 25th Annual International Cryptology Conference, Santa Barbara, California, USA, August 14-18, 2005, Proceedings, vol.3621, pp.241-257, 2005. 10.1007\/11535218_15","DOI":"10.1007\/11535218_15"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] H.-Y.Lin and W.-G. Tzeng, \u201cAn efficient solution to the millionaires' problem based on homomorphic encryption,\u201d In Applied Cryptography and Network Security, Third International Conference, ACNS 2005, New York, NY, USA, June 7-10, 2005, Proceedings, vol.3531, pp.456-466, 2005. 10.1007\/11496137_31","DOI":"10.1007\/11496137_31"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[9] A. Miyaji, K. Nakasho, and S. Nishida, \u201cPrivacy-preserving integration of medical data-A practical multiparty private set intersection,\u201d J. Medical Systems, vol.41, no.3, pp.37:1-37:10, 2017. 10.1007\/s10916-016-0657-4","DOI":"10.1007\/s10916-016-0657-4"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[10] H. Morita and N. Attrapadung, \u201cClient-aided two-party secure interval test protocol,\u201d In Cryptology and Network Security-18th International Conference, CANS 2019, Fuzhou, China, Oct. 25-27, 2019, Proceedings, vol.11829, pp.328-343, 2019. 10.1007\/978-3-030-31578-8_18","DOI":"10.1007\/978-3-030-31578-8_18"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[11] T. Nishide and K. Ohta, \u201cConstant-round multiparty computation for interval test, equality test, and comparison,\u201d IEICE Transactions, vol.90-A, no.5, pp.960-968, 2007. 10.1093\/ietfec\/e90-a.5.960","DOI":"10.1093\/ietfec\/e90-a.5.960"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[12] P. Paillier, \u201cPublic-key cryptosystems based on composite degree residuosity classes,\u201d In Advances in Cryptology-EUROCRYPT '99, International Conference on the Theory and Application of Cryptographic Techniques, Prague, Czech Republic, May 2-6, 1999, Proceeding, vol.1592, pp.223-238, 1999. 10.1007\/3-540-48910-x_16","DOI":"10.1007\/3-540-48910-X_16"},{"key":"12","unstructured":"[13] K. Peng, F. Bao, and E. Dawson, \u201cCorrect, private, flexible and efficient range test,\u201d Journal of Research and Practice in Information Technology, vol.40, no.4, pp.275-289, 2008."},{"key":"13","doi-asserted-by":"publisher","unstructured":"[14] Y. Sang and H. Shen, \u201cEfficient and secure protocols for privacy-preserving set operations,\u201d ACM Trans. Inf. Syst. Secur., vol.13, no.1, pp.9:1-9:35, 2009. 10.1145\/1609956.1609965","DOI":"10.1145\/1609956.1609965"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[15] K. Shishido and A. Miyaji, \u201cSecure online-efficient interval test based on empty-set check,\u201d In 14th Asia Joint Conference on Information Security, AsiaJCIS 2019, Kobe, Japan, Aug. 1-2, 2019, pp.56-63, 2019. 10.1109\/asiajcis.2019.000-5","DOI":"10.1109\/AsiaJCIS.2019.000-5"},{"key":"15","unstructured":"[16] A.C.-C. Yao, \u201cProtocols for secure computations (extended abstract),\u201d In 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3-5 Nov. 1982, pp.160-164, 1982. 10.1109\/sfcs.1982.38"},{"key":"16","unstructured":"[17] A.C.-C. Yao, \u201cHow to generate and exchange secrets (extended abstract),\u201d In 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27-29 Oct. 1986, pp.162-167, 1986. 10.1109\/sfcs.1986.25"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E103.D\/7\/E103.D_2019ICP0014\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,4]],"date-time":"2020-07-04T03:24:47Z","timestamp":1593833087000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E103.D\/7\/E103.D_2019ICP0014\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,1]]},"references-count":16,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2019icp0014","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,1]]}}}