Sciweavers

208 search results - page 4 / 42
» Relations Among Privacy Notions
Sort
View
CSFW
2007
IEEE
14 years 2 months ago
Approximated Computationally Bounded Simulation Relations for Probabilistic Automata
We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. T...
Roberto Segala, Andrea Turrini
ESORICS
2009
Springer
14 years 8 months ago
Formal Indistinguishability Extended to the Random Oracle Model
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
Cristian Ene, Yassine Lakhnech, Van Chan Ngo
ERSHOV
2006
Springer
13 years 11 months ago
A Formal Model of Data Privacy
Information systems support data privacy by constraining user's access to public views and thereby hiding the non-public underlying data. The privacy problem is to prove that ...
Phiniki Stouppa, Thomas Studer
VLDB
2005
ACM
114views Database» more  VLDB 2005»
14 years 1 months ago
Checking for k-Anonymity Violation by Views
When a private relational table is published using views, secrecy or privacy may be violated. This paper uses a formally-defined notion of k-anonymity to measure disclosure by vi...
Chao Yao, Xiaoyang Sean Wang, Sushil Jajodia
CSFW
2007
IEEE
14 years 2 months ago
Collaborative Planning With Privacy
Collaboration among organizations or individuals is common. While these participants are often unwilling to share all their information with each other, some information sharing i...
Max I. Kanovich, Paul Rowe, Andre Scedrov