{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T10:20:28Z","timestamp":1756462828124,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030121457"},{"type":"electronic","value":"9783030121464"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-12146-4_16","type":"book-chapter","created":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T02:57:09Z","timestamp":1548298629000},"page":"248-266","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A New Privacy-Preserving Searching Model on Blockchain"],"prefix":"10.1007","author":[{"given":"Meiqi","family":"He","sequence":"first","affiliation":[]},{"given":"Gongxian","family":"Zeng","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Linru","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yuechen","family":"Chen","sequence":"additional","affiliation":[]},{"given":"SiuMing","family":"Yiu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,23]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Breitinger, F., Asteb\u00f8l, K.P., Baier, H., Busch, C.: mvHash-B-A new approach for similarity preserving hashing. In: 2013 Seventh International Conference on IT Security Incident Management and it Forensics (IMF), pp. 33\u201344. IEEE (2013)","DOI":"10.1109\/IMF.2013.18"},{"key":"16_CR2","series-title":"Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-642-39891-9_11","volume-title":"Digital Forensics and Cyber Crime","author":"F Breitinger","year":"2013","unstructured":"Breitinger, F., Baier, H.: Similarity preserving hashing: eligible properties and a new algorithm mrsh-v2. In: Rogers, M., Seigfried-Spellar, K.C. (eds.) ICDF2C 2012. LNICST, vol. 114, pp. 167\u2013182. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-39891-9_11"},{"key":"16_CR3","unstructured":"Breitinger, F., Baier, H., Beckingham, J.: Security and implementation analysis of the similarity digest sdhash. In: First International Baltic Conference on Network Security & Forensics (nesefo) (2012)"},{"key":"16_CR4","unstructured":"Buterin, V.: Ethereum: a next-generation smart contract and decentralized application platform (2014). \n                      https:\/\/github.com\/ethereum\/wiki\/wiki\/%5BEnglish%5D-White-Paper"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Cash, D., Grubbs, P., Perry, J., Ristenpart, T.: Leakage-abuse attacks against searchable encryption. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, pp. 668\u2013679. ACM (2015)","DOI":"10.1145\/2810103.2813700"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Cash, D., et al.: Dynamic searchable encryption in very-large databases: data structures and implementation. In: NDSS, vol. 14, pp. 23\u201326 (2014)","DOI":"10.14722\/ndss.2014.23264"},{"issue":"5","key":"16_CR7","doi-asserted-by":"publisher","first-page":"895","DOI":"10.3233\/JCS-2011-0426","volume":"19","author":"R Curtmola","year":"2011","unstructured":"Curtmola, R., Garay, J., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. J. Comput. Secur. 19(5), 895\u2013934 (2011)","journal-title":"J. Comput. Secur."},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-21741-3_1","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"C Decker","year":"2015","unstructured":"Decker, C., Wattenhofer, R.: A fast and scalable payment network with bitcoin duplex micropayment channels. In: Pelc, A., Schwarzmann, A.A. (eds.) SSS 2015. LNCS, vol. 9212, pp. 3\u201318. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-21741-3_1"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Delmolino, K., Arnett, M., Kosba, A.E., Miller, A., Shi, E.: Step by step towards creating a safe smart contract: lessons and insights from a cryptocurrency lab. IACR Cryptology ePrint Archive, p. 460 (2015)","DOI":"10.1007\/978-3-662-53357-4_6"},{"key":"16_CR10","unstructured":"Goh, E.J., et al.: Secure indexes. IACR Cryptology ePrint Archive, p. 216 (2003)"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Grubbs, P., McPherson, R., Naveed, M., Ristenpart, T., Shmatikov, V.: Breaking web applications built on top of encrypted data. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 1353\u20131364. ACM (2016)","DOI":"10.1145\/2976749.2978351"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-662-53357-4_4","volume-title":"Financial Cryptography and Data Security","author":"E Heilman","year":"2016","unstructured":"Heilman, E., Baldimtsi, F., Goldberg, S.: Blindly signed contracts: anonymous on-blockchain and off-blockchain bitcoin transactions. In: Clark, J., Meiklejohn, S., Ryan, P.Y.A., Wallach, D., Brenner, M., Rohloff, K. (eds.) FC 2016. LNCS, vol. 9604, pp. 43\u201360. Springer, Heidelberg (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-662-53357-4_4"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Kamara, S., Papamanthou, C., Roeder, T.: Dynamic searchable symmetric encryption. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security, pp. 965\u2013976. ACM (2012)","DOI":"10.1145\/2382196.2382298"},{"key":"16_CR14","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008)"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Oliver, J., Cheng, C., Chen, Y.: TLSH-a locality sensitive hash. In: 2013 Fourth Cybercrime and Trustworthy Computing Workshop (CTC), pp. 7\u201313. IEEE (2013)","DOI":"10.1109\/CTC.2013.9"},{"key":"16_CR16","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-662-45670-5_19","volume-title":"Applications and Techniques in Information Security","author":"J Oliver","year":"2014","unstructured":"Oliver, J., Forman, S., Cheng, C.: Using randomization to attack similarity digests. In: Batten, L., Li, G., Niu, W., Warren, M. (eds.) ATIS 2014. CCIS, vol. 490, pp. 199\u2013210. Springer, Heidelberg (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-662-45670-5_19"},{"key":"16_CR17","unstructured":"Poon, J., Dryja, T.: The bitcoin lightning network (2015)"},{"key":"16_CR18","unstructured":"Popa, R.A., Zeldovich, N.: Multi-key searchable encryption. IACR Cryptology ePrint Archive, p. 508 (2013)"},{"key":"16_CR19","unstructured":"Popa, R.A., et al.: Building web applications on top of encrypted data using Mylar. In: NSDI, pp. 157\u2013172 (2014)"},{"key":"16_CR20","unstructured":"Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: 2000 IEEE Symposium on Security and Privacy, S&P 2000, Proceedings, pp. 44\u201355. IEEE (2000)"},{"issue":"3","key":"16_CR21","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1515\/popets-2017-0034","volume":"2017","author":"C Rompay Van","year":"2017","unstructured":"Van Rompay, C., Molva, R., \u00d6nen, M.: A leakage-abuse attack against multi-user searchable encryption. Proc. Priv. Enhancing Technol. 2017(3), 168\u2013178 (2017)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Van Rompay, C., Molva, R., \u00d6nen, M.: Secure and scalable multi-user searchable encryption (2018)","DOI":"10.1145\/3201595.3201597"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2013 ICISC 2018"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-12146-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T06:39:58Z","timestamp":1558334398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-12146-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030121457","9783030121464"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-12146-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security and Cryptology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seoul","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icisc2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icisc.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"49","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"43% - 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"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3 papers of invited talks were accepted.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}