{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T05:21:58Z","timestamp":1772083318541,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642365935","type":"print"},{"value":"9783642365942","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36594-2_24","type":"book-chapter","created":{"date-parts":[[2013,2,6]],"date-time":"2013-02-06T21:43:27Z","timestamp":1360187007000},"page":"418-436","source":"Crossref","is-referenced-by-count":14,"title":["Testing the Lipschitz Property over Product Distributions with Applications to Data Privacy"],"prefix":"10.1007","author":[{"given":"Kashyap","family":"Dixit","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Madhav","family":"Jha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sofya","family":"Raskhodnikova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhradeep","family":"Thakurta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/978-3-642-32512-0_32","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Pranjal Awasthi","year":"2012","unstructured":"Awasthi, P., Jha, M., Molinaro, M., Raskhodnikova, S.: Limitations of local filters of lipschitz and monotone functions. In: Gupta, et al.: [18], pp. 374\u2013386"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Awasthi, P., Jha, M., Molinaro, M., Raskhodnikova, S.: Testing lipschitz functions on hypergrid domains. In: Gupta, et al.: [18], pp. 387\u2013398","DOI":"10.1007\/978-3-642-32512-0_33"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Bhaskar, R., Bhowmick, A., Goyal, V., Laxman, S., Thakurta, A.: Noiseless database privacy. Cryptology ePrint Archive, Report 2011\/487 (version: 20120524:110619) (2011), http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-642-25385-0_12"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-642-25385-0_12","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"R. Bhaskar","year":"2011","unstructured":"Bhaskar, R., Bhowmick, A., Goyal, V., Laxman, S., Thakurta, A.: Noiseless Database Privacy. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 215\u2013232. Springer, Heidelberg (2011)"},{"key":"24_CR5","unstructured":"Bhowmick, A., Dwork, C.: Natural differential privacy. Personal Communication (2012)"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Calandrino, J.A., Kilzer, A., Narayanan, A., Felten, E.W., Shmatikov, V.: \u201cyou might also like: \u201d privacy risks of collaborative filtering. In: IEEE Symposium on Security and Privacy, pp. 231\u2013246 (2011)","DOI":"10.1109\/SP.2011.40"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Chakrabarty, D., Seshadhri, C.: Optimal bounds for monotonicity and lipschitz testing over the hypercube. CoRR abs\/1204.0849 (2012)","DOI":"10.1145\/2488608.2488661"},{"key":"24_CR8","unstructured":"Dixit, K., Jha, M., Raskhodnikova, S., Thakurta, A.: Testing the lipschitz property over product distributions with applications to data privacy (2013), http:\/\/arxiv.org\/abs\/1209.4056"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/978-3-540-48413-4_10","volume-title":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques","author":"Y. Dodis","year":"1999","unstructured":"Dodis, Y., Goldreich, O., Lehman, E., Raskhodnikova, S., Ron, D., Samorodnitsky, A.: Improved Testing Algorithms for Monotonicity. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM-APPROX 1999. LNCS, vol.\u00a01671, pp. 97\u2013108. Springer, Heidelberg (1999)"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11787006_1","volume-title":"Automata, Languages and Programming","author":"C. Dwork","year":"2006","unstructured":"Dwork, C.: Differential Privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 1\u201312. Springer, Heidelberg (2006)"},{"key":"24_CR11","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.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol.\u00a04978, pp. 1\u201319. Springer, Heidelberg (2008)"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/978-3-642-00457-5_29","volume-title":"Theory of Cryptography","author":"C. Dwork","year":"2009","unstructured":"Dwork, C.: The Differential Privacy Frontier (Extended Abstract). In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 496\u2013502. Springer, Heidelberg (2009)"},{"key":"24_CR13","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.\u00a04004, pp. 486\u2013503. Springer, Heidelberg (2006)"},{"key":"24_CR14","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.\u00a03876, pp. 265\u2013284. Springer, Heidelberg (2006)"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Ganta, S.R., Kasiviswanathan, S.P., Smith, A.: Composition attacks and auxiliary information in data privacy. In: KDD, pp. 265\u2013273 (2008)","DOI":"10.1145\/1401890.1401926"},{"issue":"3","key":"24_CR16","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s004930070011","volume":"20","author":"O. Goldreich","year":"2000","unstructured":"Goldreich, O., Goldwasser, S., Lehman, E., Ron, D., Samorodnitsky, A.: Testing monotonicity. Combinatorica\u00a020(3), 301\u2013337 (2000)","journal-title":"Combinatorica"},{"issue":"4","key":"24_CR17","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1145\/285055.285060","volume":"45","author":"O. Goldreich","year":"1998","unstructured":"Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. J. ACM\u00a045(4), 653\u2013750 (1998)","journal-title":"J. ACM"},{"key":"24_CR18","series-title":"Lecture Notes in Computer Science","volume-title":"15th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX 2012, and Proceedings of the 16th International Workshop, RANDOM 2012","year":"2012","unstructured":"Gupta, A., Jansen, K., Rolim, J., Servedio, R. (eds.): APPROX 2012 and RANDOM 2012. LNCS, vol.\u00a07408. Springer, Cambridge (2012)"},{"issue":"4","key":"24_CR19","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1137\/050645804","volume":"37","author":"S. Halevy","year":"2007","unstructured":"Halevy, S., Kushilevitz, E.: Distribution-free property-testing. SIAM J. Comput.\u00a037(4), 1107\u20131138 (2007)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"24_CR20","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/s00453-007-9054-1","volume":"51","author":"S. Halevy","year":"2008","unstructured":"Halevy, S., Kushilevitz, E.: Distribution-free connectivity testing for sparse graphs. Algorithmica\u00a051(1), 24\u201348 (2008)","journal-title":"Algorithmica"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Jha, M., Raskhodnikova, S.: Testing and reconstruction of lipschitz functions with applications to data privacy. In: Ostrovsky, R. (ed.) FOCS, pp. 433\u2013442. IEEE (2011)","DOI":"10.1109\/FOCS.2011.13"},{"key":"24_CR22","unstructured":"Kasiviswanathan, S.P., Smith, A.: A note on differential privacy: Defining resistance to arbitrary side information. CoRR abs\/0803.3946 (2008)"},{"key":"24_CR23","doi-asserted-by":"crossref","unstructured":"Korolova, A.: Privacy violations using microtargeted ads: A case study. In: ICDMW, pp. 474\u2013482 (2010)","DOI":"10.1109\/ICDMW.2010.137"},{"key":"24_CR24","doi-asserted-by":"crossref","unstructured":"Machanavajjhala, A., Gehrke, J., Kifer, D., Venkitasubramaniam, M.: l-diversity: Privacy beyond k-anonymity. In: ICDE, p. 24 (2006)","DOI":"10.1109\/ICDE.2006.1"},{"key":"24_CR25","doi-asserted-by":"crossref","unstructured":"McSherry, F.D.: Privacy integrated queries: an extensible platform for privacy-preserving data analysis. In: SIGMOD, pp. 19\u201330 (2009)","DOI":"10.1145\/1559845.1559850"},{"key":"24_CR26","doi-asserted-by":"crossref","unstructured":"Mohan, P., Thakurta, A., Shi, E., Song, D., Culler, D.: Gupt: privacy preserving data analysis made easy. In: SIGMOD, pp. 349\u2013360 (2012)","DOI":"10.1145\/2213836.2213876"},{"key":"24_CR27","doi-asserted-by":"crossref","unstructured":"Nissim, K., Raskhodnikova, S., Smith, A.: Smooth sensitivity and sampling in private data analysis. In: STOC, pp. 75\u201384 (2007)","DOI":"10.1145\/1250790.1250803"},{"issue":"2","key":"24_CR28","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1002\/rsa.10013","volume":"20","author":"M. Parnas","year":"2002","unstructured":"Parnas, M., Ron, D.: Testing the diameter of graphs. Random Struct. Algorithms\u00a020(2), 165\u2013183 (2002)","journal-title":"Random Struct. Algorithms"},{"key":"24_CR29","doi-asserted-by":"crossref","unstructured":"Reed, J., Pierce, B.C.: Distance makes the types grow stronger: a calculus for differential privacy. In: ICFP, pp. 157\u2013168 (2010)","DOI":"10.1145\/1863543.1863568"},{"key":"24_CR30","unstructured":"Roy, I., Setty, S.T.V., Kilzer, A., Shmatikov, V., Witchel, E.: Airavat: Security and privacy for mapreduce. In: NSDI, pp. 297\u2013312 (2010)"},{"issue":"2","key":"24_CR31","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1137\/S0097539793255151","volume":"25","author":"R. Rubinfeld","year":"1996","unstructured":"Rubinfeld, R., Sudan, M.: Robust characterization of polynomials with applications to program testing. SIAM J. Comput.\u00a025(2), 252\u2013271 (1996)","journal-title":"SIAM J. Comput."},{"key":"24_CR32","doi-asserted-by":"crossref","unstructured":"Smith, A.: Privacy-preserving statistical estimation with optimal convergence rates. In: STOC, pp. 813\u2013822 (2011)","DOI":"10.1145\/1993636.1993743"},{"issue":"5","key":"24_CR33","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L. Sweeney","year":"2002","unstructured":"Sweeney, L.: k-anonymity: A model for protecting privacy. International Journal on Uncertainty, Fuzziness and Knowledge-based Systems\u00a010(5), 557\u2013570 (2002)","journal-title":"International Journal on Uncertainty, Fuzziness and Knowledge-based Systems"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36594-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,29]],"date-time":"2023-06-29T04:52:36Z","timestamp":1688014356000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36594-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642365935","9783642365942"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36594-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}