☰

Iordanis Kerenidis, Ph.D. - Publications

Affiliations: 
2004 University of California, Berkeley, Berkeley, CA, United States 
Area:
Security (SEC); Theory (THY), Complexity theory
Tree Info Similar researchers PubMed Report error

51 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2023 Neves S, Yacoub V, Chabaud U, Bozzio M, Kerenidis I, Diamanti E. Experimental cheat-sensitive quantum weak coin flipping. Nature Communications. 14: 1855. PMID 37012243 DOI: 10.1038/s41467-023-37566-x  0.525
2021 Centrone F, Kumar N, Diamanti E, Kerenidis I. Experimental demonstration of quantum advantage for NP verification with limited information. Nature Communications. 12: 850. PMID 33558480 DOI: 10.1038/s41467-021-21119-1  0.485
2020 Bozzio M, Chabaud U, Kerenidis I, Diamanti E. Quantum weak coin flipping with a single photon Physical Review A. 102. DOI: 10.1103/Physreva.102.022414  0.635
2020 Kerenidis I, Luongo A. Quantum classification of the MNIST dataset via Slow Feature Analysis Physical Review A. 101: 62327. DOI: 10.1103/Physreva.101.062327  0.612
2020 Kerenidis I, Prakash A. Quantum gradient descent for linear systems and least squares Physical Review A. 101: 22316. DOI: 10.1103/Physreva.101.022316  0.619
2019 Kumar N, Kerenidis I, Diamanti E. Experimental demonstration of quantum advantage for one-way communication complexity surpassing best-known classical protocol. Nature Communications. 10: 4152. PMID 31515513 DOI: 10.1038/S41467-019-12139-Z  0.652
2019 Unnikrishnan A, MacFarlane IJ, Yi R, Diamanti E, Markham D, Kerenidis I. Anonymity for Practical Quantum Networks. Physical Review Letters. 122: 240501. PMID 31322405 DOI: 10.1103/Physrevlett.122.240501  0.485
2019 Kerenidis I, Rosén A, Urrutia F. Multi-Party Protocols, Information Complexity and Privacy Acm Transactions On Computation Theory. 11: 1-29. DOI: 10.1145/3313230  0.377
2019 Grilo AB, Kerenidis I, Zijlstra T. Learning-with-errors problem is easy with quantum samples Physical Review A. 99: 32314. DOI: 10.1103/Physreva.99.032314  0.491
2018 Boczkowski L, Kerenidis I, Magniez F. Streaming Communication Protocols Acm Transactions On Computation Theory. 10: 19. DOI: 10.1145/3276748  0.326
2018 Pitalúa-García D, Kerenidis I. Practical and unconditionally secure spacetime-constrained oblivious transfer Physical Review A. 98: 32327. DOI: 10.1103/Physreva.98.032327  0.547
2018 Arrazola JM, Diamanti E, Kerenidis I. Quantum superiority for verifying NP-complete problems with linear optics Npj Quantum Information. 4: 1-8. DOI: 10.1038/S41534-018-0103-1  0.596
2018 Bozzio M, Orieux A, Vidarte LT, Zaquine I, Kerenidis I, Diamanti E. Experimental investigation of practical unforgeable quantum money Npj Quantum Information. 4: 1-8. DOI: 10.1038/S41534-018-0058-2  0.642
2017 Chailloux A, Kerenidis I. Physical Limitations of Quantum Cryptographic Primitives or Optimal Bounds for Quantum Coin Flipping and Bit Commitment Siam Journal On Computing. 46: 1647-1677. DOI: 10.1137/15M1010853  0.657
2016 McCutcheon W, Pappa A, Bell BA, McMillan A, Chailloux A, Lawson T, Mafu M, Markham D, Diamanti E, Kerenidis I, Rarity JG, Tame MS. Experimental verification of multipartite entanglement in quantum networks. Nature Communications. 7: 13251. PMID 27827361 DOI: 10.1038/Ncomms13251  0.592
2016 Aharonov D, Chailloux A, Ganz M, Kerenidis I, Magnin L. A simpler proof of existence of quantum weak coin flipping with arbitrarily small bias Siam Journal On Computing. 45: 633-679. DOI: 10.1137/14096387X  0.618
2016 Chailloux A, Kerenidis I, Kundu S, Sikora J. Optimal bounds for parity-oblivious random access codes New Journal of Physics. 18. DOI: 10.1088/1367-2630/18/4/045003  0.498
2016 Chailloux A, Kerenidis I, Rosgen B. Quantum commitments from complexity assumptions Computational Complexity. 25: 103-151. DOI: 10.1007/S00037-015-0116-5  0.605
2016 Kerenidis I, Laurière M, Le Gall F, Rennela M. Information cost of quantum communication protocols Quantum Information and Computation. 16: 181-196.  0.535
2015 Pappa A, Kumar N, Lawson T, Santha M, Zhang S, Diamanti E, Kerenidis I. Nonlocality and conflicting interest games. Physical Review Letters. 114: 020401. PMID 25635538 DOI: 10.1103/Physrevlett.114.020401  0.535
2015 Georgiou M, Kerenidis I. New constructions for quantum money Leibniz International Proceedings in Informatics, Lipics. 44: 92-110. DOI: 10.4230/LIPIcs.TQC.2015.92  0.488
2015 Fontes L, Jain R, Kerenidis I, Laplante S, Laurière M, Roland J. Relative discrepancy does not separate information and communication complexity Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9134: 506-516. DOI: 10.1145/2967605  0.346
2015 Kerenidis I, Laplante S, Lerays V, Roland J, Xiao D. Lower bounds on information complexity via zero-communication protocols and applications Siam Journal On Computing. 44: 1550-1572. DOI: 10.1137/130928273  0.365
2015 Grilo AB, Kerenidis I, Sikora J. QMA with subset state witnesses Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9235: 163-174. DOI: 10.1007/978-3-662-48054-0_14  0.465
2014 Pappa A, Jouguet P, Lawson T, Chailloux A, Legré M, Trinkler P, Kerenidis I, Diamanti E. Experimental plug and play quantum coin flipping. Nature Communications. 5: 3717. PMID 24758868 DOI: 10.1038/Ncomms4717  0.648
2014 Chailloux A, Kerenidis I, Kundu S, Sikora J. Optimal bounds for parity-oblivious random access codes with applications Leibniz International Proceedings in Informatics, Lipics. 27: 76-87. DOI: 10.4230/LIPIcs.TQC.2014.76  0.421
2014 Lawson T, Pappa A, Bourdoncle B, Kerenidis I, Markham D, Diamanti E. Reliable experimental quantification of bipartite entanglement without reference frames Physical Review a - Atomic, Molecular, and Optical Physics. 90. DOI: 10.1103/Physreva.90.042336  0.502
2014 Sikora J, Chailloux A, Kerenidis I. Strong connections between quantum encodings, nonlocality, and quantum cryptography Physical Review a - Atomic, Molecular, and Optical Physics. 89. DOI: 10.1103/Physreva.89.022334  0.642
2014 Kerenidis I, Laurière M, Xiao D. New lower bounds for privacy in communication protocols Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8317: 69-89. DOI: 10.1007/978-3-319-04268-8_5  0.326
2013 Chailloux A, Kerenidis I, Sikora J. Lower bounds for quantum oblivious transfer Quantum Information and Computation. 13: 0158-0177. DOI: 10.4230/LIPIcs.FSTTCS.2010.157  0.439
2013 Kerenidis I, Zhang S. A quantum protocol for sampling correlated equilibria unconditionally and without a mediator Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7582: 13-28. DOI: 10.1007/978-3-642-35656-8_2  0.425
2012 Pappa A, Chailloux A, Wehner S, Diamanti E, Kerenidis I. Multipartite entanglement verification resistant against dishonest parties. Physical Review Letters. 108: 260502. PMID 23004945 DOI: 10.1103/Physrevlett.108.260502  0.602
2012 Jain R, Kerenidis I, Kuperberg G, Santha M, Sattath O, Zhang S. On the Power of a Unique Quantum Witness Theory of Computing. 8: 375-400. DOI: 10.4086/Toc.2012.V008A017  0.555
2012 Kerenidis I, Wehner S. Long distance quantum cryptography made simple Quantum Information and Computation. 12: 448-460.  0.52
2011 Chailloux A, Kerenidis I. Optimal bounds for quantum bit commitment Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 354-362. DOI: 10.1109/FOCS.2011.42  0.606
2011 Silman J, Chailloux A, Aharon N, Kerenidis I, Pironio S, Massar S. Fully distrustful quantum bit commitment and coin flipping Physical Review Letters. 106. DOI: 10.1103/Physrevlett.106.220501  0.515
2011 Pappa A, Chailloux A, Diamanti E, Kerenidis I. Practical quantum coin flipping Physical Review a - Atomic, Molecular, and Optical Physics. 84. DOI: 10.1103/Physreva.84.052305  0.536
2009 Chailloux A, Kerenidis I. Optimal quantum strong coin flipping Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 527-533. DOI: 10.1109/FOCS.2009.71  0.602
2009 Kerenidis I. Quantum multiparty communication complexity and circuit lower bounds Mathematical Structures in Computer Science. 19: 119-132. DOI: 10.1017/S0960129508007263  0.505
2009 Kerenidis I. Introduction to quantum information theory Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4883: 146-147. DOI: 10.1007/978-3-642-10230-1_12  0.509
2008 Gavinsky D, Kempe J, Kerenidis I, Raz R, De Wolf R. Exponential separation for one-way quantum communication complexity, with applications to cryptography Siam Journal On Computing. 38: 1695-1708. DOI: 10.1137/070706550  0.642
2008 Ziv BY, Jayram TS, Kerenidis I. Exponential separation of quantum and classical one-way communication complexity Siam Journal On Computing. 38: 366-384. DOI: 10.1137/060651835  0.456
2008 Chailloux A, Ciocan DF, Kerenidis I, Vadhan S. Interactive and noninteractive zero knowledge are equivalent in the help model Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4948: 501-534. DOI: 10.1007/978-3-540-78524-8_28  0.363
2008 Chailloux A, Kerenidis I. Increasing the power of the verifier in quantum zero knowledge Leibniz International Proceedings in Informatics, Lipics. 2: 95-106.  0.515
2007 Gavinsky D, Kempe J, Kerenidis I, Raz R, De Wolf R. Exponential separations for one-way quantum communication complexity, with applications to cryptography Proceedings of the Annual Acm Symposium On Theory of Computing. 516-525. DOI: 10.1145/1250790.1250866  0.512
2007 Kashefi E, Kerenidis I. Statistical Zero Knowledge and quantum one-way functions Theoretical Computer Science. 378: 101-116. DOI: 10.1016/J.Tcs.2007.03.013  0.624
2006 Nagaj D, Kerenidis I. On the optimality of quantum encryption schemes Journal of Mathematical Physics. 47. DOI: 10.1063/1.2339014  0.491
2004 Bar-Yossef Z, Jayram TS, Kerenidis I. Exponential separation of quantum and classical one-way communication complexity Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 128-137. DOI: 10.1137/060651835  0.504
2004 Kerenidis I, De Wolf R. Exponential lower bound for 2-query locally decodable codes via a quantum argument Journal of Computer and System Sciences. 69: 395-420. DOI: 10.1016/J.Jcss.2004.04.007  0.582
2004 Kerenidis I, De Wolf R. Quantum symmetrically-private information retrieval Information Processing Letters. 90: 109-114. DOI: 10.1016/J.Ipl.2004.02.003  0.48
2004 Kerenidis I, Nayak A. Weak coin flipping with small bias Information Processing Letters. 89: 131-135. DOI: 10.1016/J.Ipl.  0.45
Show low-probability matches.