| Publication | Date of Publication | Type |
|---|
Practical relativistic zero-knowledge for NP
| 2023-11-02 | Paper |
Key establishment à la Merkle in a quantum world
Journal of Cryptology | 2019-08-13 | Paper |
Secure certification of mixed quantum states with application to two-party randomness generation
| 2018-12-06 | Paper |
Provably secure key establishment against quantum adversaries
| 2018-05-03 | Paper |
Quantum authentication and encryption with key recycling. Or: how to re-use a one-time pad even if \(\mathsf{P}= \mathsf{NP}\) -- safely \& feasibly
Lecture Notes in Computer Science | 2017-06-23 | Paper |
Adaptive versus non-adaptive strategies in the quantum setting with applications
Advances in Cryptology – CRYPTO 2016 | 2016-11-09 | Paper |
How to re-use a one-time pad safely and almost optimally even if \(\mathrm P=\mathrm{NP}\)
Natural Computing | 2016-04-15 | Paper |
Quantifying the leakage of quantum protocols for classical two-party cryptography
| 2015-10-09 | Paper |
Superposition attacks on cryptographic protocols
Lecture Notes in Computer Science | 2015-09-30 | Paper |
Quantifying the leakage of quantum protocols for classical two-party cryptography
International Journal of Quantum Information | 2015-02-24 | Paper |
Secure identification and QKD in the bounded-quantum-storage model
Theoretical Computer Science | 2014-12-02 | Paper |
Actively secure two-party evaluation of any quantum operation
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Two provers in isolation
Lecture Notes in Computer Science | 2011-12-02 | Paper |
Merkle puzzles in a quantum world
Advances in Cryptology – CRYPTO 2011 | 2011-08-12 | Paper |
Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
Advances in Cryptology – CRYPTO 2010 | 2010-08-24 | Paper |
On the power of two-party quantum cryptography
Advances in Cryptology – ASIACRYPT 2009 | 2009-12-15 | Paper |
Improving the Security of Quantum Protocols via Commit-and-Open
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2009-05-14 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2009-05-14 | Paper |
A Tight High-Order Entropic Quantum Uncertainty Relation with Applications
Advances in Cryptology - CRYPTO 2007 | 2009-03-10 | Paper |
Secure Identification and QKD in the Bounded-Quantum-Storage Model
Advances in Cryptology - CRYPTO 2007 | 2009-03-10 | Paper |
Cryptography in the Bounded-Quantum-Storage Model
SIAM Journal on Computing | 2008-12-22 | Paper |
A Quantum Cipher with Near Optimal Key-Recycling
Advances in Cryptology – CRYPTO 2005 | 2008-03-17 | Paper |
Advances in Cryptology - EUROCRYPT 2004
Lecture Notes in Computer Science | 2007-09-25 | Paper |
Oblivious Transfer and Linear Functions
Lecture Notes in Computer Science | 2007-09-04 | Paper |
Experimental quantum cryptography.
Journal of Cryptology | 2007-08-14 | Paper |
BLIND QUANTUM COMPUTATION
International Journal of Quantum Information | 2007-03-21 | Paper |
Perfectly concealing quantum bit commitment from any quantum one-way permutation
| 2006-03-01 | Paper |
Advances in Cryptology – CRYPTO 2004
Lecture Notes in Computer Science | 2005-08-23 | Paper |
scientific article; zbMATH DE number 1722671 (Why is no real title available?)
| 2002-03-21 | Paper |
scientific article; zbMATH DE number 1676638 (Why is no real title available?)
| 2001-11-25 | Paper |
On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
Advances in Cryptology — EUROCRYPT ’99 | 2000-03-13 | Paper |
scientific article; zbMATH DE number 1304191 (Why is no real title available?)
| 2000-03-07 | Paper |
scientific article; zbMATH DE number 1394316 (Why is no real title available?)
| 2000-02-01 | Paper |
scientific article; zbMATH DE number 1283995 (Why is no real title available?)
| 1999-10-20 | Paper |
scientific article; zbMATH DE number 1302858 (Why is no real title available?)
| 1999-10-06 | Paper |
scientific article; zbMATH DE number 883897 (Why is no real title available?)
| 1996-06-02 | Paper |
Solving the maximum clique problem using a tabu search approach
Annals of Operations Research | 1993-08-16 | Paper |
