메뉴 건너뛰기




Volumn , Issue , 2010, Pages 401-407

Utility and privacy of data sources: Can Shannon help conceal and reveal information?

Author keywords

[No Author keywords available]

Indexed keywords

DATA REPOSITORIES; DATA SOURCE; EXTERNAL KNOWLEDGE; MULTIPLE QUERIES; PRIVACY METRICS; PRIVATE DATA; PRIVATE INFORMATION; RATE DISTORTION-THEORY; SIDE-INFORMATION;

EID: 77952722723     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITA.2010.5454092     Document Type: Conference Paper
Times cited : (6)

References (22)
  • 1
    • 0017930809 scopus 로고
    • A method for obtaining digital signatures and public-key cryptosystem
    • Feb.
    • R. Rivest, A. Shamir, and L. Adleman, "A method for obtaining digital signatures and public-key cryptosystem," Communications of the ACM, vol. 21, no. 2, pp. 120-126, Feb. 1978.
    • (1978) Communications of the ACM , vol.21 , Issue.2 , pp. 120-126
    • Rivest, R.1    Shamir, A.2    Adleman, L.3
  • 2
    • 10644270917 scopus 로고    scopus 로고
    • Secrecy capacities for multiple terminals
    • Dec.
    • I. Csiszár and P. Narayan, "Secrecy capacities for multiple terminals," IEEE Trans. Inform. Theory, vol. 50, no. 12, pp. 3047-3061, Dec. 2004.
    • (2004) IEEE Trans. Inform. Theory , vol.50 , Issue.12 , pp. 3047-3061
    • Csiszár, I.1    Narayan, P.2
  • 3
    • 0016562514 scopus 로고
    • The wire-tap channel
    • A. D. Wyner, "The wire-tap channel," Bell Sys. Tech. J., vol. 54, pp. 1355-1387, 1975.
    • (1975) Bell Sys. Tech. J. , vol.54 , pp. 1355-1387
    • Wyner, A.D.1
  • 5
    • 0024914229 scopus 로고
    • Security-control methods for statistical databases: A comparative study
    • N. R. Adam and J. C. Wortmann, "Security-control methods for statistical databases: A comparative study," ACM Computing Surveys, vol. 21, no. 4, pp. 515-556, 1989.
    • (1989) ACM Computing Surveys , vol.21 , Issue.4 , pp. 515-556
    • Adam, N.R.1    Wortmann, J.C.2
  • 6
    • 0000072558 scopus 로고
    • Finding a needle in a haystack - Or identifying anonymous census records
    • T. Dalenius, "Finding a needle in a haystack - or identifying anonymous census records," Jour. Official Stats., vol. 2, no. 3, pp. 329-336, 1986.
    • (1986) Jour. Official Stats. , vol.2 , Issue.3 , pp. 329-336
    • Dalenius, T.1
  • 7
    • 0036811662 scopus 로고    scopus 로고
    • K-anonymity: A model for protecting privacy
    • L. Sweeney, "k-anonymity: A model for protecting privacy," IEEE Trans. Inform. Theory, vol. 10, no. 5, pp. 557-570, 2002.
    • (2002) IEEE Trans. Inform. Theory , vol.10 , Issue.5 , pp. 557-570
    • Sweeney, L.1
  • 11
    • 0020843592 scopus 로고
    • A source coding problem for sources with additional outputs to keep secret from the receiver or wiretappers
    • Nov.
    • H. Yamamoto, "A source coding problem for sources with additional outputs to keep secret from the receiver or wiretappers," IEEE Trans. Inform. Theory, vol. 29, no. 6, pp. 918-923, Nov. 1983.
    • (1983) IEEE Trans. Inform. Theory , vol.29 , Issue.6 , pp. 918-923
    • Yamamoto, H.1
  • 13
    • 2942650789 scopus 로고    scopus 로고
    • Rate-distortion approach to databases: Storage and content retrieval
    • June
    • E. Tuncel, P. Koulgi, and K. Rose, "Rate-distortion approach to databases: Storage and content retrieval," IEEE Trans. Inform. Theory, vol. 50, no. 6, pp. 953-967, June 2004.
    • (2004) IEEE Trans. Inform. Theory , vol.50 , Issue.6 , pp. 953-967
    • Tuncel, E.1    Koulgi, P.2    Rose, K.3
  • 15
    • 0003214704 scopus 로고
    • Coding theorems for a discrete source with a fidelity criterion
    • C. E. Shannon, "Coding theorems for a discrete source with a fidelity criterion," IRE Nat. Conv. Record, vol. 7, pp. 325-350, 1959.
    • (1959) IRE Nat. Conv. Record , vol.7 , pp. 325-350
    • Shannon, C.E.1
  • 16
    • 0016882596 scopus 로고
    • The rate-distortion function for source coding with side information at the decoder
    • Jan.
    • A. D. Wyner and J. Ziv, "The rate-distortion function for source coding with side information at the decoder," IEEE Trans. Inform. Theory, vol. 22, no. 1, pp. 1-10, Jan. 1976.
    • (1976) IEEE Trans. Inform. Theory , vol.22 , Issue.1 , pp. 1-10
    • Wyner, A.D.1    Ziv, J.2
  • 20
    • 0026120037 scopus 로고
    • Successive refinement of information
    • Mar.
    • W. Equitz and T. Cover, "Successive refinement of information," IEEE Trans. Inform. Theory, vol. 37, no. 2, pp. 269-275, Mar. 1991.
    • (1991) IEEE Trans. Inform. Theory , vol.37 , Issue.2 , pp. 269-275
    • Equitz, W.1    Cover, T.2
  • 21
    • 0028261357 scopus 로고
    • Successive refinement of information: Characterization of the achievable rates
    • Jan.
    • B. Rimoldi, "Successive refinement of information: Characterization of the achievable rates," IEEE Trans. Inform. Theory, vol. 40, no. 1, pp. 253-259, Jan. 1994.
    • (1994) IEEE Trans. Inform. Theory , vol.40 , Issue.1 , pp. 253-259
    • Rimoldi, B.1
  • 22
    • 77952727585 scopus 로고    scopus 로고
    • The rate-distortion region for multiple descriptions without excess rate
    • R. Ahlswede, "The rate-distortion region for multiple descriptions without excess rate," IEEE J. Uncert. Fuzz. and Knowledge-based Sys., vol. 10, no. 5, pp. 557-570, 2002.
    • (2002) IEEE J. Uncert. Fuzz. and Knowledge-based Sys. , vol.10 , Issue.5 , pp. 557-570
    • Ahlswede, R.1


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