14704 search results - page 2643 / 2941 » computing 2007 |
131
Voted
TCC
2007
Springer
15 years 10 months ago
2007
Springer
We prove a computational soundness theorem for symmetric-key encryption protocols that can be used to analyze security against adaptively corrupting adversaries (that is, adversar...
138
Voted
VAMOS
2007
Springer
15 years 10 months ago
2007
Springer
Goal models have been found to be effective for representing and analyzing variability at the early requirements level, by comprehensibly representing all alternative ways by whic...
136
Voted
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
Imagine that you have been entrusted with private data, such as corporate product information, sensitive government information, or symptom and treatment information about hospita...
133
Voted
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
Intuitively, aggressive work sharing among concurrent queries in a database system should always improve performance by eliminating redundant computation or data accesses. We show...
140
click to vote
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
We consider the privacy problem in data publishing: given a database instance containing sensitive information “anonymize” it to obtain a view such that, on one hand attackers...