| Publication | Date of Publication | Type |
|---|
Quantum measurement adversary
IEEE Transactions on Information Theory | 2024-07-21 | Paper |
Quantum secure non-malleable codes in the split-state model
IEEE Transactions on Information Theory | 2024-07-21 | Paper |
Lattice problems beyond polynomial time
| 2024-05-08 | Paper |
scientific article; zbMATH DE number 7829234 (Why is no real title available?)
| 2024-04-09 | Paper |
Extractors: low entropy requirements colliding with non-malleability
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
scientific article; zbMATH DE number 7788447 (Why is no real title available?)
| 2024-01-15 | Paper |
scientific article; zbMATH DE number 7788483 (Why is no real title available?)
| 2024-01-15 | Paper |
Algebraic restriction codes and their applications
Algorithmica | 2023-12-13 | Paper |
Rate one-third non-malleable codes
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Extractor Lower Bounds, Revisited
| 2023-10-31 | Paper |
On secret sharing, randomness, and random-less reductions for secret sharing
Theory of Cryptography | 2023-08-14 | Paper |
Slide reduction, revisited -- filling the gaps in SVP approximation
| 2022-11-09 | Paper |
Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors
IEEE Transactions on Information Theory | 2022-08-19 | Paper |
scientific article; zbMATH DE number 7561389 (Why is no real title available?)
| 2022-07-21 | Paper |
A \(2^{n/2}\)-time algorithm for \(\sqrt{n} \)-SVP and \(\sqrt{n} \)-Hermite SVP, and an improved time-approximation tradeoff for (H)SVP
| 2021-12-08 | Paper |
How to extract useful randomness from unreliable sources
| 2021-12-01 | Paper |
A note on the concrete hardness of the shortest independent vector in lattices
Information Processing Letters | 2021-03-11 | Paper |
A new public-key cryptosystem via Mersenne numbers
| 2020-06-30 | Paper |
Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures
| 2020-03-09 | Paper |
A quantum-proof non-malleable extractor. With application to privacy amplification against active quantum adversaries
| 2020-02-06 | Paper |
Continuous non-malleable codes in the 8-split-state model
| 2020-02-04 | Paper |
Just take the average! An embarrassingly simple \(2^n\)-time algorithm for SVP (and CVP)
| 2019-10-25 | Paper |
(Gap/S)ETH hardness of SVP
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
An improved constant in Banaszczyk's transference theorem
| 2019-07-21 | Paper |
Non-Malleable Codes from Additive Combinatorics
SIAM Journal on Computing | 2018-04-26 | Paper |
Inception makes non-malleable codes stronger
| 2018-01-19 | Paper |
Breaking RSA Generically Is Equivalent to Factoring
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
A note on discrete Gaussian combinations of lattice vectors
Chicago Journal of Theoretical Computer Science | 2016-08-16 | Paper |
Improved hardness results for unique shortest vector problem
Information Processing Letters | 2016-07-07 | Paper |
Optimal computational split-state non-malleable codes
Theory of Cryptography | 2016-04-08 | Paper |
Non-malleable reductions and applications
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Solving the shortest vector problem in \(2^n\) time using discrete Gaussian sampling (extended abstract)
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Leakage-resilient non-malleable codes
Theory of Cryptography | 2015-07-06 | Paper |
Non-malleable codes from additive combinatorics (extended abstract)
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Affine-evasive sets modulo a prime
Information Processing Letters | 2014-12-09 | Paper |
Amplifying Privacy in Privacy Amplification
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
Lecture Notes in Computer Science | 2011-12-02 | Paper |
Breaking RSA Generically Is Equivalent to Factoring
Advances in Cryptology - EUROCRYPT 2009 | 2009-05-12 | Paper |
Algorithms on Graphs with Small Dominating Targets
Algorithms and Computation | 2008-04-24 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
