Please contact system administrator

Preprints

Publications

  • Andre Chailloux, I. Kerenidis, S.Kundu, Jamie William Jonathon Sikora. (2016). Optimal bounds for parity-oblivious random access codes. New J. Phys. 045003
  • Alex B. Grilo, I. Kerenidis, Jamie William Jonathon Sikora. (2016). QMA with subset state witnesses. CJTCS
  • Alex B. Grilo, I. Kerenidis, A. Pereszlenyi. (2016). Pointer Quantum PCPs and Multi-Prover Games. International Symposium MFCS
  • I. Kerenidis, Sophie Laplante, Virginie Lerays, Jeremie Roland, David Xiao. (2015). Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications. SIAM Journal of Computing 44
  • Lila Fontes, R. Jain, I. Kerenidis, Sophie Laplante, Mathieu Laurier, Jérémie Roland. (2015). Relative discrepancy does not separate information and communication complexity. Proceedings of ICALP
  • Anna Pappa, Niraj Kumar, Thomas Lawson, M. Santha, S. Zhang, Eleni Diamanti, I. Kerenidis. (2015). Nonlocality and conflicting interest games. Phys. Rev. Lett. 020401
  • Andre Chailloux, I. Kerenidis, Jamie William Jonathon Sikora. (2014). Strong connections between quantum encodings, nonlocality, and cryptography. Phys. Rev. A 89 022334
  • Anna Pappa, André Chailloux, S. Wehner, Eleni Diamanti, I. Kerenidis. (2012). Multipartite Entanglement Verification Resistant against Dishonest Parties. Phys. Rev. Lett. 108 260502
  • R. Jain, I. Kerenidis, Greg Kuperberg, M. Santha, Or Sattah, S. Zhang, Name of non-CQT author. (2012). On the power of a unique quantum witness. Theory of Computing 8 375-400
  • I. Kerenidis, S. Wehner. (2012). Long distance two-party quantum cryptography made simple. Quantum Information Processing 12 0448-0460
  • Anna Pappa, Andre Chailloux, Eleni Diamanti, I. Kerenidis. (2011). Practical Quantum Coin Flipping. Phys. Rev. A 84 052305
  • J. Silman, A. Chailloux, N. Aharon, I. Kerenidis, S. Pironio, S. Massar. (2011). Fully Distrustful Quantum Cryptography. Phys. Rev. Lett. 106 220501
  • Andre Chailloux, I. Kerenidis. (2011). Optimal bounds for quantum bit commitment. Proc. IEEE FOCS
  • Andre Chailloux, I. Kerenidis, B. Rosgen. (2011). Quantum Commitments from Complexity Assumptions. Proceedings of ICALP 73-85
  • Marc Kaplan, I. Kerenidis, Sophie Laplante, Jeremie Roland. (2010). Non-Local Box Complexity and Secure Function Evaluation. Quantum Information and Computation 11 40-69
  • Andre Chailloux, I. Kerenidis, Jamie Sikora. (2010). Lower Bounds for Quantum Oblivious Transfer. Proceedings of FSTTCS
  • Andre Chailloux, I. Kerenidis. (2009). Optimal quantum strong coin flipping. Proc. IEEE FOCS