{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:07:48Z","timestamp":1743138468702,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030622220"},{"type":"electronic","value":"9783030622237"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-62223-7_37","type":"book-chapter","created":{"date-parts":[[2020,11,10]],"date-time":"2020-11-10T10:03:00Z","timestamp":1605002580000},"page":"426-436","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Privacy-Preserving Binary Tree Search"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1012-4595","authenticated-orcid":false,"given":"Ruidi","family":"Yang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7474-7268","authenticated-orcid":false,"given":"Maohua","family":"Sun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,11,11]]},"reference":[{"key":"37_CR1","unstructured":"Adelson-velskii, G.M., Landis, E.Nl.: Doklady akademia nauk sssr (1962)"},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1109\/T-C.1974.223959","volume":"23","author":"SK Chang","year":"1974","unstructured":"Chang, S.K.: Parallel balancing of binary search trees. IEEE Trans. Comput. 23, 441\u2013445 (1974)","journal-title":"IEEE Trans. Comput."},{"key":"37_CR3","unstructured":"Haq, E., Cheng, Y., Iyengar, S.S.: New algorithms for balancing binary search trees. In: IEEE Conference Proceedings, pp. 378\u2013382 (1988)"},{"issue":"4","key":"37_CR4","first-page":"290","volume":"1","author":"R Bayer","year":"1972","unstructured":"Bayer, R.: Symmetric binary B-trees: data structure and maintenance algorithms. Acfa Inf. 1(4), 290\u2013306 (1972)","journal-title":"Acfa Inf."},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Guibas, L.J., Sedgewick, R.: A dichromatic framework for balanced trees. In: Proceedings of the 19th Symposium on the Foundations of Computer Science (1978)","DOI":"10.1109\/SFCS.1978.3"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Borovskiy, V., M\u00fcller, J., Schapranow, M.P., Zeier, A.: Binary search tree visualization algorithm. IEEE (2009)","DOI":"10.1109\/ICIEEM.2009.5344285"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Ramachandran, R.: Kakkot Tree \u2014 A Binary Search Tree with caching. IEEE (2012)","DOI":"10.1109\/ICCIC.2012.6510247"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Chinnaiyan, R., Kumar, A.: Construction of estimated level based balanced binary search tree. In: ICECA (2017)","DOI":"10.1109\/ICECA.2017.8203701"},{"key":"37_CR9","unstructured":"Shekhar, A., Goyal, J.: Parallel binary search trees for rapid IP lookup using graphic processors. In: Proceedings of IMKE, pp. 176\u2013179 (2013)"},{"key":"37_CR10","unstructured":"Rabin, M.O.: How to exchange secrets by oblivious transfer, Aiken Computation Lab, University Harvard, USA, Technical Report TR-81 (1981)"},{"key":"37_CR11","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM 28, 637\u2013647 (1985)","journal-title":"Commun. ACM"},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Yao, A.: Protocols for secure computation. In: Proceedings 23rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Sadeghi, A., Schneider, T.T.: Improved garbled circuit building blocks and applications to auctions and computing minima. Crypt. Network Secur. (2009)","DOI":"10.1007\/978-3-642-10433-6_1"},{"key":"37_CR14","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to Solve any Protocol Problem. In: Proceedings of STOC (1987)"},{"key":"37_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"I Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643\u2013662. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38"}],"container-title":["Lecture Notes in Computer Science","Machine Learning for Cyber Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-62223-7_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,10]],"date-time":"2020-11-10T10:17:20Z","timestamp":1605003440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-62223-7_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030622220","9783030622237"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-62223-7_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"11 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ML4CS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning for Cyber Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ml4cs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ml4cs2020\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"360","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"118","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}