{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,4]],"date-time":"2023-03-04T03:40:47Z","timestamp":1677901247802},"reference-count":12,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2023,3,1]]},"DOI":"10.1587\/transfun.2022cip0019","type":"journal-article","created":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T22:10:29Z","timestamp":1661206229000},"page":"272-280","source":"Crossref","is-referenced-by-count":0,"title":["Perfectly Secure Oblivious Priority Queue"],"prefix":"10.1587","volume":"E106.A","author":[{"given":"Atsunori","family":"ICHIKAWA","sequence":"first","affiliation":[{"name":"NTT Social Informatics Laboratories"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wakaha","family":"OGATA","sequence":"additional","affiliation":[{"name":"Tokyo Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] X.S. Wang, K. Nayak, C. Liu, T.H.H. Chan, E. Shi, E. Stefanov, and Y. Huang, \u201cOblivious data structures,\u201d Proc. 2014 ACM SIGSAC Conference on Computer and Communications Security, CCS '14, New York, NY, USA, pp.215-226, Association for Computing Machinery, 2014. 10.1145\/2660267.2660314","DOI":"10.1145\/2660267.2660314"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] M. Keller and P. Scholl, \u201cEfficient, oblivious data structures for mpc,\u201d Advances in Cryptology-ASIACRYPT 2014, Berlin, Heidelberg, pp.506-525, Springer Berlin Heidelberg, 2014. 10.1007\/978-3-662-45608-8_27","DOI":"10.1007\/978-3-662-45608-8_27"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] E. Shi, \u201cPath oblivious heap: Optimal and practical oblivious priority queue,\u201d 2020 IEEE Symposium on Security and Privacy (SP), Los Alamitos, CA, USA, pp.842-858, IEEE Computer Society, May 2020. 10.1109\/sp40000.2020.00037","DOI":"10.1109\/SP40000.2020.00037"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] O. Goldreich, \u201cTowards a theory of software protection and simulation by oblivious RAMs,\u201d Proc. Nineteenth Annual ACM Symposium on Theory of Computing, STOC'87, New York, NY, USA, pp.182-194, Association for Computing Machinery, 1987. 10.1145\/28395.28416","DOI":"10.1145\/28395.28416"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] O. Goldreich and R. Ostrovsky, \u201cSoftware protection and simulation on oblivious rams,\u201d J. ACM, vol.43, no.3, pp.431-473, May 1996. 10.1145\/233551.233553","DOI":"10.1145\/233551.233553"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] R. Ostrovsky, \u201cEfficient computation on oblivious RAMs,\u201d Proc. Twenty-Second Annual ACM Symposium on Theory of Computing, STOC'90, New York, NY, USA, p.514-523, Association for Computing Machinery, 1990. 10.1145\/100216.100289","DOI":"10.1145\/100216.100289"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] G. Asharov, I. Komargodski, W. Lin, K. Nayak, E. Peserico, and E. Shi, \u201cOptorama: Optimal oblivious RAM,\u201d Advances in Cryptology-EUROCRYPT, pp.403-432, 2020. 10.1007\/978-3-030-45724-2_14","DOI":"10.1007\/978-3-030-45724-2_14"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] T.H.H. Chan, K. Nayak, and E. Shi, \u201cPerfectly secure oblivious parallel RAM,\u201d Theory of Cryptography, Cham, pp.636-668, Springer International Publishing, 2018. 10.1007\/978-3-030-03810-6_23","DOI":"10.1007\/978-3-030-03810-6_23"},{"key":"9","unstructured":"[9] T.H.H. Chan, E. Shi, W.K. Lin, and K. Nayak, \u201cPerfectly oblivious (parallel) RAM revisited, and improved constructions,\u201d Cryptology ePrint Archive, Report 2020\/604, 2020. https:\/\/ia.cr\/2020\/604"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] T. Toft, \u201cSecure data structures based on multi-party computation,\u201d Proc. 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC'11, New York, NY, USA, pp.291-292, Association for Computing Machinery, 2011. 10.1145\/1993806.1993859","DOI":"10.1145\/1993806.1993859"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] Z. Jafargholi, K.G. Larsen, and M. Simkin, \u201cOptimal oblivious priority queues,\u201d Proc. 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.2366-2383, Society for Industrial and Applied Mathematics, USA, 2021. 10.1137\/1.9781611976465.141","DOI":"10.1137\/1.9781611976465.141"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] M. Ajtai, J. Koml\u00f3s, and E. Szemer\u00e9di, \u201cAn 0(n log n) sorting network,\u201d Proc. Fifteenth Annual ACM Symposium on Theory of Computing, STOC'83, New York, NY, USA, pp.1-9, Association for Computing Machinery, 1983. 10.1145\/800061.808726","DOI":"10.1145\/800061.808726"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E106.A\/3\/E106.A_2022CIP0019\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,4]],"date-time":"2023-03-04T03:19:28Z","timestamp":1677899968000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E106.A\/3\/E106.A_2022CIP0019\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,1]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2022cip0019","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,1]]},"article-number":"2022CIP0019"}}