{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T17:10:01Z","timestamp":1749575401209,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440376"},{"type":"electronic","value":"9783540456810"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[[2002]]},"DOI":"10.1007\/3-540-45681-3_12","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T11:03:25Z","timestamp":1192791805000},"page":"138-149","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Privacy-Oriented Data Mining by Proof Checking"],"prefix":"10.1007","author":[{"given":"Amy","family":"Felty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stan","family":"Matwin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,18]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"D. Agrawal and C. C. Aggarwal. On the design and quantification of privacy preserving data mining algorithms. In Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 247\u2013255. ACM, May 2001.","DOI":"10.1145\/375551.375602"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"R. Agrawal and R. Srikant. Privacy-preserving data mining. In W. Chen, J. F. Naughton, and P. A. Bernstein, editors, 2000 ACM SIGMOD International Conference on Management of Data, pages 439\u2013450. ACM, May 2000.","DOI":"10.1145\/342009.335438"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"G. Barthe, G. Dufay, L. Jakubiec, B. Serpette, and S. Sousa. A formal executable semantics of the JavaCard platform. In European Symposium on Programming, pages 302\u2013319. Springer-Verlag, 2001.","DOI":"10.1007\/3-540-45309-1_20"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Y. Bertot. Formalizing a JVML verifier for initialization in a theorem prover. In Computer-Aided Verification, pages 14\u201324. Springer-Verlag, 2001.","DOI":"10.1007\/3-540-44585-4_3"},{"key":"12_CR5","unstructured":"Electronic Privacy Information Center and Junkbusters. Pretty poor privacy: An assessment of P3P and internet privacy. http:\/\/www.epic.org\/reports\/prettypoorprivacy.html, June 2000."},{"key":"12_CR6","unstructured":"K. Coyle. P3P:pretty poor privacy?: A social analysis of the platform for privacy preferences (P3P). http:\/\/www.kcoyle.net\/p3p.html, June 1999."},{"key":"12_CR7","unstructured":"Information and Privacy Commissioner\/Ontario. Data mining: Staking a claim on your privacy. http:\/\/www.ipc.on.ca\/english\/pubpres\/papers\/datamine.htm#Examples, January 1998."},{"key":"12_CR8","unstructured":"D. G. Ries. Protecting consumer online privacy \u2014 an overview. http:\/\/www.pbi.org\/Goodies\/privacy\/privacy ries.htm, May 2001."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"R. L. Rivest. RFC 1321: The MD5 message-digest algorithm. Internet Activities Board, 1992.","DOI":"10.17487\/rfc1321"},{"key":"12_CR10","unstructured":"The Coq Development Team. The Coq Proof Assistant reference manual: Version 7.2. Technical report, INRIA, 2002."},{"key":"12_CR11","unstructured":"W3C. Platform for privacy preferences. http:\/\/www.w3.org\/P3P\/introduction.html, 1999."}],"container-title":["Lecture Notes in Computer Science","Principles of Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45681-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T16:35:13Z","timestamp":1749573313000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45681-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440376","9783540456810"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45681-3_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"18 September 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}