메뉴 건너뛰기




Volumn 8042 LNCS, Issue PART 1, 2013, Pages 298-315

Accuracy-privacy tradeoffs for two-party differentially private protocols

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION COMPLEXITY; DIFFERENTIAL PRIVACIES; GENERAL UPPER BOUND; GEOMETRIC TECHNIQUES; ONE-WAY FUNCTIONS; PRIVACY REQUIREMENTS; PRIVATE PROTOCOLS; TWO-PARTY PROTOCOLS;

EID: 84884467207     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-40041-4_17     Document Type: Conference Paper
Times cited : (24)

References (30)
  • 1
    • 33746028196 scopus 로고
    • Perfect privacy for two-party protocols
    • Feigenbaum, J., Merritt, M. (eds.) American Mathematical Society
    • Beaver, D.: Perfect privacy for two-party protocols. In: Feigenbaum, J., Merritt, M. (eds.) Proceedings of DIMACS Workshop on Distributed Computing and Cryptology, vol. 2, pp. 65-77. American Mathematical Society (1989)
    • (1989) Proceedings of DIMACS Workshop on Distributed Computing and Cryptology , vol.2 , pp. 65-77
    • Beaver, D.1
  • 4
    • 35248854495 scopus 로고    scopus 로고
    • On the limitations of universally composable two-party computation without set-up assumptions
    • Biham, E. (ed.) EUROCRYPT 2003. Springer, Heidelberg
    • Canetti, R., Kushilevitz, E., Lindell, Y.: On the limitations of universally composable two-party computation without set-up assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 68-86. Springer, Heidelberg (2003)
    • (2003) LNCS , vol.2656 , pp. 68-86
    • Canetti, R.1    Kushilevitz, E.2    Lindell, Y.3
  • 5
    • 84866647559 scopus 로고    scopus 로고
    • Optimal lower bound for differentially private multi-party aggregation
    • Epstein, L., Ferragina, P. (eds.) ESA 2012. Springer, Heidelberg
    • Chan, T.-H.H., Shi, E., Song, D.: Optimal lower bound for differentially private multi-party aggregation. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 277-288. Springer, Heidelberg (2012)
    • (2012) LNCS , vol.7501 , pp. 277-288
    • Chan, T.-H.H.1    Shi, E.2    Song, D.3
  • 7
    • 0002738457 scopus 로고
    • A zero-one law for Boolean privacy
    • Chor, B., Kushilevitz, E.: A zero-one law for Boolean privacy. SIAM J. Discrete Math. 4(1), 36-47 (1991)
    • (1991) SIAM J. Discrete Math. , vol.4 , Issue.1 , pp. 36-47
    • Chor, B.1    Kushilevitz, E.2
  • 8
    • 84858307870 scopus 로고    scopus 로고
    • Lower bounds in differential privacy
    • Cramer, R. (ed.) TCC 2012. Springer, Heidelberg
    • De, A.: Lower bounds in differential privacy. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 321-338. Springer, Heidelberg (2012)
    • (2012) LNCS , vol.7194 , pp. 321-338
    • De, A.1
  • 9
    • 1142275486 scopus 로고    scopus 로고
    • Revealing information while preserving privacy
    • ACM
    • Dinur, I., Nissim, K.: Revealing information while preserving privacy. In: PODS, pp. 202-210. ACM (2003)
    • (2003) PODS , pp. 202-210
    • Dinur, I.1    Nissim, K.2
  • 10
    • 33746335051 scopus 로고    scopus 로고
    • Differential privacy
    • Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. Part II, Springer, Heidelberg
    • Dwork, C.: Differential privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. Part II, LNCS, vol. 4052, pp. 1-12. Springer, Heidelberg (2006)
    • (2006) LNCS , vol.4052 , pp. 1-12
    • Dwork, C.1
  • 13
    • 35048856104 scopus 로고    scopus 로고
    • Privacy-preserving datamining on vertically partitioned databases
    • Franklin, M. (ed.) CRYPTO 2004. Springer, Heidelberg
    • Dwork, C., Nissim, K.: Privacy-preserving datamining on vertically partitioned databases. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 528-544. Springer, Heidelberg (2004)
    • (2004) LNCS , vol.3152 , pp. 528-544
    • Dwork, C.1    Nissim, K.2
  • 18
    • 33749559395 scopus 로고    scopus 로고
    • Completeness in two-party secure computation: A computational view
    • Harnik, D., Naor, M., Reingold, O., Rosen, A.: Completeness in two-party secure computation: A computational view. J. Cryptology 19(4), 521-552 (2006)
    • (2006) J. Cryptology , vol.19 , Issue.4 , pp. 521-552
    • Harnik, D.1    Naor, M.2    Reingold, O.3    Rosen, A.4
  • 22
    • 4544353942 scopus 로고
    • A general completeness theorem for two-party games
    • Koutsougeras, C., Vitter, J.S. (eds.) ACM
    • Kilian, J.: A general completeness theorem for two-party games. In: Koutsougeras, C., Vitter, J.S. (eds.) STOC, pp. 553-560. ACM (1991)
    • (1991) STOC , pp. 553-560
    • Kilian, J.1
  • 23
    • 0033706604 scopus 로고    scopus 로고
    • More general completeness theorems for secure two-party computation
    • Kilian, J.: More general completeness theorems for secure two-party computation. In: STOC, pp. 316-324 (2000)
    • (2000) STOC , pp. 316-324
    • Kilian, J.1
  • 24
    • 0024768184 scopus 로고
    • Privacy and communication complexity
    • Kushilevitz, E.: Privacy and communication complexity. In: FOCS, pp. 416-421 (1989)
    • (1989) FOCS , pp. 416-421
    • Kushilevitz, E.1
  • 26
    • 70350338483 scopus 로고    scopus 로고
    • Computational differential privacy
    • Halevi, S. (ed.) CRYPTO 2009. Springer, Heidelberg
    • Mironov, I., Pandey, O., Reingold, O., Vadhan, S.: Computational differential privacy. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 126-142. Springer, Heidelberg (2009)
    • (2009) LNCS , vol.5677 , pp. 126-142
    • Mironov, I.1    Pandey, O.2    Reingold, O.3    Vadhan, S.4
  • 29
    • 84884476279 scopus 로고    scopus 로고
    • CRYPTO 2008. Springer, Heidelberg
    • Wagner, D. (ed.): CRYPTO 2008. LNCS, vol. 5157. Springer, Heidelberg (2008)
    • (2008) LNCS , vol.5157
    • Wagner, D.1


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