{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T13:39:54Z","timestamp":1726061994787},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030346362"},{"type":"electronic","value":"9783030346379"}],"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-34637-9_21","type":"book-chapter","created":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T00:04:15Z","timestamp":1575590655000},"page":"278-292","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Key-Tree for RFID Authentication Protocols with Storage Constraints"],"prefix":"10.1007","author":[{"given":"Wang","family":"Shao-Hui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhang","family":"Yan-Xuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Chang-Bo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wang","family":"Ru-Chuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,12,6]]},"reference":[{"issue":"3","key":"21_CR1","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/MSP.2005.78","volume":"3","author":"S Garfinkel","year":"2005","unstructured":"Garfinkel, S., Juels, A., Pappu, R.: RFID privacy: an overview of problems and proposed solutions. IEEE Secur. Priv. Mag. 3(3), 34\u201343 (2005)","journal-title":"IEEE Secur. Priv. Mag."},{"key":"21_CR2","unstructured":"Preneel, B.: Using cryptography well. Printed Handout (2010). \nhttp:\/\/secappdev.org\/handouts\/2010\/Bart"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/11424758_65","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2005","author":"SM Lee","year":"2005","unstructured":"Lee, S.M., Hwang, Y.J., Lee, D.H., Lim, J.I.: Efficient authentication for low-cost RFID systems. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Lagan\u00e0, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol. 3480, pp. 619\u2013627. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11424758_65"},{"key":"21_CR4","unstructured":"Liu, Z., Peng, D.: True random number generator in RFID systems against traceability. In: IEEE Consumer Communications and Networking Conference - CCNS2006, Las Vegas, USA, pp. 620\u2013624 (2005)"},{"key":"21_CR5","unstructured":"Ohkubo, M., Suzuki, K., Kinoshita, S.: Cryptographic approach to \u201cPrivacy-Friendly\u201d tags. In: RFID Privacy Workshop, USA (2003). \nhttp:\/\/www.rfidprivacy.us\/2003\/agenda.php"},{"key":"21_CR6","unstructured":"Avoine, G., Oechslin, P.: A scalable and provably secure Hash based RFID protocol. In: Third IEEE International Workshop on Pervasive Computing and Communication Security, PerCom, pp. 110\u2013114 (2005)"},{"key":"21_CR7","unstructured":"Tsudik, G.: YA-TRAP: yet another trivial RFID authentication protocol. In: International Conference on Pervasive Computing and Communications \u2013 PerCom, pp. 640\u2013643 (2006)"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.cose.2015.05.004","volume":"55","author":"P Gope","year":"2015","unstructured":"Gope, P., Hwang, T.: A realistic lightweight authentication protocol preserving strong anonymity for securing RFID system. Comput. Secur. 55, 271\u2013280 (2015)","journal-title":"Comput. Secur."},{"key":"21_CR9","first-page":"1","volume":"24","author":"H Luo","year":"2016","unstructured":"Luo, H., Wen, G., Su, J., Huang, Z.: SLAP: Succinct and light weight authentication protocol for low-cost RFID system. Wireless Netw. 24, 1\u201310 (2016)","journal-title":"Wireless Netw."},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.ins.2016.07.038","volume":"379","author":"F Rahman","year":"2017","unstructured":"Rahman, F., Hoque, M.E., Ahamed, S.I.: Anonpri: a secure anonymous private authentication protocol for RFID systems. Inf. Sci. 379, 195\u2013210 (2017)","journal-title":"Inf. Sci."},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/3-540-45682-1_4","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2001","author":"NJ Hopper","year":"2001","unstructured":"Hopper, N.J., Blum, M.: Secure human identification protocols. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 52\u201366. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-45682-1_4"},{"issue":"3","key":"21_CR12","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/s00145-010-9061-2","volume":"23","author":"J Katz","year":"2010","unstructured":"Katz, J., Shin, J.S., Smith, A.: Parallel and concurrent security of the HB and HB\u2009+\u2009protocols. J. Cryptol. 23(3), 402\u2013421 (2010)","journal-title":"J. Cryptol."},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-540-85230-8_12","volume-title":"Financial Cryptography and Data Security","author":"H Gilbert","year":"2008","unstructured":"Gilbert, H., Robshaw, M.J.B., Seurin, Y.: Good Variants of HB\u2009+\u2009Are Hard to Find. In: Tsudik, G. (ed.) FC 2008. LNCS, vol. 5143, pp. 156\u2013170. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-85230-8_12"},{"key":"21_CR14","first-page":"225","volume-title":"Theory of Cryptography","author":"David Cash","year":"2015","unstructured":"Cash, D., Kiltz, E., Tessaro, S.: Two-round man-in-the-middle security from LPN. In: Theory of Cryptography, TCC 2016-A, pp. 225\u2013248 (2016)"},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-642-40084-1_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"Vadim Lyubashevsky","year":"2013","unstructured":"Lyubashevsky, V., Masny, D.: Man-in-the-middle secure authentication schemes from LPN and weak PRFs. In: Advances in Cryptology\u2014CRYPTO, pp. 308\u2013325 (2013)"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Molnar, D., Wagner, D.: Privacy and security in library RFID: issues, practices, and architectures. In: Proceedings 11th ACM Conference Computer and Communication Security (CCS 2004), pp. 210\u2013219 (2004)","DOI":"10.1145\/1030083.1030112"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/11957454_19","volume-title":"Privacy Enhancing Technologies","author":"L Butty\u00e1n","year":"2006","unstructured":"Butty\u00e1n, L., Holczer, T., Vajda, I.: Optimal key-trees for tree-based private authentication. In: Danezis, G., Golle, P. (eds.) PET 2006. LNCS, vol. 4258, pp. 332\u2013350. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11957454_19"},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-642-36140-1_3","volume-title":"Radio Frequency Identification. Security and Privacy Issues","author":"Thijs Veugen","year":"2013","unstructured":"Veugen, T., Beye, M.: Improved anonymity for key-trees. In: Radio Frequency Identification: Security and Privacy Issues - 8th International Workshop, RFID Sec 2012, LNCS 7739, pp. 31\u201347 (2013)"},{"issue":"1","key":"21_CR19","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D Chaum","year":"1988","unstructured":"Chaum, D.: The dining cryptographers problem: unconditional sender and recipient untraceability. J. Cryptol. 1(1), 65\u201375 (1988)","journal-title":"J. Cryptol."},{"key":"21_CR20","first-page":"47","volume":"3","author":"KJ Ma","year":"1983","unstructured":"Ma, K.J.: The minimum sum constant product problem with constaints on positive integers. J. Qufu Normal Univ. (Nat. Sci.) 3, 47\u201349 (1983)","journal-title":"J. Qufu Normal Univ. (Nat. Sci.)"},{"key":"21_CR21","series-title":"Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-642-31909-9_23","volume-title":"Security and Privacy in Communication Networks","author":"M Beye","year":"2012","unstructured":"Beye, M., Veugen, T.: Anonymity for key-trees with adaptive adversaries. In: Rajarajan, M., Piper, F., Wang, H., Kesidis, G. (eds.) SecureComm 2011. LNICST, vol. 96, pp. 409\u2013425. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-31909-9_23"}],"container-title":["Lecture Notes in Computer Science","Science of Cyber Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34637-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T00:06:35Z","timestamp":1575590795000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34637-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030346362","9783030346379"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34637-9_21","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":"6 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SciSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Science of Cyber Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanjing","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"scisec2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sci-cs.net\/","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 (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":"62","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":"20","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":"8","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":"32% - 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":"3","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":"3","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)"}}]}}