{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:40:39Z","timestamp":1742992839855,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030179816"},{"type":"electronic","value":"9783030179823"}],"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-17982-3_19","type":"book-chapter","created":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T00:38:34Z","timestamp":1554943114000},"page":"241-252","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Construction of a Keyword Search to Allow Partial Matching with a Block Cipher"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6482-6122","authenticated-orcid":false,"given":"Yuta","family":"Kodera","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4844-2652","authenticated-orcid":false,"given":"Minoru","family":"Kuribayashi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4240-0454","authenticated-orcid":false,"given":"Takuya","family":"Kusaka","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6247-0719","authenticated-orcid":false,"given":"Yasuyuki","family":"Nogami","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,12]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","unstructured":"Song, D., Wager, D., Perrig, A.: Practical techniques for searches on encrypted data. In: Proceeding 2000 IEEE Symposium on Security and Privacy, S & P 2000 (2000). \n                      https:\/\/doi.org\/10.1109\/SECPRI.2000.848445","DOI":"10.1109\/SECPRI.2000.848445"},{"issue":"5","key":"19_CR2","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":"19_CR3","doi-asserted-by":"publisher","first-page":"2908","DOI":"10.1109\/ACCESS.2017.2786026","volume":"6","author":"G Wang","year":"2018","unstructured":"Wang, G., Liu, C., Dong, Y., Han, P., Pan, H., Fang, B.: IDCrypt: a multi-user searchable symmetric encryption scheme for cloud applications. IEEE Access 6, 2908\u20132921 (2018). \n                      https:\/\/doi.org\/10.1109\/ACCESS.2017.2786026","journal-title":"IEEE Access"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-319-31301-6_15","volume-title":"Selected Areas in Cryptography \u2013 SAC 2015","author":"AA Yavuz","year":"2016","unstructured":"Yavuz, A.A., Guajardo, J.: Dynamic searchable symmetric encryption with minimal leakage and efficient updates on commodity hardware. In: Dunkelman, O., Keliher, L. (eds.) SAC 2015. LNCS, vol. 9566, pp. 241\u2013259. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-31301-6_15"},{"issue":"3","key":"19_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3064005","volume":"50","author":"GS Poh","year":"2017","unstructured":"Poh, G.S., Chin, J., Yau, W., Choo, K.R., Mohamad, M.S.: Searchable symmetric encryption: designs and challenges. ACM Comput. Surv. 50(3), 1\u201337 (2017). Article 40","journal-title":"ACM Comput. Surv."},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-540-24676-3_30","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506\u2013522. Springer, Heidelberg (2004). \n                      https:\/\/doi.org\/10.1007\/978-3-540-24676-3_30"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1007\/978-3-540-69839-5_96","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2008","author":"J Baek","year":"2008","unstructured":"Baek, J., Safavi-Naini, R., Susilo, W.: Public key encryption with keyword search revisited. In: Gervasi, O., Murgante, B., Lagan\u00e0, A., Taniar, D., Mun, Y., Gavrilova, M.L. (eds.) ICCSA 2008. LNCS, vol. 5072, pp. 1249\u20131259. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-69839-5_96"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/3-540-68697-5_27","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201996","author":"JL Massey","year":"1996","unstructured":"Massey, J.L., Serconek, S.: Linear complexity of periodic sequences: a general theory. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 358\u2013371. Springer, Heidelberg (1996). \n                      https:\/\/doi.org\/10.1007\/3-540-68697-5_27"},{"issue":"12","key":"19_CR9","doi-asserted-by":"publisher","first-page":"2226","DOI":"10.1587\/transfun.E99.A.2226","volume":"E99\u2013A","author":"Y Nogami","year":"2016","unstructured":"Nogami, Y., Uehara, S., Tsuchiya, K., Begum, N., Ino, H., Morelos-Zaragoza, R.H.: A multi-value sequence generated by power residue symbol and trace function over odd characteristic field. IEICE Trans. E99\u2013A(12), 2226\u20132237 (2016)","journal-title":"IEICE Trans."},{"key":"19_CR10","doi-asserted-by":"publisher","unstructured":"Tsuchiya, K., Ogawa, C., Nogami, Y., Uehara, S.: Linear compleixty of generalized NTU sequences. In: IWSDA 2017 (2017). \n                      https:\/\/doi.org\/10.1109\/IWSDA.2017.8095739","DOI":"10.1109\/IWSDA.2017.8095739"},{"key":"19_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04722-4","volume-title":"The Design of Rijndael","author":"J Daemen","year":"2002","unstructured":"Daemen, J., Rijmen, V.: The Design of Rijndael. Springer, Heidelberg (2002). \n                      https:\/\/doi.org\/10.1007\/978-3-662-04722-4"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M Blum","year":"1984","unstructured":"Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudorandom Bits. SIAM J. Comput. 13, 850\u2013864 (1984)","journal-title":"SIAM J. Comput."},{"key":"19_CR13","unstructured":"Divyanjali, Ankur, Pareek, V.: An overview of cryptographically secure pseudorandom number generators and BBS. IJCA, 19\u201328 (2014). In: ICACEA"},{"key":"19_CR14","first-page":"37","volume":"7","author":"J Poonam","year":"2015","unstructured":"Poonam, J., Brahmjit, S.: A survey on RC4 stream cipher. IJCNIS 7, 37\u201345 (2015)","journal-title":"IJCNIS"},{"key":"19_CR15","unstructured":"AlFardan, N., Bernstein, D.J., Paterson, K.G., Poettering, B., Schuldt, J.C.N.: On the security of RC4 in TLS. In: USENIX Security 13, pp. 305\u2013320 (2013). ISBN: 978-1-931971-03-4"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L Blum","year":"1986","unstructured":"Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudorandom number generator. SIAM J. Comput. 15, 364\u2013383 (1986)","journal-title":"SIAM J. Comput."},{"key":"19_CR17","unstructured":"Rukhin, A.: A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications NIST, SP 800\u201322, Revision 1a (2010)"},{"issue":"1","key":"19_CR18","doi-asserted-by":"crossref","first-page":"5","DOI":"10.18178\/IJIEE.2018.8.1.685","volume":"8","author":"Y Kodera","year":"2018","unstructured":"Kodera, Y., Miyazaki, T., Kusaka, T., Arshad, A.M., Nogami, Y., Uehara, S.: Uniform binary sequence generated over odd characteristic field. IJIEE 8(1), 5\u20139 (2018)","journal-title":"IJIEE"}],"container-title":["Lecture Notes in Computer Science","Information Security Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17982-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:19:24Z","timestamp":1558347564000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-17982-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030179816","9783030179823"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17982-3_19","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":"12 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Information Security Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jeju Island","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":"23 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wisa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wisa.or.kr\/","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":"wisa18.hotcrp.com","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"44","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"11","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"11","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"25% - 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":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}