People

Papers & Software

Seminar

Stages



INRIA

LIX

CNRS
Papers

Papers (co-)authored by Konstantinos Chatzikokolakis

[1] Ehab Elsalamouny, Konstantinos Chatzikokolakis, and Catuscia Palamidessi. A differentially private mechanism of optimal utility for a region of priors. This paper is to appear in the proceedings of POST 2013 (Principles of Security and Trust)., 2013.
[ bib | http ]
[2] Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Christelle Braun. Compositional Methods for Information-Hiding. Mathematical Structures in Computer Science, 2013. To appear.
[ bib | http ]
[3] Konstantinos Chatzikokolakis, Sophia Knight, Catuscia Palamidessi, and Prakash Panangaden. Epistemic Strategies and Games on Concurrent Processes. Transactions on Computational Logic, 13(4):28:1-28:35, October 2012.
[ bib | http ]
[4] Mayla Brusó, Konstantinos Chatzikokolakis, Sandro Etalle, and Jerry Den Hartog. Linking Unlinkability. In 7th International Symposium on Trustworthy Global Computing (TGC), Newcastle upon Tyne, United Kingdom, 2012. To appear.
[ bib | http ]
[5] Miguel Andres, E., Nicolas E. Bordenabe, Konstantinos Chatzikokolakis, and Catuscia Palamidessi. Geo-Indistinguishability: Differential Privacy for Location-Based Systems. Technical report, 2012.
[ bib | http ]
[6] Konstantinos Chatzikokolakis, Miguel Andres, E., Nicolas E. Bordenabe, and Catuscia Palamidessi. Enhancing Differential Privacy: from Hamming to General Metrics. Technical report, 2012.
[ bib | http ]
[7] Mario Alvim, S., Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Geoffrey Smith. Measuring Information Leakage using Generalized Gain Functions. In Proceedings of Computer Security Foundations (CSF), pages 265-279, Cambridge MA, United States, 2012. IEEE.
[ bib | http ]
[8] Mário Alvim, S., Miguel Andres, E., Konstantinos Chatzikokolakis, Pierpaolo Degano, and Catuscia Palamidessi. Differential Privacy: on the trade-off between Utility and Information Leakage. In Gilles Barthe, Anupam Datta, and Sandro Etalle, editors, The 8th International Workshop on Formal Aspects of Security & Trust (FAST), Lecture Notes in Computer Science, Leuven, Belgium, March 2011. Springer.
[ bib | http ]
[9] Mário Alvim, S., Miguel Andres, E., Konstantinos Chatzikokolakis, and Catuscia Palamidessi. On the relation between Differential Privacy and Quantitative Information Flow. In Jiri Sgall Luca Aceto, Monika Henzinger, editor, 38th International Colloquium on Automata, Languages and Programming - ICALP 2011, volume 6756 of Lecture Notes in Computer Science, pages 60-76, Zurich, Switzerland, 2011. Springer.
[ bib | http ]
[10] Mário Alvim, Miguel Andres, E., Konstantinos Chatzikokolakis, and Catuscia Palamidessi. Quantitative Information Flow and Applications to Differential Privacy. In Alessandro Aldini and Roberto Gorrieri, editors, Foundations of Security Analysis and Design VI - FOSAD Tutorial Lectures, volume 6858 of Lecture Notes in Computer Science, pages 211-230. Springer, 2011.
[ bib | http ]
[11] Konstantinos Chatzikokolakis and Véronique Cortier, editors. Proceedings of the 8th International Workshop on Security Issues in Concurrency, volume 51 of Electronic Proceedings in Theoretical Computer Science. Electronic Proceedings in Theoretical Computer Science, 2011.
[ bib | http ]
[12] Konstantinos Chatzikokolakis and Catuscia Palamidessi. Making random choices invisible to the scheduler. Information and Computation, 208(6):694-715, 2010.
[ bib | http ]
[13] Mário S. Alvim, Konstantinos Chatzikokolakis, Pierpaolo Degano, and Catuscia Palamidessi. Differential privacy versus quantitative information flow. Technical report, INRIA, 2010.
[ bib | http ]
[14] Christelle Braun, Konstantinos Chatzikokolakis, and Catuscia Palamidessi. Quantitative notions of leakage for one-try attacks. In Proceedings of the 25th Conf. on Mathematical Foundations of Programming Semantics, volume 249 of Electronic Notes in Theoretical Computer Science, pages 75-91. Elsevier B.V., 2009.
[ bib | http ]
[15] Christelle Braun, Konstantinos Chatzikokolakis, and Catuscia Palamidessi. Compositional methods for information-hiding. In Roberto Amadio, editor, Proceedings of FOSSACS, volume 4962 of Lecture Notes in Computer Science, pages 443-457. Springer, 2008.
[ bib | http | .pdf ]
[16] Romain Beauxis, Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Prakash Panangaden. Formal approaches to information-hiding (tutorial). In Gilles Barthe and Cédric Fournet, editors, Proceedings of the Third Symposium on Trustworthy Global Computing (TGC 2007), volume 4912 of Lecture Notes in Computer Science, pages 347-362. Springer, 2008.
[ bib | http | .pdf ]
[17] Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Prakash Panangaden. On the bayes risk in information-hiding protocols. Journal of Computer Security, 16(5):531-571, 2008.
[ bib | http | .pdf ]
[18] Konstantinos Chatzikokolakis and Keye Martin. A monotonicity principle for information theory. In Andrej Bauer and Michael Mislove, editors, Proceedings of the Twenty-fourth Conference on the Mathematical Foundations of Programming Semantics, volume 218 of Electronic Notes in Theoretical Computer Science, pages 111-129. Elsevier B.V., 2008.
[ bib ]
[19] Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Prakash Panangaden. Anonymity protocols as noisy channels. Inf. and Comp., 206(2-4):378-401, 2008.
[ bib | http ]
[20] Konstantinos Chatzikokolakis. Probabilistic and Information-Theoretic Approaches to Anonymity. PhD thesis, LIX, École Polytechnique, October 2007. www.lix.polytechnique.fr/~kostas/thesis.pdf.
[ bib ]
[21] Konstantinos Chatzikokolakis and Catuscia Palamidessi. Making random choices invisible to the scheduler. In Luís Caires and Vasco Thudichum Vasconcelos, editors, Proceedings of CONCUR'07, volume 4703 of Lecture Notes in Computer Science, pages 42-58. Springer, 2007. http://www.lix.polytechnique.fr/~catuscia/papers/Scheduler/report.pdf.
[ bib ]
[22] Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Prakash Panangaden. Probability of error in information-hiding protocols. In Proceedings of the 20th IEEE Computer Security Foundations Symposium (CSF20), pages 341-354. IEEE Computer Society, 2007.
[ bib ]
[23] Konstantinos Chatzikokolakis and Catuscia Palamidessi. A framework for analyzing probabilistic protocols and its application to the partial secrets exchange. Theoretical Computer Science, 389(3):512-527, 2007. A short version of this paper appeared in the Proceedings of the Symposium on Trustworthy Global Computing (TGC), volume 3705 of LNCS, pages 146-162. Springer. http://www.lix.polytechnique.fr/~catuscia/papers/PartialSecrets/TCSreport.pdf.
[ bib ]
[24] Konstantinos Chatzikokolakis, Catuscia Palamidessi, and Prakash Panangaden. Anonymity protocols as noisy channels. In Proceedings of the 2nd Symposium on Trustworthy Global Computing (TGC), volume 4661 of Lecture Notes in Computer Science, pages 281-300. Springer, 2006. http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/Channels/tgc.pdf.
[ bib ]
[25] Konstantinos Chatzikokolakis and Catuscia Palamidessi. Probable innocence revisited. Theoretical Computer Science, 367(1-2):123-138, 2006. http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/tcsPI.pdf.
[ bib | http ]
[26] Konstantinos Chatzikokolakis and Catuscia Palamidessi. Probable innocence revisited. In Theodosis Dimitrakos, Fabio Martinelli, Peter Y. A. Ryan, and Steve A. Schneider, editors, Third International Workshop on Formal Aspects in Security and Trust (FAST 2005), Revised Selected Papers, volume 3866 of Lecture Notes in Computer Science, pages 142-157. Springer, 2006.
[ bib | .pdf ]
[27] Konstantinos Chatzikokolakis and Catuscia Palamidessi. A framework for analyzing probabilistic protocols and its application to the partial secrets exchange. In Proceedings of the Symp. on Trustworthy Global Computing, volume 3705 of Lecture Notes in Computer Science, pages 146-162. Springer, 2005. http://www.lix.polytechnique.fr/~catuscia/papers/PartialSecrets/tgc05.pdf.
[ bib ]
[28] Tom Chothia and Konstantinos Chatzikokolakis. A survey of anonymous peer-to-peer file-sharing. In Proceedings of the IFIP International Symposium on Network-Centric Ubiquitous Systems (NCUS 2005), volume 3823 of Lecture Notes in Computer Science, pages 744-755. Springer, 2005.
[ bib ]
[29] Konstantinos Chatzikokolakis and Catuscia Palamidessi. Probable innocence revisited. Technical report, INRIA Futurs and LIX, 2005. http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/reportPI.pdf.
[ bib ]

This file has been generated by bibtex2html 1.74


Back


Page maintainer: Catuscia Palamidessi