Members
Overall Objectives
Research Program
Application Domains
Software and Platforms
New Results
Partnerships and Cooperations
Dissemination
Bibliography
XML PDF e-pub
PDF e-Pub


Bibliography

Major publications by the team in recent years
[1]
M. Alvim, M. Andrés, K. Chatzikokolakis, C. Palamidessi.
On the relation between Differential Privacy and Quantitative Information Flow, in: 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), Zurich, Switzerland, J. S. Luca Aceto (editor), Lecture Notes in Computer Science, Springer, 2011, vol. 6756, pp. 60-76. [ DOI : 10.1007/978-3-642-22012-8_4 ]
http://hal.inria.fr/inria-00627937/en
[2]
M. Alvim, K. Chatzikokolakis, C. Palamidessi, G. Smith.
Measuring Information Leakage using Generalized Gain Functions, in: Computer Security Foundations, Cambridge MA, United States, IEEE, 2012, pp. 265-279. [ DOI : 10.1109/CSF.2012.26 ]
http://hal.inria.fr/hal-00734044
[3]
M. Andrés, N. Bordenabe, K. Chatzikokolakis, C. Palamidessi.
Geo-Indistinguishability: Differential Privacy for Location-Based Systems, in: 20th ACM Conference on Computer and Communications Security, Berlin, Allemagne, ACM Press, 2013, pp. 901-914, DGA, Inria large scale initiative CAPPRIS. [ DOI : 10.1145/2508859.2516735 ]
http://hal.inria.fr/hal-00766821
[4]
K. Chatzikokolakis, M. Andrés, N. Bordenabe, C. Palamidessi.
Broadening the Scope of Differential Privacy Using Metrics, in: The 13th Privacy Enhancing Technologies Symposium, Bloomington, Indiana, États-Unis, E. De Cristofaro, M. Wright (editors), Springer, 2013, vol. 7981, pp. 82-102, DGA, Inria large scale initiative CAPPRIS. [ DOI : 10.1007/978-3-642-39077-7 ]
http://hal.inria.fr/hal-00767210
[5]
K. Chatzikokolakis, C. Palamidessi.
Making Random Choices Invisible to the Scheduler, in: Information and Computation, 2010, vol. 208, no 6, pp. 694-715. [ DOI : 10.1016/j.ic.2009.06.006 ]
http://hal.inria.fr/inria-00424860/en
[6]
K. Chatzikokolakis, C. Palamidessi, P. Panangaden.
Anonymity Protocols as Noisy Channels, in: Information and Computation, 2008, vol. 206, no 2–4, pp. 378–401. [ DOI : 10.1016/j.ic.2007.07.003 ]
http://hal.inria.fr/inria-00349225/en/
[7]
K. Chatzikokolakis, C. Palamidessi, P. Panangaden.
On the Bayes risk in information-hiding protocols, in: Journal of Computer Security, 2008, vol. 16, no 5, pp. 531–571. [ DOI : 10.3233/JCS-2008-0333 ]
http://hal.inria.fr/inria-00349224/en/
[8]
P. Giambiagi, G. Schneider, F. D. Valencia.
On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi, in: Proceedings of FoSSaCS, Lecture Notes in Computer Science, Springer, 2004, vol. 2987, pp. 226-240.
http://www.lix.polytechnique.fr/~fvalenci/papers/fossacs04.pdf
[9]
S. Knight, C. Palamidessi, P. Panangaden, F. D. Valencia.
Spatial and Epistemic Modalities in Constraint-Based Process Calculi, in: CONCUR 2012 - Concurrency Theory - 23rd International Conference, CONCUR 2012, Newcastle upon Tyne, United Kingdom, September 2012, vol. 7454, pp. 317-332. [ DOI : 10.1007/978-3-642-32940-1 ]
http://hal.inria.fr/hal-00761116
[10]
C. Palamidessi, V. A. Saraswat, F. D. Valencia, B. Victor.
On the Expressiveness of Linearity vs Persistence in the Asynchronous pi-calculus, in: Proceedings of the Twenty First Annual IEEE Symposium on Logic in Computer Science (LICS), IEEE Computer Society, 2006, pp. 59–68.
http://hal.inria.fr/inria-00201096/en/
Publications of the year

Doctoral Dissertations and Habilitation Theses

[11]
I. Gazeau.
Programmation sûre en précision finie : Contrôler les erreurs et les fuites d'informations, Ecole Polytechnique X, October 2013.
http://hal.inria.fr/pastel-00913469
[12]
S. Knight.
Le point de vue epistémique de théorie de la concurrence, Ecole Polytechnique X, September 2013.
http://hal.inria.fr/tel-00940413

Articles in International Peer-Reviewed Journals

[13]
M. Alvim, M. Andrés, K. Chatzikokolakis, P. Degano, C. Palamidessi.
On the information leakage of differentially-private mechanisms, in: Journal of Computer Security, 2014, to appear.
http://hal.inria.fr/hal-00940425
[14]
K. Chatzikokolakis, C. Palamidessi, C. Braun.
Compositional Methods for Information-Hiding, in: Mathematical Structures in Computer Science, 2014, to appear.
http://hal.inria.fr/hal-00760596
[15]
M. Falaschi, C. Olarte, C. Palamidessi.
Abstract Interpretation of Temporal Concurrent Constraint Programs, in: Theory and Practice of Logic Programming, 2014.
http://hal.inria.fr/hal-00945462
[16]
S. Hamadou, V. Sassone, M. Yang.
An analysis of trust in anonymity networks in the presence of adaptive attackers, in: Mathematical Structures in Computer Science, 2013, to appear.
http://hal.inria.fr/hal-00760437
[17]
C. Olarte, C. Rueda, F. D. Valencia.
Models and Emerging Trends of Concurrent Constraint Programming, in: Constraints, October 2013, vol. 18, no 4, pp. 535-578. [ DOI : 10.1007/s10601-013-9145-3 ]
http://hal.inria.fr/hal-00869192

Invited Conferences

[18]
C. Palamidessi.
Quantitative Approaches to Information Protection, in: WOLLIC, Darmstadt, Germany, L. Libkin (editor), 2013.
http://hal.inria.fr/hal-00945678

International Conferences with Proceedings

[19]
M. Andrés, N. Bordenabe, K. Chatzikokolakis, C. Palamidessi.
Geo-Indistinguishability: Differential Privacy for Location-Based Systems, in: 20th ACM Conference on Computer and Communications Security, Berlin, Germany, ACM Press, 2013, pp. 901-914. [ DOI : 10.1145/2508859.2516735 ]
http://hal.inria.fr/hal-00766821
[20]
M. Brusó, K. Chatzikokolakis, S. Etalle, J. Den Hartog.
Linking Unlinkability, in: 7th International Symposium on Trustworthy Global Computing (TGC), Newcastle upon Tyne, United Kingdom, M. R. Catuscia Palamidessi (editor), Springer, 2013, vol. 8191, pp. 129-144. [ DOI : 10.1007/978-3-642-41157-1 ]
http://hal.inria.fr/hal-00760150
[21]
K. Chatzikokolakis, M. Andrés, N. Bordenabe, C. Palamidessi.
Broadening the Scope of Differential Privacy Using Metrics, in: The 13th Privacy Enhancing Technologies Symposium, Bloomington, Indiana, United States, E. De Cristofaro, M. Wright (editors), Springer, 2013, vol. 7981, pp. 82-102. [ DOI : 10.1007/978-3-642-39077-7 ]
http://hal.inria.fr/hal-00767210
[22]
E. Elsalamouny, K. Chatzikokolakis, C. Palamidessi.
A differentially private mechanism of optimal utility for a region of priors, in: POST-2nd Conference on Principles of Security and Trust, Rome, Italy, Springer Berlin Heidelberg, 2013, vol. 7796, pp. 41-62. [ DOI : 10.1007/978-3-642-36830-1_3 ]
http://hal.inria.fr/hal-00760735
[23]
I. Gazeau, D. Miller, C. Palamidessi.
Preserving differential privacy under finite-precision semantics, in: QAPL - 11th International Workshop on Quantitative Aspects of Programming Languages and Systems, Rome, Italy, L. Bortolussi, H. Wiklicky (editors), Electronic Proceedings in Theoretical Computer Science, Open Publishing Association, 2013, vol. 117, pp. 1-18. [ DOI : 10.4204/EPTCS.117.1 ]
http://hal.inria.fr/hal-00780774
[24]
M. Mio, A. Simpson.
A Proof System for Compositional Verification of Probabilistic Concurrent Processes, in: FoSSaCS, Rome, Italy, F. Pfenning (editor), March 2013, 15 p.
http://hal.inria.fr/hal-00766384
[25]
L. Pino, F. Bonchi, F. D. Valencia.
Efficient computation of program equivalence for confluent concurrent constraint programming, in: 15th International Symposium on Principles and Practice of Declarative Programming, PPDP '13, Madrid, Spain, September 16-18, 2013, France, 2013, pp. 263-274.
http://hal.inria.fr/hal-00909394
[26]
L. Xu.
Modular Reasoning about Differential Privacy in a Probabilistic Process Calculus, in: 7th International Symposium on Trustworthy Global Computing (TGC), Newcastle upon Tyne, United Kingdom, M. R. Catuscia Palamidessi (editor), Springer, 2013, vol. 8191, pp. 198-212.
http://hal.inria.fr/hal-00691284

Books or Proceedings Editing

[27]
C. Palamidessi, M. D. Ryan (editors)
Proceedings of the 7th International Symposium on Trustworthy Global Computing (TGC), Lecture Notes in Computer Science, Springer, 2013, vol. 8191, pp. 1-212. [ DOI : 10.1007/978-3-642-41157-1 ]
http://hal.inria.fr/hal-00778538

Internal Reports

[28]
L. Xu, K. Chatzikokolakis, H. Lin, C. Palamidessi.
Metrics for Differential Privacy in Concurrent Systems, October 2013.
http://hal.inria.fr/hal-00879140
References in notes
[29]
K. Chatzikokolakis, C. Palamidessi, P. Panangaden.
Anonymity Protocols as Noisy Channels, in: Inf. and Comp., 2008, vol. 206, no 2–4, pp. 378–401. [ DOI : 10.1016/j.ic.2007.07.003 ]
http://hal.inria.fr/inria-00349225/en/
[30]
K. Chatzikokolakis, C. Palamidessi, P. Panangaden.
On the Bayes risk in information-hiding protocols, in: Journal of Computer Security, 2008, vol. 16, no 5, pp. 531–571. [ DOI : 10.3233/JCS-2008-0333 ]
http://hal.inria.fr/inria-00349224/en/
[31]
G. Norman, C. Palamidessi, D. Parker, P. Wu.
Model checking probabilistic and stochastic extensions of the π-calculus, in: IEEE Transactions of Software Engineering, 2009, vol. 35, no 2, pp. 209–223.
http://hal.archives-ouvertes.fr/inria-00424856/en/
[32]
P. Wu, C. Palamidessi, H. Lin.
Symbolic Bisimulation for Probabilistic Systems, in: Proceedings of 4th International Conference on the Quantitative Evaluation of SysTems (QEST), IEEE Computer Society, 2007, pp. 179-188.
http://www.lix.polytechnique.fr/~catuscia/papers/Wu/qest2.pdf