Title 1
Preface 4
Organization 5
Table of Contents 7
Keynote Paper 7
Assuring Data Trustworthiness - Concepts and Research Challenges 9
Introduction 9
Related Work 11
A Framework for Assuring Information Trustworthiness 12
An Application to Sensor Networks 14
Adopting the Framework into Sensor Networks 14
Modeling Sensor Networks and Data Provenances 15
Computing Trust Scores 15
Research Issues and Challenges 16
Concluding Remarks 18
References 18
Privacy Protection 7
On-the-Fly Hierarchies for Numerical Attributes in Data Anonymization 21
Introduction 21
Creating On-the-Fly Hierarchies for Numerical Attributes 24
K-Anonymity and Numerical Quasi-identifier Attributes with Hierarchies 27
Experimental Results 30
Conclusions 32
References 32
eM$^2$: An Efficient Member Migration Algorithm for Ensuring k-Anonymity and Mitigating Information Loss 34
Introduction 34
The Member Migration Technique 36
Preliminaries 38
Policies 38
Metrics 39
The Proposed eM$^2$ Algorithm 43
Experiments 45
Conclusions 46
References 47
Constrained Anonymization of Production Data: A Constraint Satisfaction Problem Approach 49
Introduction 49
Problem Statement 50
CSP Approach for Constrained Anonymization 51
Decomposing the Rule Set 52
Defining the CSPs 52
Decomposing CSP$_RS$ 53
Solving CSPS$_RS$ 54
A Toy Example 54
Experimental Results 57
Related Work 58
Summary and Future Work 59
References 59
Privacy Preserving Event Driven Integration for Interoperating Social and Health Systems 62
Introduction 62
The Scenario 64
State of the Art 65
Event-Based Architecture 66
Event-Based Privacy Constraints 69
Elicitation 70
Enforcement 71
Privacy Requirements Elicitation Tool 73
Conclusions and Future Work 76
References 76
Data Security in Open Environments 7
Joining Privately on Outsourced Data 78
Introduction 78
Model 79
Tools 81
Outsourced JOINs with Privacy 82
Predicate Instances 85
Range JOIN 85
Hamming JOIN 85
Experimental Results 87
Related Work 90
Conclusions 91
References 92
Computationally Efficient Searchable Symmetric Encryption 95
Introduction 95
Related Work 96
Description of the Problem 98
Background and Definitions 99
Security Definitions 99
Efficiently Searchable Encryption Schemes 101
Scheme 1: Interactive Search and Storage 102
Security for Scheme 1 103
Scheme 2: Non-interactive Search and Storage 104
Security for Scheme 1 106
Security of Updates 106
Application 106
Conclusion 107
References 107
Towards the Secure Modelling of OLAP Users\u2019 Behaviour 109
Introduction 109
Secure Modelling of OLAP Systems 111
Static Modelling 111
Dynamic Modelling 112
Session Control 114
Case Study 114
Conclusions 118
References 119
A Formal P3P Semantics for Composite Services 121
Introduction 121
The Platform for Privacy Preferences 122
P3P Syntax 123
Potential Semantic P3P Inconsistencies 125
P3P Policy in Composite Services Analysis 125
P3P Enhancements 126
Recipient Value 126
Third Party Service List 127
Destruction Time Table 128
Formal Semantics for P3P in Composite Services 129
Data-Purpose Centric Semantics for P3P 129
Constraints for Integrity Verification 130
Constraints for Integrity Verification between Services 131
Combining Mechanism 132
Example 135
Related Work 138
Conclusions 138
References 139
A Geometric Approach for Efficient Licenses Validation in DRM 140
Introduction 140
Preliminaries 142
Validation in Case of Multiple Licenses 142
Overview of Validation Tree 144
Proposed Efficient Validation Approach 146
Geometric Representation of Licenses 146
Redundant Validation Equations 147
Identification of Disconnected Groups 148
Validation Algorithm 150
Division of Validation Tree 150
Modification of Indexes 151
Performance Analysis 153
Conclusion 156
References 156
Differentially Private Data Release through Multidimensional Partitioning 158
Introduction 158
Related Works 160
Preliminaries and Definitions 161
Differential Privacy 161
Composition 162
Sufficient Bound of 伪 162
Data Cube 163
( , 未)-usefulness 163
Categorization of Aggregate Queries 163
PINQ 164
Multidimensional Partitioning Approach 164
Overview 164
Cell-Based Algorithm 165
K-d Tree Based Algorithm 166
Applications 168
Experiment 169
Cell-Based Algorithm 169
Average Query 170
K-d Tree Based Algorithm 170
Conclusions and Future Works 172
References 173
Author Index 177