{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:38Z","timestamp":1740099638555,"version":"3.37.3"},"publisher-location":"Singapore","reference-count":15,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811527661"},{"type":"electronic","value":"9789811527678"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-981-15-2767-8_38","type":"book-chapter","created":{"date-parts":[[2020,1,25]],"date-time":"2020-01-25T15:02:35Z","timestamp":1579964555000},"page":"430-439","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Pufferfish Privacy Mechanism Based on Multi-dimensional Markov Chain Model for Correlated Categorical Data Sequences"],"prefix":"10.1007","author":[{"given":"Zhicheng","family":"Xi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2085-4359","authenticated-orcid":false,"given":"Yingpeng","family":"Sang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanrui","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongchun","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,26]]},"reference":[{"issue":"2","key":"38_CR1","first-page":"235","volume":"3","author":"W Ching","year":"2007","unstructured":"Ching, W., Zhang, S., Ng, M.: On multi-dimensional Markov chain models. Pac. J. Optim. 3(2), 235\u2013243 (2007)","journal-title":"Pac. J. Optim."},{"key":"38_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/11761679_29","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"C Dwork","year":"2006","unstructured":"Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., Naor, M.: Our data, ourselves: privacy via distributed noise generation. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 486\u2013503. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11761679_29"},{"key":"38_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11681878_14","volume-title":"Theory of Cryptography","author":"C Dwork","year":"2006","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 265\u2013284. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11681878_14"},{"key":"38_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-79228-4_1","volume-title":"Theory and Applications of Models of Computation","author":"C Dwork","year":"2008","unstructured":"Dwork, C.: Differential privacy: a survey of results. In: Agrawal, M., Du, D., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 1\u201319. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-79228-4_1"},{"issue":"3-4","key":"38_CR5","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1561\/0400000042","volume":"9","author":"Cynthia Dwork","year":"2013","unstructured":"Dwork, C., Roth, A.: The algorithmic foundations of differential privacy. Found. Trends\u00ae Theor. Comput. Sci. 9(3\u20134), 211\u2013407 (2014)","journal-title":"Foundations and Trends\u00ae in Theoretical Computer Science"},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"Humbert, M., Trubert, B., Huguenin, K.: A Survey on Interdependent Privacy (2019)","DOI":"10.1145\/3360498"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"Kifer, D., Machanavajjhala, A.: No free lunch in data privacy. In: Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data, pp. 193\u2013204. ACM (2011)","DOI":"10.1145\/1989323.1989345"},{"issue":"1","key":"38_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/2514689","volume":"39","author":"D Kifer","year":"2014","unstructured":"Kifer, D., Machanavajjhala, A.: Pufferfish: a framework for mathematical privacy definitions. ACM Trans. Database Syst. (TODS) 39(1), 3 (2014)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"Liu, C., Chakraborty, S., Mittal, P.: Dependence makes you vulnberable: differential privacy under dependent tuples. In: NDSS, vol. 16, pp. 21\u201324 (2016)","DOI":"10.14722\/ndss.2016.23279"},{"key":"38_CR10","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.cose.2018.12.017","volume":"82","author":"D Lv","year":"2019","unstructured":"Lv, D., Zhu, S.: Achieving correlated differential privacy of big data publication. Comput. Secur. 82, 184\u2013195 (2019)","journal-title":"Comput. Secur."},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"Song, S., Wang, Y., Chaudhuri, K.: Pufferfish privacy mechanisms for correlated data. In: Proceedings of the 2017 ACM International Conference on Management of Data, pp. 1291\u20131306. ACM (2017)","DOI":"10.1145\/3035918.3064025"},{"key":"38_CR12","series-title":"Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-030-01701-9_8","volume-title":"Security and Privacy in Communication Networks","author":"F Wei","year":"2018","unstructured":"Wei, F., Zhang, W., Chen, Y., Zhao, J.: Differentially private high-dimensional data publication via Markov network. In: Beyah, R., Chang, B., Li, Y., Zhu, S. (eds.) SecureComm 2018. LNICST, vol. 254, pp. 133\u2013148. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-030-01701-9_8"},{"key":"38_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.knosys.2017.02.004","volume":"122","author":"H Wang","year":"2017","unstructured":"Wang, H., Xu, Z.: CTS-DP: publishing correlated time-series data via differential privacy. Knowl.-Based Syst. 122, 167\u2013179 (2017)","journal-title":"Knowl.-Based Syst."},{"key":"38_CR14","doi-asserted-by":"crossref","unstructured":"Yang, B., Sato, I., Nakagawa, H.: Bayesian differential privacy on correlated data. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 747\u2013762. ACM (2015)","DOI":"10.1145\/2723372.2747643"},{"issue":"2","key":"38_CR15","first-page":"229","volume":"10","author":"T Zhu","year":"2014","unstructured":"Zhu, T., Xiong, P., Li, G., et al.: Correlated differential privacy: hiding information in non-IID data set. IEEE Trans. Inf. Forensics Secur. 10(2), 229\u2013242 (2014)","journal-title":"IEEE Trans. Inf. Forensics Secur."}],"container-title":["Communications in Computer and Information Science","Parallel Architectures, Algorithms and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-2767-8_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,25]],"date-time":"2020-01-25T15:08:04Z","timestamp":1579964884000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-2767-8_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811527661","9789811527678"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-2767-8_38","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"26 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Parallel Architectures, Algorithms and Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","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":"12 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"paap2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sdcs.sysu.edu.cn\/paap2019","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"121","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":"39","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":"6","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}