{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:11:59Z","timestamp":1743073919572,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031398278"},{"type":"electronic","value":"9783031398285"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-39828-5_10","type":"book-chapter","created":{"date-parts":[[2023,8,12]],"date-time":"2023-08-12T16:01:57Z","timestamp":1691856117000},"page":"177-191","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["New LDP Approach Using VAE"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4896-2909","authenticated-orcid":false,"given":"Andres","family":"Hernandez-Matamoros","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0903-8430","authenticated-orcid":false,"given":"Hiroaki","family":"Kikuchi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,7]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2022.102934","volume":"123","author":"M Alishahi","year":"2022","unstructured":"Alishahi, M., Moghtadaiee, V., Navidan, H.: Add noise to remove noise: local differential privacy for feature selection. Comput. Secur. 123, 102934 (2022). https:\/\/doi.org\/10.1016\/j.cose.2022.102934. ISSN: 0167-4048","journal-title":"Comput. Secur."},{"issue":"3\u20134","key":"10_CR2","first-page":"211","volume":"9","author":"C Dwork","year":"2014","unstructured":"Dwork, C., Roth, A.: The algorithmic foundations of differential privacy. Found. Trends Theoret. Comput. Sci. 9(3\u20134), 211\u2013407 (2014)","journal-title":"Found. Trends Theoret. Comput. Sci."},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"2151","DOI":"10.1109\/TIFS.2018.2812146","volume":"13","author":"X Ren","year":"2018","unstructured":"Ren, X., et al.: $$ LoPub$$: high-dimensional crowdsourced data publication with local differential privacy. IEEE Trans. Inf. Forensics Secur. 13, 2151\u20132166 (2018). https:\/\/doi.org\/10.1109\/TIFS.2018.2812146","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"10_CR4","unstructured":"Adult: UCI Machine Learning Repository (1996)"},{"key":"10_CR5","unstructured":"Moro, S., Rita, P., Cortez, P.: Bank Marketing. In: UCI Machine Learning Repository (2012)"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Zou, H., Hastie, T., Tibshirani, R.: On the \u201cdegrees of freedom\u201d of the lasso, Institute of Mathematical Statistics, 35, The Annals of Statistics","DOI":"10.1214\/009053607000000127"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. J. Roy. Statist. Soc.: Ser. 39, 1\u201322 (1977)","DOI":"10.1111\/j.2517-6161.1977.tb01600.x"},{"issue":"4","key":"10_CR8","doi-asserted-by":"publisher","first-page":"1307","DOI":"10.1137\/0907087","volume":"7","author":"F Santosa","year":"1986","unstructured":"Santosa, F., Symes, W.W.: Linear inversion of band-limited reflection seismograms. SIAM J. Sci. Statist. Comput. 7(4), 1307\u20131330 (1986). https:\/\/doi.org\/10.1137\/0907087","journal-title":"SIAM J. Sci. Statist. Comput."},{"issue":"7","key":"10_CR9","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1080\/01621459.1965.10480775","volume":"60","author":"SL Warner","year":"1965","unstructured":"Warner, S.L.: Randomized response: a survey technique for eliminating evasive answer bias. J. Am. Statist. Assoc. 60, 63\u201369 (1965)","journal-title":"J. Am. Statist. Assoc."},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1186\/s40537-021-00444-8","volume":"8","author":"L Alzubaidi","year":"2021","unstructured":"Alzubaidi, L., Zhang, J., Humaidi, A.J., et al.: Review of deep learning: concepts, CNN architectures, challenges, applications, future directions. J Big Data 8, 53 (2021). https:\/\/doi.org\/10.1186\/s40537-021-00444-8","journal-title":"J Big Data"},{"key":"10_CR12","unstructured":"Kikuchi, H.: PWS Cup: Data Anonymization Competition \u2018Diabetes\u2019 (2021). https:\/\/github.com\/kikn88\/pwscup2021. Accessed 10 May 2023"},{"key":"10_CR13","unstructured":"PWS: PWS (2021). https:\/\/www.iwsec.org\/pws\/2021\/cup21.html. Accessed 10 May 2023"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"McSherry, F.D.: Privacy integrated queries: an extensible platform for privacy-preserving data analysis. In: Proceedings of the ACM SIGMOD, pp. 19\u201330 (2009)","DOI":"10.1145\/1559845.1559850"},{"key":"10_CR15","unstructured":"Rajkovic, V.: Nursery, UCI Machine Learning Repository (1997)"},{"key":"10_CR16","unstructured":"Bengio, Y., Yao, L., Alain, G., Vincent, P.: Generalized denoising auto-encoders as generative models. In: Advances in Neural Information Processing Systems (2013)"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Rumelhart, D.E., Hinton, G.E., Williams, R.J. : Learning internal representations by error propagation. In: Parallel Distributed Processing: Explorations in the Microstructure of Cognition: Foundations, pp. 318\u2013362. MIT Press (1987)","DOI":"10.7551\/mitpress\/4943.003.0128"},{"key":"10_CR18","unstructured":"Diederik, P.: Kingma. Auto-Encoding Variational Bayes, ICLR, Max Welling (2014)"}],"container-title":["Lecture Notes in Computer Science","Network and System Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-39828-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,26]],"date-time":"2024-10-26T03:02:30Z","timestamp":1729911750000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-39828-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031398278","9783031398285"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-39828-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"7 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Network and System Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canterbury","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"14 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2023","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":"nss2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/nss-socialsec2023.cyber.kent.ac.uk\/index.php","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":"53","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":"12","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":"9","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":"23% - 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.1","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":"2.2","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)"}}]}}