Skip to search formSkip to main contentSkip to account menu
Geo-indistinguishability: differential privacy for location-based systems
The growing popularity of location-based systems, allowing unknown/untrusted servers to easily collect huge amounts of information regarding users' location, has recently started raising serious…
View on ACM
Broadening the Scope of Differential Privacy Using Metrics
TLDR
Differential Privacy is one of the most prominent frameworks used to deal with disclosure prevention in statistical databases, ensuring that sensitive information relative to individuals cannot be easily inferred by disclosing answers to aggregate queries.
View via Publisher
Optimal Geo-Indistinguishable Mechanisms for Location Privacy
TLDR
It is shown that, given a desired degree of geo-indistinguishability, it is possible to construct a mechanism that minimizes the service quality loss, using linear programming techniques and also provides optimal privacy in the sense of Shokri et al.
View on ACM
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi
  • C. Palamidessi
  • Computer Science
    Mathematical Structures in Computer Science
  • 1 October 2003
TLDR
It is shown that there does not exist any uniform, fully distributed translation from the $\pi$-calculus into the asynchronous $\pi$, up to any ‘reasonable’ notion of equivalence.
View on Cambridge Press
Kernel-LEAF: A Logic plus Functional Language
View via Publisher
Measuring Information Leakage Using Generalized Gain Functions
TLDR
G-leakage is introduced, a rich generalization of the min-entropy model of quantitative information flow and bounds between min-capacity, g- capacity, and Shannon capacity are proved, and a deep connection between a strong leakage ordering on two channels is shown, and the Lattice of Information is proposed from deterministic to probabilistic channels.
View on IEEE
Declarative Modeling of the Operational Behavior of Logic Languages
View via Publisher
Comparing the expressive power of the synchronous and the asynchronous π-calculus
TLDR
It is shown that there does not exist any uniform, parallel-preserving, translation from the ¿-calculus into the asynchronous ¹calculus, up to any "reasonable" notion of equivalence, and this result is based on the incapablity of the asynchronous¬calculus of breaking certain symmetries possibly present in the initial communication graph.
View on ACM
Embedding as a Tool for Language Comparison
TLDR
This paper addresses the problem of defining a formal tool to compare the expressive power of different concurrent constraint languages by defining a preorder among these languages, representing different degrees of expressiveness, and shows that this preorder is not trivial.
View via Publisher
Quantitative Notions of Leakage for One-try Attacks
View via Publisher
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License