Sciweavers

84 search results - page 13 / 17
» Anonymizing sequential releases
Sort
View
ACSC
2008
IEEE
13 years 11 months ago
An efficient hash-based algorithm for minimal k-anonymity
A number of organizations publish microdata for purposes such as public health and demographic research. Although attributes of microdata that clearly identify individuals, such a...
Xiaoxun Sun, Min Li, Hua Wang, Ashley W. Plank
CSFW
2011
IEEE
12 years 9 months ago
Dynamic Enforcement of Knowledge-Based Security Policies
—This paper explores the idea of knowledge-based security policies, which are used to decide whether to answer queries over secret data based on an estimation of the querier’s ...
Piotr Mardziel, Stephen Magill, Michael Hicks, Mud...
ICDCS
1996
IEEE
14 years 1 months ago
The Relative Importance of Concurrent Writers and Weak Consistency Models
This paper presents a detailed comparison of the relative importance of allowing concurrent writers versus the choice of the underlying consistency model. Our comparison is based ...
Peter J. Keleher
CIKM
2009
Springer
14 years 4 months ago
POkA: identifying pareto-optimal k-anonymous nodes in a domain hierarchy lattice
Data generalization is widely used to protect identities and prevent inference of sensitive information during the public release of microdata. The k-anonymity model has been exte...
Rinku Dewri, Indrajit Ray, Indrakshi Ray, Darrell ...
NAR
1998
122views more  NAR 1998»
13 years 9 months ago
The PIR-International Protein Sequence Database
The Protein Information Resource (PIR; http://wwwnbrf.georgetown.edu/pir/ ) supports research on molecular evolution, functional genomics, and computational biology by maintaining...
Winona C. Barker, John S. Garavelli, Daniel H. Haf...