22 search results - page 1 / 5 » An Inductive Approach to Provable Anonymity |
ARESEC
2011
12 years 4 months ago
2011
—We formalise in a theorem prover the notion of provable anonymity proposed by Garcia et al. Our formalization relies on inductive definitions of message distinguish ability and...
CCS
2005
ACM
13 years 10 months ago
2005
ACM
This paper provides a formal framework for the analysis of information hiding properties of anonymous communication protocols in terms of epistemic logic. The key ingredient is ou...
CCS
2007
ACM
13 years 10 months ago
2007
ACM
Anonymity is increasingly important for network applications concerning about censorship and privacy. The existing anonymous communication protocols generally stem from mixnet and...
JLP
2007
13 years 4 months ago
2007
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
ICDE
2009
IEEE
14 years 6 months ago
2009
IEEE
Abstract-- Privacy protection is a major concern when microdata needs to be released for ad hoc analyses. This has led to a lot of recent research in privacy goals and table anonym...