{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T14:47:08Z","timestamp":1769006828983,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":8,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819709441","type":"print"},{"value":"9789819709458","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-0945-8_23","type":"book-chapter","created":{"date-parts":[[2024,2,24]],"date-time":"2024-02-24T20:02:14Z","timestamp":1708804934000},"page":"389-393","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient Privacy-Preserving Scheme for\u00a0Weak Password Collection in\u00a0Internet of\u00a0Things"],"prefix":"10.1007","author":[{"given":"Changsong","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunxiang","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kefei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,25]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Miao, P., Mohassel, P., Mukherjee, P.: PASTA: Password-based threshold authentication. In: Proceedings of ACM CCS, pp. 2042\u20132059 (2018)","DOI":"10.1145\/3243734.3243839"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Davidson, A., Snyder, P., Quirk, E., Genereux, J., Livshits, B., Haddadi, H.: STAR: secret sharing for private threshold aggregation reporting. In: Proceedings of ACM CCS, pp. 697\u2013710 (2022)","DOI":"10.1145\/3548606.3560631"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/j.ins.2021.05.077","volume":"576","author":"C Jiang","year":"2021","unstructured":"Jiang, C., Xu, C., Zhang, Y.: PFLM: privacy-preserving federated learning with membership proof. Inf. Sci. 576, 288\u2013311 (2021)","journal-title":"Inf. Sci."},{"issue":"3","key":"23_CR4","doi-asserted-by":"publisher","first-page":"3168","DOI":"10.1109\/TCC.2023.3266459","volume":"11","author":"C Jiang","year":"2023","unstructured":"Jiang, C., Xu, C., Zhang, Z., Chen, K.: SR-PEKS: subversion-resistant public key encryption with keyword search. IEEE Trans. on Cloud Comput. 11(3), 3168\u20133183 (2023)","journal-title":"IEEE Trans. on Cloud Comput."},{"key":"23_CR5","unstructured":"Lee, K., Sj\u00f6berg, S., Narayanan, A.: Password policies of most top websites fail to follow best practices. In: Proceedings of SOUPS, pp. 561\u2013580 (2022)"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"3525","DOI":"10.1109\/TIFS.2022.3209886","volume":"17","author":"S Li","year":"2022","unstructured":"Li, S., Xu, C., Zhang, Y., Zhou, J.: A secure two-factor authentication scheme from password-protected hardware tokens. IEEE Trans. Inf. Forensics Secur. 17, 3525\u20133538 (2022)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B., Ronen, E.: How to (not) share a password: privacy preserving protocols for finding heavy hitters with adversarial behavior. In: Proceedings of ACM CCS, pp. 1369\u20131386 (2019)","DOI":"10.1145\/3319535.3363204"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Tan, J., Bauer, L., Christin, N., Cranor, L.F.: Practical recommendations for stronger, more usable passwords combining minimum-strength, minimum-length, and blocklist requirements. In: Proceedings of ACM CCS. pp, 1407\u20131426 (2020)","DOI":"10.1145\/3372297.3417882"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-0945-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T17:30:27Z","timestamp":1741368627000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0945-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819709441","9789819709458"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0945-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"25 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Inscrypt","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":"Hangzhou","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2023","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":"cisc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/inscrypt2023.github.io\/#","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":"152","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":"38","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":"7","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":"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 (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":"4","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)"}}]}}