메뉴 건너뛰기




Volumn , Issue , 2005, Pages 186-199

Two can keep a secret: A distributed architecture for secure database services

Author keywords

[No Author keywords available]

Indexed keywords

DATA ENCRYPTION; DATABASE SCHEMAS; DISTRIBUTED ARCHITECTURE; EXECUTE QUERY; ITS DATA; OUTSOURCE; RECENT TRENDS; SECURE DATABASE; UNTRUSTED SERVER;

EID: 84863338303     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (219)

References (32)
  • 1
    • 0242698195 scopus 로고    scopus 로고
    • On the design and quantification of privacy preserving datamining algorithms
    • D. Agrawal and C. Aggarwal. On the design and quantification of privacy preserving datamining algorithms. In Proc. PODS, 2001.
    • (2001) Proc. PODS
    • Agrawal, D.1    Aggarwal, C.2
  • 7
    • 0000301097 scopus 로고
    • A greedy heuristic for the set-covering problem
    • Vasek Chvatal. A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 4(3):233-235, 1979.
    • (1979) Mathematics of Operations Research , vol.4 , Issue.3 , pp. 233-235
    • Chvatal, V.1
  • 8
    • 0020205885 scopus 로고
    • Auditing and inference control in statistical databases
    • F. Chin and G. Ozsoyoglu. Auditing and inference control in statistical databases. In IEEE TSE, 8(6), 1982.
    • (1982) IEEE TSE , vol.8 , Issue.6
    • Chin, F.1    Ozsoyoglu, G.2
  • 9
    • 84863340497 scopus 로고    scopus 로고
    • Signs outsourcing deal with IBM
    • Dec 30
    • J.P. Morgan signs outsourcing deal with IBM. ComputerWorld, Dec 30, 2002.
    • (2002) ComputerWorld
    • Morgan, J.P.1
  • 10
    • 0018444418 scopus 로고
    • Secure databases: Protection against user inuence
    • D. Dobkin, A. Jones, and R. Lipton. Secure databases: Protection against user inuence. In ACM TODS, 4(1), 1979.
    • (1979) ACM TODS , vol.4 , Issue.1
    • Dobkin, D.1    Jones, A.2    Lipton, R.3
  • 11
    • 34248222960 scopus 로고    scopus 로고
    • Revealing information while preserving privacy
    • I. Dinur and K. Nissim. Revealing information while preserving privacy. In Proc. PODS, 2003.
    • (2003) Proc. PODS
    • Dinur, I.1    Nissim, K.2
  • 12
    • 33244461250 scopus 로고    scopus 로고
    • Privacy-preserving datamining on vertically partitioned databases
    • C. Dwork and K. Nissim. Privacy-preserving datamining on vertically partitioned databases. In Proc. CRYPTO, 2004.
    • (2004) Proc. CRYPTO
    • Dwork, C.1    Nissim, K.2
  • 13
    • 24944474471 scopus 로고    scopus 로고
    • Limiting privacy breaches in privacy preserving data mining
    • A. Evfimievski, J. Gehrke, and R. Srikant. Limiting privacy breaches in privacy preserving data mining. In Proc. PODS, 2003.
    • (2003) Proc. PODS
    • Evfimievski, A.1    Gehrke, J.2    Srikant, R.3
  • 16
    • 0002337124 scopus 로고
    • How to play any mental game - A completeness theorem for protocols with a honest majority
    • O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game - a completeness theorem for protocols with a honest majority. In Proc. STOC, 1987.
    • (1987) Proc. STOC
    • Goldreich, O.1    Micali, S.2    Wigderson, A.3
  • 17
    • 0036361105 scopus 로고    scopus 로고
    • Executing sql over encrypted data in the database-service-provider model
    • H. Hacigumus, B. Iyer, C. Li, and S. Mehrotra. Executing sql over encrypted data in the database-service-provider model. In Proc. SIGMOD, 2002.
    • (2002) Proc. SIGMOD
    • Hacigumus, H.1    Iyer, B.2    Li, C.3    Mehrotra, S.4
  • 19
    • 79955981313 scopus 로고    scopus 로고
    • Efficient execution of aggregation queries over encrypted relational databases
    • H. Hacigumus, B. Iyer, and S. Mehrotra. Efficient execution of aggregation queries over encrypted relational databases. In Proc. DASFAA, 2004.
    • (2004) Proc. DASFAA
    • Hacigumus, H.1    Iyer, B.2    Mehrotra, S.3
  • 23
    • 0030197678 scopus 로고    scopus 로고
    • A new approach to the minimum cut problem
    • David Karger and Clifford Stein. A new approach to the minimum cut problem. Journal of the ACM, 43(4):601-640, July 1996. (Pubitemid 126582607)
    • (1996) Journal of the ACM , vol.43 , Issue.4 , pp. 601-640
    • Karger, D.R.1    Stein, C.2
  • 25
    • 33745587324 scopus 로고    scopus 로고
    • On the complexity of optimal k-anonymity
    • A. Meyerson and R. Williams. On the complexity of optimal k-anonymity. In Proc. PODS, 2004.
    • (2004) Proc. PODS
    • Meyerson, A.1    Williams, R.2
  • 28
    • 34250622667 scopus 로고    scopus 로고
    • Sept.
    • California senate bill SB 1386. http://info.sen.ca.gov/pub/01-02/bill/ sen/sb-1351-1400/sb-1386-bill-20020926-chaptered.html, Sept. 2002.
    • (2002) California Senate Bill SB 1386
  • 32
    • 0003113271 scopus 로고
    • How to generate and exchange secrets
    • Andrew Yao. How to generate and exchange secrets. In Proc. FOCS, 1986.
    • (1986) Proc. FOCS
    • Yao, A.1


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