메뉴 건너뛰기




Volumn , Issue , 2013, Pages 272-283

Optimal error of query sets under the differentially-private matrix mechanism

Author keywords

Differential privacy; Linear query; Lower bound; Matrix mechanism; Spectral decomposition

Indexed keywords

CORRELATED NOISE; DIFFERENTIAL PRIVACIES; LINEAR QUERY; LOWER BOUNDS; REASONABLE ACCURACY; SPECTRAL DECOMPOSITION; SPECTRAL PROPERTIES; SYNTHETIC DATASETS;

EID: 84875580068     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2448496.2448529     Document Type: Conference Paper
Times cited : (33)

References (30)
  • 1
    • 35448955720 scopus 로고    scopus 로고
    • Privacy, accuracy, and consistency too: A holistic solution to contingency table release
    • B. Barak, K. Chaudhuri, C. Dwork, S. Kale, F. McSherry, and K. Talwar. Privacy, accuracy, and consistency too: A holistic solution to contingency table release. In PODS, 2007.
    • (2007) PODS
    • Barak, B.1    Chaudhuri, K.2    Dwork, C.3    Kale, S.4    McSherry, F.5    Talwar, K.6
  • 3
    • 84862590720 scopus 로고    scopus 로고
    • Unconditional di-erentially private mechanisms for linear queries
    • New York, NY, USA
    • A. Bhaskara, D. Dadush, R. Krishnaswamy, and K. Talwar. Unconditional di-erentially private mechanisms for linear queries. In STOC, pages 1269{1284, New York, NY, USA, 2012.
    • (2012) STOC , pp. 1269-1284
    • Bhaskara, A.1    Dadush, D.2    Krishnaswamy, R.3    Talwar, K.4
  • 4
    • 57049136138 scopus 로고    scopus 로고
    • A learning theory approach to non-interactive database privacy
    • A. Blum, K. Ligett, and A. Roth. A learning theory approach to non-interactive database privacy. In STOC, pages 609{618, 2008.
    • (2008) STOC , pp. 609-618
    • Blum, A.1    Ligett, K.2    Roth, A.3
  • 6
    • 79959954388 scopus 로고    scopus 로고
    • Differentially private data cubes: Optimizing noise sources and consistency
    • B. Ding, M. Winslett, J. Han, and Z. Li. Differentially private data cubes: optimizing noise sources and consistency. In SIGMOD, pages 217{228, 2011.
    • (2011) SIGMOD , pp. 217-228
    • Ding, B.1    Winslett, M.2    Han, J.3    Li, Z.4
  • 7
    • 1142275486 scopus 로고    scopus 로고
    • Revealing information while preserving privacy
    • I. Dinur and K. Nissim. Revealing information while preserving privacy. In PODS, pages 202{210, 2003.
    • (2003) PODS , pp. 202-210
    • Dinur, I.1    Nissim, K.2
  • 8
    • 33746037200 scopus 로고    scopus 로고
    • Our data, ourselves: Privacy via distributed noise generation
    • C. Dwork, K. Kenthapadi, F. McSherry, I. Mironov, and M. Naor. Our data, ourselves: Privacy via distributed noise generation. In EUROCRYPT, pages 486{503, 2006.
    • (2006) EUROCRYPT , pp. 486-503
    • Dwork, C.1    Kenthapadi, K.2    McSherry, F.3    Mironov, I.4    Naor, M.5
  • 9
    • 33745556605 scopus 로고    scopus 로고
    • Calibrating noise to sensitivity in private data analysis
    • C. Dwork, F. McSherry, K. Nissim, and A. Smith. Calibrating noise to sensitivity in private data analysis. In TCC, pages 265{284, 2006.
    • (2006) TCC , pp. 265-284
    • Dwork, C.1    McSherry, F.2    Nissim, K.3    Smith, A.4
  • 10
    • 70350689921 scopus 로고    scopus 로고
    • On the complexity of di-erentially private data release: E-cient algorithms and hardness results
    • C. Dwork, M. Naor, O. Reingold, G. Rothblum, and S. Vadhan. On the complexity of di-erentially private data release: e-cient algorithms and hardness results. In STOC, pages 381{390, 2009.
    • (2009) STOC , pp. 381-390
    • Dwork, C.1    Naor, M.2    Reingold, O.3    Rothblum, G.4    Vadhan, S.5
  • 11
    • 78751522594 scopus 로고    scopus 로고
    • Boosting and di-erential privacy
    • C. Dwork, G. N. Rothblum, and S. P. Vadhan. Boosting and di-erential privacy. In FOCS, pages 51{60, 2010.
    • (2010) FOCS , pp. 51-60
    • Dwork, C.1    Rothblum, G.N.2    Vadhan, S.P.3
  • 12
    • 84863421549 scopus 로고    scopus 로고
    • Iterative constructions and private data release
    • A. Gupta, A. Roth, and J. Ullman. Iterative constructions and private data release. In TCC, pages 339{356, 2012.
    • (2012) TCC , pp. 339-356
    • Gupta, A.1    Roth, A.2    Ullman, J.3
  • 13
    • 84877755332 scopus 로고    scopus 로고
    • A simple and practical algorithm for differentially private data release
    • M. Hardt, K. Ligett, and F. McSherry. A simple and practical algorithm for differentially private data release. In NIPS, pages 2348{2356, 2012.
    • (2012) NIPS , pp. 2348-2356
    • Hardt, M.1    Ligett, K.2    Mcsherry, F.3
  • 14
    • 78751489078 scopus 로고    scopus 로고
    • A multiplicative weights mechanism for privacy-preserving data analysis
    • M. Hardt and G. Rothblum. A multiplicative weights mechanism for privacy-preserving data analysis. In FOCS, pages 61{70, 2010.
    • (2010) FOCS , pp. 61-70
    • Hardt, M.1    Rothblum, G.2
  • 15
    • 77954711905 scopus 로고    scopus 로고
    • On the geometry of di-erential privacy
    • M. Hardt and K. Talwar. On the geometry of di-erential privacy. In STOC, pages 705{714, 2010.
    • (2010) STOC , pp. 705-714
    • Hardt, M.1    Talwar, K.2
  • 16
    • 78650518102 scopus 로고    scopus 로고
    • Boosting the accuracy of di-erentially-private histograms through consistency
    • M. Hay, V. Rastogi, G. Miklau, and D. Suciu. Boosting the accuracy of di-erentially-private histograms through consistency. PVLDB, 3(1-2):1021{1032, 2010.
    • (2010) PVLDB , vol.3 , Issue.1-2 , pp. 1021-1032
    • Hay, M.1    Rastogi, V.2    Miklau, G.3    Suciu, D.4
  • 17
    • 77954693385 scopus 로고    scopus 로고
    • The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
    • S. Kasiviswanathan, M. Rudelson, A. Smith, and J. Ullman. The price of privately releasing contingency tables and the spectra of random matrices with correlated rows. In STOC, pages 775{784, 2010.
    • (2010) STOC , pp. 775-784
    • Kasiviswanathan, S.1    Rudelson, M.2    Smith, A.3    Ullman, J.4
  • 18
    • 77954715960 scopus 로고    scopus 로고
    • Optimizing linear counting queries under di-erential privacy
    • C. Li, M. Hay, V. Rastogi, G. Miklau, and A. McGregor. Optimizing linear counting queries under di-erential privacy. In PODS, pages 123{134, 2010.
    • (2010) PODS , pp. 123-134
    • Li, C.1    Hay, M.2    Rastogi, V.3    Miklau, G.4    McGregor, A.5
  • 19
    • 84863733988 scopus 로고    scopus 로고
    • An adaptive mechanism for accurate query answering under differential privacy
    • C. Li and G. Miklau. An adaptive mechanism for accurate query answering under differential privacy. PVLDB, 5(6):514{525, 2012.
    • (2012) PVLDB , vol.5 , Issue.6 , pp. 514-525
    • Li, C.1    Miklau, G.2
  • 21
    • 80955157833 scopus 로고    scopus 로고
    • Compressive mechanism: Utilizing sparse representation in di-erential privacy
    • Y. D. Li, Z. Zhang, M. Winslett, and Y. Yang. Compressive mechanism: utilizing sparse representation in di-erential privacy. In WPES, pages 177{182, 2011.
    • (2011) WPES , pp. 177-182
    • Li, Y.D.1    Zhang, Z.2    Winslett, M.3    Yang, Y.4
  • 22
    • 70350678967 scopus 로고    scopus 로고
    • Differentially Private Recommender Systems : Building Privacy into the Netix Prize Contenders
    • F. McSherry and I. Mironov. Differentially Private Recommender Systems : Building Privacy into the Netix Prize Contenders. In SIGKDD, pages 627{636, 2009.
    • (2009) SIGKDD , pp. 627-636
    • McSherry, F.1    Mironov, I.2
  • 24
    • 35448955271 scopus 로고    scopus 로고
    • Smooth sensitivity and sampling in private data analysis
    • K. Nissim, S. Raskhodnikova, and A. Smith. Smooth sensitivity and sampling in private data analysis. In STOC, pages 75{84, 2007.
    • (2007) STOC , pp. 75-84
    • Nissim, K.1    Raskhodnikova, S.2    Smith, A.3
  • 25
    • 85011019712 scopus 로고    scopus 로고
    • The boundary between privacy and utility in data publishing
    • V. Rastogi, D. Suciu, and S. Hong. The boundary between privacy and utility in data publishing. In VLDB, number 531-542, 2007.
    • (2007) VLDB , Issue.531-542
    • Rastogi, V.1    Suciu, D.2    Hong, S.3
  • 26
    • 77954745685 scopus 로고    scopus 로고
    • Interactive privacy via the median mechanism
    • A. Roth and T. Roughgarden. Interactive privacy via the median mechanism. In STOC, pages 765{774, 2010.
    • (2010) STOC , pp. 765-774
    • Roth, A.1    Roughgarden, T.2
  • 27
    • 77952787160 scopus 로고    scopus 로고
    • Differential privacy via wavelet transforms
    • X. Xiao, G. Wang, and J. Gehrke. Differential privacy via wavelet transforms. In ICDE, pages 225{236, 2010.
    • (2010) ICDE , pp. 225-236
    • Xiao, X.1    Wang, G.2    Gehrke, J.3
  • 28
    • 78649814930 scopus 로고    scopus 로고
    • Differentially private data release through multidimensional partitioning
    • Y. Xiao, L. Xiong, and C. Yuan. Differentially private data release through multidimensional partitioning. In SDM, pages 150{168, 2010.
    • (2010) SDM , pp. 150-168
    • Xiao, Y.1    Xiong, L.2    Yuan, C.3
  • 29
    • 84881345800 scopus 로고    scopus 로고
    • Accurate and e-cient private release of datacubes and contingency tables
    • G. Yaroslavtsev, G. Cormode, C. M. Procopiuc, and D. Srivastava. Accurate and e-cient private release of datacubes and contingency tables. In ICDE, 2013.
    • (2013) ICDE
    • Yaroslavtsev, G.1    Cormode, G.2    Procopiuc, C.M.3    Srivastava, D.4
  • 30
    • 84872862526 scopus 로고    scopus 로고
    • Low-rank mechanism: Optimizing batch queries under di-erential privacy
    • G. Yuan, Z. Zhang, M. Winslett, X. Xiao, Y. Yang, and Z. Hao. Low-rank mechanism: Optimizing batch queries under di-erential privacy. PVLDB, 5(11):1136{1147, 2012.
    • (2012) PVLDB , vol.5 , Issue.11 , pp. 1136-1147
    • Yuan, G.1    Zhang, Z.2    Winslett, M.3    Xiao, X.4    Yang, Y.5    Hao, Z.6


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.