{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:23:13Z","timestamp":1743128593853,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031192135"},{"type":"electronic","value":"9783031192142"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-19214-2_40","type":"book-chapter","created":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T00:03:45Z","timestamp":1668643425000},"page":"475-488","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Privacy Preserving and Format-Checkable E-voting Scheme"],"prefix":"10.1007","author":[{"given":"Yuhong","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiyu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fengyin","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hua","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,17]]},"reference":[{"issue":"9","key":"40_CR1","first-page":"8","volume":"47","author":"HQ Pu","year":"2020","unstructured":"Pu, H.Q., Cui, Z., Liu, T.: A review of research on secure e-voting schemes. Comput. Sci. 47(9), 8 (2020)","journal-title":"Comput. Sci."},{"issue":"16","key":"40_CR2","first-page":"1","volume":"61","author":"MFM Mursi","year":"2013","unstructured":"Mursi, M.F.M., Assassa, G.M.R., Abdelhafez, A.: On the development of electronic voting: a survey. Int. J. Comput. Appl. 61(16), 1\u201311 (2013)","journal-title":"Int. J. Comput. Appl."},{"issue":"1","key":"40_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10207-010-0122-1","volume":"10","author":"K Peng","year":"2011","unstructured":"Peng, K.: A general and efficient countermeasure to relation attacks in mix-based e-voting. Int. J. Inf. Secur. 10(1), 49\u201360 (2011)","journal-title":"Int. J. Inf. Secur."},{"issue":"3","key":"40_CR4","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0140-3664(98)00241-2","volume":"22","author":"WC Ku","year":"1999","unstructured":"Ku, W.C., Wang, S.D.: A secure and practical electronic voting scheme. Comput. Commun. 22(3), 279\u2013286 (1999)","journal-title":"Comput. Commun."},{"key":"40_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/3-540-45682-1_32","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"RL Rivest","year":"2001","unstructured":"Rivest, R.L., Shamir, A., Tauman, Y.: How to leak a secret. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 552\u2013565. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_32"},{"issue":"2","key":"40_CR6","first-page":"146","volume":"28","author":"Q He","year":"2019","unstructured":"He, Q., Shen, W.: Homomorphic encryption-based multi-candidate e-voting scheme. Comput. Syst. Appl. 28(2), 146\u2013151 (2019)","journal-title":"Comput. Syst. Appl."},{"issue":"2","key":"40_CR7","doi-asserted-by":"publisher","first-page":"2032","DOI":"10.1109\/JSYST.2019.2940474","volume":"14","author":"M Kumar","year":"2020","unstructured":"Kumar, M., Chand, S., Katti, C.P.: A secure end-to-end verifiable internet-voting system using identity-based blind signature. IEEE Syst. J. 14(2), 2032\u20132041 (2020)","journal-title":"IEEE Syst. J."},{"issue":"4","key":"40_CR8","doi-asserted-by":"publisher","first-page":"1657","DOI":"10.1007\/s11280-018-0575-0","volume":"22","author":"Y Liu","year":"2019","unstructured":"Liu, Y., Zhao, Q.: E-voting scheme using secret sharing and K-anonmity. World Wide Web 22(4), 1657\u20131667 (2019)","journal-title":"World Wide Web"},{"key":"40_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-319-45741-3_12","volume-title":"Computer Security \u2013 ESORICS 2016","author":"SF Shahandashti","year":"2016","unstructured":"Shahandashti, S.F., Hao, F.: DRE-ip: a verifiable E-voting scheme without tallying authorities. In: Askoxylakis, I., Ioannidis, S., Katsikas, S., Meadows, C. (eds.) ESORICS 2016. LNCS, vol. 9879, pp. 223\u2013240. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45741-3_12"},{"key":"40_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-319-70972-7_20","volume-title":"Financial Cryptography and Data Security","author":"P McCorry","year":"2017","unstructured":"McCorry, P., Shahandashti, S.F., Hao, F.: A smart contract for boardroom voting with maximum voter privacy. In: Kiayias, A. (ed.) FC 2017. LNCS, vol. 10322, pp. 357\u2013375. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70972-7_20"},{"key":"40_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-030-32505-3_17","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2019","author":"M Chaieb","year":"2019","unstructured":"Chaieb, M., Koscina, M., Yousfi, S., Lafourcade, P., Robbana, R.: Dabsters: a privacy preserving e-voting protocol for permissioned blockchain. In: Hierons, R.M., Mosbah, M. (eds.) ICTAC 2019. LNCS, vol. 11884, pp. 292\u2013312. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32505-3_17"},{"issue":"2","key":"40_CR12","doi-asserted-by":"publisher","first-page":"314","DOI":"10.22581\/muet1982.2102.06","volume":"40","author":"A Waheed","year":"2021","unstructured":"Waheed, A., Din, N., Umar, A.I.: Novel blind signcryption scheme for e-voting system based on elliptic curves. Mehran Univ. Res. J. Eng. Technol. 40(2), 314\u2013322 (2021)","journal-title":"Mehran Univ. Res. J. Eng. Technol."},{"key":"40_CR13","first-page":"400","volume":"99","author":"K Alam","year":"2019","unstructured":"Alam, K., Tamura, S., Rahman, S.: An electronic voting scheme based on revised-SVRM and confirmation numbers. IEEE Trans. Dependable Secure Comput. 99, 400\u2013410 (2019)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"issue":"14","key":"40_CR14","first-page":"102908","volume":"61","author":"S Ajish","year":"2021","unstructured":"Ajish, S., Anilkumar, K.S.: Secure mobile internet voting system using biometric authentication and wavelet based AES. J. Inf. Secur. Appl. 61(14), 102908 (2021)","journal-title":"J. Inf. Secur. Appl."},{"key":"40_CR15","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology","author":"P Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) Advances in Cryptology, pp. 223\u2013238. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_16"},{"key":"40_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-24676-3_4","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 56\u201373. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_4"},{"key":"40_CR17","doi-asserted-by":"crossref","unstructured":"Samanthula, B.K.K., Chun, H., Jiang, W.: An efficient and probabilistic secure bit-decomposition. InL ACM SIGSAC Symposium on Information, pp. 541\u2013546. ACM (2013)","DOI":"10.1145\/2484313.2484386"},{"issue":"11","key":"40_CR18","doi-asserted-by":"publisher","first-page":"2401","DOI":"10.1109\/TIFS.2016.2573770","volume":"11","author":"X Liu","year":"2016","unstructured":"Liu, X., Deng, R.H., Choo, K.: An efficient privacy-preserving outsourced calculation toolkit with multiple keys. IEEE Trans. Inf. Forensics Secur. 11(11), 2401\u20132414 (2016)","journal-title":"IEEE Trans. Inf. Forensics Secur."}],"container-title":["Lecture Notes in Computer Science","Wireless Algorithms, Systems, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-19214-2_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T00:25:58Z","timestamp":1668644758000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19214-2_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031192135","9783031192142"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19214-2_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"17 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WASA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Wireless Algorithms, Systems, and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dalian","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wasa2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wasa-conference.org\/WASA2022\/","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":"265","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":"95","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":"62","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":"36% - 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":"4","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)"}}]}}