메뉴 건너뛰기




Volumn , Issue , 2013, Pages 215-232

Truthful mechanisms for agents that value privacy

Author keywords

Differential privacy; Mechanism design; Privacy

Indexed keywords

DATA PRIVACY; ELECTRONIC COMMERCE; MACHINE DESIGN;

EID: 84879756092     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2492002.2482549     Document Type: Conference Paper
Times cited : (40)

References (19)
  • 1
    • 33244468835 scopus 로고    scopus 로고
    • Practical privacy: The sulq framework
    • C. Li, Ed. ACM
    • BLUM, A., DWORK, C., MCSHERRY, F., and NISSIM, K. 2005. Practical privacy: the sulq framework. In PODS, C. Li, Ed. ACM, 128-138.
    • (2005) PODS , pp. 128-138
    • Blum, A.1    Dwork, C.2    McSherry, F.3    Nissim, K.4
  • 2
    • 84889281816 scopus 로고
    • 2nd Ed. Wiley Series in Telecommunications. John Wiley & Sons, Inc.
    • COVER, T. M. and THOMAS, J. A. 1991. Elements of Information Theory 2nd Ed. Wiley Series in Telecommunications. John Wiley & Sons, Inc.
    • (1991) Elements of Information Theory
    • Cover, T.M.1    Thomas, J.A.2
  • 3
    • 1142275486 scopus 로고    scopus 로고
    • Revealing information while preserving privacy
    • ACM
    • DINUR, I. and NISSIM, K. 2003. Revealing information while preserving privacy. In PODS. ACM, 202-210.
    • (2003) PODS , pp. 202-210
    • Dinur, I.1    Nissim, K.2
  • 4
    • 84974555688 scopus 로고    scopus 로고
    • A cryptographic solution to a game theoretic problem
    • M. Bellare, Ed. LNCS Series, vol. 1880. Springer
    • Dodis, Y., Halevi, S., and Rabin, T. 2000. A cryptographic solution to a game theoretic problem. In CRYPTO, M. Bellare, Ed. LNCS Series, vol. 1880. Springer, 112-130.
    • (2000) CRYPTO , pp. 112-130
    • Dodis, Y.1    Halevi, S.2    Rabin, T.3
  • 5
    • 33745556605 scopus 로고    scopus 로고
    • Calibrating noise to sensitivity in private data analysis
    • S. Halevi and T. Rabin, Eds. LNCS Series, vol. 3876. Springer
    • DWORK, C., MCSHERRY, F., NISSIM, K., and SMITH, A. 2006. Calibrating noise to sensitivity in private data analysis. In TCC, S. Halevi and T. Rabin, Eds. LNCS Series, vol. 3876. Springer, 265-284.
    • (2006) TCC , pp. 265-284
    • Dwork, C.1    McSherry, F.2    Nissim, K.3    Smith, A.4
  • 6
    • 35048856104 scopus 로고    scopus 로고
    • Privacy-preserving datamining on vertically partitioned databases
    • M. K. Franklin, Ed. LNCS Series, vol. 3152. Springer
    • DWORK, C. and NISSIM, K. 2004. Privacy-preserving datamining on vertically partitioned databases. In CRYPTO, M. K. Franklin, Ed. LNCS Series, vol. 3152. Springer, 528-544.
    • (2004) CRYPTO , pp. 528-544
    • Dwork, C.1    Nissim, K.2
  • 7
    • 78751522594 scopus 로고    scopus 로고
    • Boosting and difierential privacy
    • IEEE Computer Society
    • DWORK, C., ROTHBLUM, G. N., and VADHAN, S. P. 2010. Boosting and difierential privacy. In FOCS. IEEE Computer Society, 51-60.
    • (2010) FOCS , pp. 51-60
    • Dwork, C.1    Rothblum, G.N.2    Vadhan, S.P.3
  • 8
    • 77954754217 scopus 로고    scopus 로고
    • Approximate privacy: Foundations and quantification (extended abstract)
    • ACM
    • FEIGENBAUM, J., JAGGARD, A. D., and Schapira, M. 2010. Approximate privacy: foundations and quantification (extended abstract). In ACM EC. ACM, 167-178.
    • (2010) ACM EC , pp. 167-178
    • Feigenbaum, J.1    Jaggard, A.D.2    Schapira, M.3
  • 9
    • 79959622530 scopus 로고    scopus 로고
    • Selling privacy at auction
    • ACM, New York, NY, USA
    • GHOSH, A. and ROTH, A. 2011. Selling privacy at auction. In ACM EC. EC '11. ACM, New York, NY, USA, 199-208.
    • (2011) ACM EC. EC '11 , pp. 199-208
    • Ghosh, A.1    Roth, A.2
  • 10
    • 84871966152 scopus 로고    scopus 로고
    • The exponential mechanism for social welfare: Private, truthful, and nearly optimal
    • HUANG, Z. and KANNAN, S. 2012. The exponential mechanism for social welfare: Private, truthful, and nearly optimal. In FOCS.
    • (2012) FOCS
    • Huang, Z.1    Kannan, S.2
  • 11
    • 33748582624 scopus 로고    scopus 로고
    • Rational secure computation and ideal mechanism design
    • IEEE Computer Society
    • Izmalkov, S., Micali, S., and Lepinski, M. 2005. Rational secure computation and ideal mechanism design. In FOCS. IEEE Computer Society, 585-595.
    • (2005) FOCS , pp. 585-595
    • Izmalkov, S.1    Micali, S.2    Lepinski, M.3
  • 14
    • 84883898504 scopus 로고    scopus 로고
    • Privacy preserving auctions and mechanism design
    • NAOR, M., PINKAS, B., and SUMNER, R. 1999. Privacy preserving auctions and mechanism design. In ACM EC. 129-139.
    • (1999) ACM EC , pp. 129-139
    • Naor, M.1    Pinkas, B.2    Sumner, R.3
  • 15
  • 16
    • 84856434218 scopus 로고    scopus 로고
    • Approximately optimal mechanism design via di-erential privacy
    • S. Goldwasser, Ed. ACM
    • NISSIM, K., SMORODINSKY, R., and TENNENHOLTZ, M. 2012b. Approximately optimal mechanism design via di-erential privacy. In ITCS, S. Goldwasser, Ed. ACM, 203-213.
    • (2012) ITCS , pp. 203-213
    • Nissim, K.1    Smorodinsky, R.2    Tennenholtz, M.3
  • 19
    • 84873340810 scopus 로고    scopus 로고
    • Is privacy compatible with truthfulness?
    • R. D. Kleinberg, Ed. ACM
    • XIAO, D. 2013. Is privacy compatible with truthfulness? In ITCS, R. D. Kleinberg, Ed. ACM, 67-86.
    • (2013) ITCS , pp. 67-86
    • Xiao, D.1


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