Kostas Chatzikokolakis

• K. Chatzikokolakis, C. Palamidessi, C. Braun. Compositional Methods for Information-Hiding. Mathematical Structures in Computer Science, to appear.
• K. Chatzikokolakis, S. Knight, C. Palamidessi, P. Panangaden. Epistemic Strategies and Games on Concurrent Processes. ACM Transactions on Computational Logic, to appear.
• K. Chatzikokolakis, C. Palamidessi. Making Random Choices Invisible to the Scheduler. Information and Computation, 208(6): 694-715, 2010. [pdf]
• K. Chatzikokolakis, C. Palamidessi, P. Panangaden. On the Bayes Risk in Information-Hiding Protocols. Journal of Computer Security, 16(5): 531-571, 2008. [pdf]
• K. Chatzikokolakis, C. Palamidessi, P. Panangaden. Anonymity Protocols as Noisy Channels. Information and Computation, 206: 378-401, 2008. [pdf]
• K. Chatzikokolakis, C. Palamidessi. Probable Innocence Revisited. Theoretical Computer Science, 367(1-2): 123-138, 2006. [pdf]
• K. Chatzikokolakis, C. Palamidessi. A Framework to Analyze Probabilistic Protocols and its Application to the Partial Secrets Exchange. Theoretical Computer Science, 389: 512-527, 2007. [pdf]

• M. Alvim, M. Andres, K. Chatzikokolakis, P. Degano and Catuscia Palamidessi. Differential Privacy: on the trade-off between Utility and Information Leakage Proceedings of FAST '11, to appear.
• M. Alvim, M. Andres, K. Chatzikokolakis and C. Palamidessi On the Relation between Differential Privacy and Quantitative Information Flow. Proceedings of ICALP '11, Springer, LNCS 6756, pp. 60-76, 2011.
• Mayla Bruso, K. Chatzikokolakis and J. den Hartog Formal verification of privacy for RFID systems. Proceedings of CSF '10, IEEE Computer Society Press, pp. 75-88, 2010. [report version]
• K. Chatzikokolakis, T. Chothia and A. Guha. Statistical Measurement of Information Leakage. Proceedings of TACAS '10, Springer, LNCS 6015, pp. 390-404, 2010.
• C. Braun, K. Chatzikokolakis and C. Palamidessi. Quantitative notions of leakage for one-try attacks. Proceedings of MFPS '09, volume 248 of ENTCS, Elsevier, pp. 75-91, 2009.
• K. Chatzikokolakis, Gethin Norman and David Parker. Bisimulation for demonic schedulers. Proceedings of FOSSACS '09, Springer, LNCS 5504, pp. 318-332, 2009. [report version]
• K. Chatzikokolakis, S. Knight and P. Panangaden. Epistemic Strategies and Games on Concurrent Processes. Proceedings of SOFSEM '09, Springer, LNCS 5404, pp. 153-166, 2009. [report version]
• K. Chatzikokolakis and Keye Martin. A Monotonicity Principle for Information Theory. Proceedings of MFPS '08, volume 218 of ENTCS, Elsevier, pp. 111-129, 2008. [report version]
• C. Braun, K. Chatzikokolakis and C. Palamidessi. Compositional Methods for Information-Hiding. Proceedings of FOSSACS '08, Springer, LNCS 4962, pp. 443-457, 2008. [report version]
• K. Chatzikokolakis, C. Palamidessi. Making Random Choices Invisible to the Scheduler. Proceedings of CONCUR '07, Springer, LNCS 4703, pp. 42-58, 2007. [report version]
• K. Chatzikokolakis, C. Palamidessi, P. Panangaden. Probability of Error in Information-Hiding Protocols. Proceedings of the 20th IEEE Computer Security Foundations Symposium (CSF20), IEEE Computer Society Press, pp. 341-354, 2007. [report version]
• K. Chatzikokolakis, C. Palamidessi, P. Panangaden. Anonymity Protocols as Noisy Channels. Proceedings of the 2nd Symposium on Trustworthy Global Computing (TGC 06), Springer, LNCS 4661, pp. 281-300, 2006. [pdf]
• T. Chothia, K. Chatzikokolakis, A Survey of Anonymous Peer-to-Peer File-Sharing, Proceedings of the IFIP International Symposium on Network-Centric Ubiquitous Systems (NCUS 2005), Springer, LNCS 3823, pp. 744-755, 2005. [pdf]
• K. Chatzikokolakis, C. Palamidessi. Probable Innocence Revisited. Proceedings of the Workshop on Formal Aspects in Security and Trust (FAST 2005), Springer, LNCS 3866, pp. 142-157, 2005. [pdf]
• K. Chatzikokolakis, C. Palamidessi. A Framework to Analyze Probabilistic Protocols and its Application to the Partial Secrets Exchange. Proceedings of the Symposium on Trustworthy Global Computing (TGC 05), Springer, LNCS 3705, pp. 146-162, 2005. [pdf]

• K. Chatzikokolakis, G. Boukeas, P. Stamatopoulos. Construction and Repair: A Hybrid Approach to Search in CSPs. Proceedings of the 3rd Hellenic Conference on Artificial Intelligence (SETN 2004), Springer, LNAI 3025, pp. 342-351, 2004. [pdf]

• M. Arapinis, K. Chatzikokolakis, Shocking news: NP is no harder than P. In progress