Integrated privacy protection and access control over outsourced database services

Journal of Computational Information Systems

Volumn 6, Issue 8, 2010, Pages 2767-2777

  Yu, Yonghong ^a   Bai, Wenyang ^b  

^a ANHUI UNIVERSITY OF FINANCE AND ECONOMICS   (China)

^b NANJING UNIVERSITY   (China)

Author keywords

Access control; Attribute partition; Data privacy; Encryption; Outsourced database services; User privacy

Indexed keywords

ATTRIBUTE PARTITION; COMMUNICATION COMPLEXITY; DATA CONFIDENTIALITY; DATA-BASE SERVERS; DATABASE SERVICE; ENCRYPTION; FLEXIBLE DEFINITION; LEGAL REGULATION; NEW MODEL; PRIVACY CONSTRAINTS; PRIVACY PROTECTION; PRIVACY REQUIREMENTS; PRIVATE INFORMATION RETRIEVAL; REAL-WORLD APPLICATION; RELATIONAL SCHEMAS; SENSITIVE INFORMATIONS; USER PRIVACY;

ACCESS CONTROL; APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; DATABASE SYSTEMS; LAWS AND LEGISLATION; SECURITY SYSTEMS;

DATA PRIVACY;

EID: 77957769385     PISSN: 15539105     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. H.Hacigumus, B.Iyer, and S.Mehrotra. Providing database as a service[C]. Proc. of ICDE, 2002, pp29-38
2. S.Mehrotra, H.Hacigumus, and B.Iyer. Efficient execution of aggregration queries over encrypted relation databases[C]. Proc. of DASFAA, 2004, pp125-136
3. Rakesh Agrawal, Jerry Kiernan, Ramakrishnan Srikant, and Yirong Xu. Fine order-preserving encryption for numeric data[C]. Proc. of ICDM, 2004, pp563-574
4. Trusted Computing Group. TPM Specification Version 1.2. Part 1 Design Principles. https://www.trustedcomputinggroup.org/specs/TPM/Main-Part1_rev94.zip, 2007
5. G.Aggrawal, N.Mishra, and B.Pinks. Secure computation of the k th-ranked element[C]. Proc. of EUROCRYPT, 2004, pp40-55
6. G.Aggrawal, M.Bawa, P.Ganesan, et al. Two can keep a secret: a distributed aritecture for secure database services[C]. Proc. of CIDR, 2005, pp186-199
7. B.Chor, O.Goldreich, E.Kushilevitz, and M.Sudan. Private information retrieval[C]. Proc. of FOCS, 1995, pp41-50
8. 1/(2k-1)) barrier for information-theoretic private information retrieval[C]. Proc. of FOCS, 2002, pp261-270
9. E.Kushilevitz, R.Ostrovsky. Replication is not needed: single database, computationally-privacy information retrieval[C]. Proc. of FOCS, 1997, pp364-373
10. Y.Gertner, S.Goldwasser, T.Malkin. A random server model for private information retrieval or how to achieve information theoretic PIR avoiding database replication[C]. Proc. of RANDOM, 1998, pp200-217
11. S.D.Vimercati, S.Foresti, S.Jajodia, et al. A data outsourcing architecture combining cryptography and access control[C]. Proc. of the ACM Workshop on Computer Security Architecture, 2007,pp63-69
12. S.D.Vimercati, S.Foresti, S.Jajodia, et al. Over-encryption: Management of access control evolution on outsourced data[C]. Proc. of VLDB, 2007, pp123-134
13. M.Garey and D.Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness[M]. W.H.Freeman, 1979
14. D.Johnson. Approximation algorithm for combinatorial problems[C]. Proc. of STOC, 1973, pp38-49
15. S.Lodha and D.Thomas. Probabilistic anonymity[C]. In Proceedings of the First international Workshop on Privacy, Security, and Trust in KDD, 2007, pp56-79
16. S.Pohlig and M.Hellman. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance[J]. IEEE transactions on Information Theory, 1978, 24: 106-110