![]() ![]() ![]() |
![]() |
|
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]()
|
Return to RESEARCH SESSION 3: CONTROLLING ACCESS We present a practical and efficient approach to incorporating privacy policy enforcement into an existing application and database environment, and we explore some of the semantics tradeoffs introduced by enforcing these rules at cell-level granularity. Through a comprehensive set of performance experiments, we show that the cost of privacy enforcement is small, and scalable to large databases. ![]() ©2005 Association for Computing Machinery |