| Publication | Date of Publication | Type |
|---|
| Optimal bounds for parity-oblivious random access codes | 2021-03-12 | Paper |
| Streaming communication protocols | 2020-05-27 | Paper |
| Multi-Party Protocols, Information Complexity and Privacy | 2019-12-16 | Paper |
| Streaming Communication Protocols | 2019-12-16 | Paper |
| Relative discrepancy does not separate information and communication complexity | 2019-12-06 | Paper |
| Quantum recommendation systems | 2018-05-03 | Paper |
| Multi-party protocols, information complexity and privacy | 2018-03-21 | Paper |
| Pointer Quantum PCPs and Multi-Prover Games | 2018-03-21 | Paper |
| Physical Limitations of Quantum Cryptographic Primitives or Optimal Bounds for Quantum Coin Flipping and Bit Commitment | 2017-11-22 | Paper |
| New constructions for quantum money | 2017-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2969050 | 2017-03-13 | Paper |
| QMA with subset state witnesses | 2016-05-24 | Paper |
| A simpler proof of the existence of quantum weak coin flipping with arbitrarily small bias | 2016-05-12 | Paper |
| Quantum commitments from complexity assumptions | 2016-03-21 | Paper |
| Communication complexity of conditional disclosure of secrets and attribute-based encryption | 2015-12-10 | Paper |
| A quantum protocol for sampling correlated equilibria unconditionally and without a mediator | 2015-12-03 | Paper |
| Weak coin flipping in a device-independent setting | 2015-11-20 | Paper |
| Lower bounds on information complexity via zero-communication protocols and applications | 2015-11-04 | Paper |
| Relative discrepancy does not separate information and communication complexity | 2015-10-27 | Paper |
| New Lower Bounds for Privacy in Communication Protocols | 2015-09-30 | Paper |
| QMA with subset state witnesses | 2015-09-16 | Paper |
| Optimal Bounds for Quantum Bit Commitment | 2014-07-30 | Paper |
| Optimal Quantum Strong Coin Flipping | 2014-07-25 | Paper |
| Non-local box complexity and secure function evaluation | 2012-10-24 | Paper |
| Long distance quantum cryptography made simple | 2012-10-21 | Paper |
| Increasing the power of the verifier in quantum zero knowledge | 2012-10-19 | Paper |
| On the power of a unique quantum witness | 2012-09-27 | Paper |
| Lower bounds for quantum oblivious transfer | 2012-08-29 | Paper |
| Non-local box complexity and secure function evaluation | 2011-10-05 | Paper |
| Quantum commitments from complexity assumptions | 2011-07-06 | Paper |
| Exponential lower bound for 2-query locally decodable codes via a quantum argument | 2010-08-16 | Paper |
| Exponential separation of quantum and classical one-way communication complexity | 2010-08-15 | Paper |
| Competitive recommendation systems | 2010-08-05 | Paper |
| Introduction to quantum information theory | 2009-12-03 | Paper |
| Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography | 2009-11-06 | Paper |
| Quantum symmetrically-private information retrieval | 2009-07-21 | Paper |
| Weak coin flipping with small bias | 2009-07-09 | Paper |
| Quantum multiparty communication complexity and circuit lower bounds | 2009-03-24 | Paper |
| Exponential Separation of Quantum and Classical One-Way Communication Complexity | 2009-03-16 | Paper |
| Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model | 2008-03-05 | Paper |
| Quantum Multiparty Communication Complexity and Circuit Lower Bounds | 2007-11-13 | Paper |
| Statistical zero knowledge and quantum one-way functions | 2007-06-06 | Paper |
| On the optimality of quantum encryption schemes | 2007-05-16 | Paper |
| Exponential lower bound for 2-query locally decodable codes via a quantum argument | 2004-11-18 | Paper |
