| Publication | Date of Publication | Type |
|---|
Classical and Quantum 3 and 4-Sieves to Solve SVP with Low Memory
| 2024-04-26 | Paper |
On the (in)security of optimized Stern-like signature schemes
Designs, Codes and Cryptography | 2024-04-03 | Paper |
Finding many collisions via reusable quantum walks. Application to lattice sieving
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-08 | Paper |
Lattice Sieving via Quantum Random Walks
Lecture Notes in Computer Science | 2023-05-26 | Paper |
QCB: efficient quantum-secure authenticated encryption
Lecture Notes in Computer Science | 2023-05-12 | Paper |
scientific article; zbMATH DE number 7559062 (Why is no real title available?)
| 2022-07-18 | Paper |
Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric
| 2022-03-22 | Paper |
Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures
| 2021-12-01 | Paper |
Optimal bounds for parity-oblivious random access codes
New Journal of Physics | 2021-03-12 | Paper |
Ternary Syndrome Decoding with large weight
| 2020-07-21 | Paper |
An efficient quantum collision search algorithm and implications on symmetric cryptography
| 2018-03-08 | Paper |
Physical Limitations of Quantum Cryptographic Primitives or Optimal Bounds for Quantum Coin Flipping and Bit Commitment
SIAM Journal on Computing | 2017-11-22 | Paper |
Relativistic (or 2-prover 1-round) zero-knowledge protocol for \(\mathsf {NP}\) secure against quantum adversaries
Lecture Notes in Computer Science | 2017-06-23 | Paper |
scientific article; zbMATH DE number 6694244 (Why is no real title available?)
| 2017-03-13 | Paper |
Graph-theoretical bounds on the entangled value of non-local games
| 2017-03-13 | Paper |
Optimal bounds for semi-honest quantum oblivious transfer
Chicago Journal of Theoretical Computer Science | 2016-10-07 | Paper |
A simpler proof of the existence of quantum weak coin flipping with arbitrarily small bias
SIAM Journal on Computing | 2016-05-12 | Paper |
Quantum commitments from complexity assumptions
Computational Complexity | 2016-03-21 | Paper |
Weak coin flipping in a device-independent setting
Theory of Quantum Computation, Communication, and Cryptography | 2015-11-20 | Paper |
Optimal Bounds for Quantum Bit Commitment
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Optimal Quantum Strong Coin Flipping
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost
Automata, Languages, and Programming | 2014-07-01 | Paper |
Increasing the power of the verifier in quantum zero knowledge
| 2012-10-19 | Paper |
Lower bounds for quantum oblivious transfer
| 2012-08-29 | Paper |
Quantum commitments from complexity assumptions
Automata, Languages and Programming | 2011-07-06 | Paper |
Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model
Theory of Cryptography | 2008-03-05 | Paper |
