Divesh Aggarwal

Dexter Kwan

CoRR, October, 2025

Mind the Gap? Not for SVP Hardness under ETH!

[BibT_eX]

[DOI]

Rishav Gupta

Aditya Morolia

CoRR, April, 2025

Lattice Based Crypto breaks in a Superposition of Spacetimes.

[BibT_eX]

[DOI]

Shashwat Agrawal

Rajendra Kumar

CoRR, March, 2025

Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding.

[BibT_eX]

[DOI]

SIAM J. Comput., 2025

Recursive lattice reduction - A framework for finding short lattice vectors.

[BibT_eX]

[DOI]

Thomas Espitau

Spencer Peters

Proceedings of the 2025 Symposium on Simplicity in Algorithms, 2025

Improved Lower Bounds for 3-Query Matching Vector Codes.

[BibT_eX]

[DOI]

Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

Efficient Randomized Strong 2-Source Non-malleable Extractor for Any Linear Min-Entropy.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024

Quantum Measurement Adversary.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, January, 2024

Quantum Secure Non-Malleable Codes in the Split-State Model.

[BibT_eX]

[DOI]

Naresh Goud Boddu

Rahul Jain

IEEE Trans. Inf. Theory, January, 2024

Worst-Case to Average-Case Hardness of LWE: A Simple and Practical Perspective.

[BibT_eX]

[DOI]

Leong Jin Ming

Alexandra Veliche

Electron. Colloquium Comput. Complex., 2024

Engineering an Efficient Approximate DNF-Counter.

[BibT_eX]

[DOI]

CoRR, 2024

Polynomial Time Algorithms for Integer Programming and Unbounded Subset Sum in the Total Regime.

[BibT_eX]

[DOI]

CoRR, 2024

Worst-Case to Average-Case Hardness of LWE: An Alternative Perspective.

[BibT_eX]

[DOI]

Leong Jin Ming

Alexandra Veliche

Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

2023

Lattice Problems beyond Polynomial Time.

[BibT_eX]

[DOI]

Vinod Vaikuntanathan

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Engineering an Efficient Approximate DNF-Counter.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms!

[BibT_eX]

[DOI]

Rajendra Kumar

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Extractors: Low Entropy Requirements Colliding with Non-malleability.

[BibT_eX]

[DOI]

Eldon Chung

Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

Unforgeability in Stochastic Gradient Descent.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022

Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Survey: Non-malleable code in the split-state model.

[BibT_eX]

[DOI]

Marshall Ball

IACR Cryptol. ePrint Arch., 2022

Non-Malleable Code in the Split-State Model.

[BibT_eX]

[DOI]

Marshall Ball

Entropy, 2022

Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms, and of the Subset Sum Problem!

[BibT_eX]

[DOI]

Rajendra Kumar

CoRR, 2022

On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 20th International Conference, 2022

Rate one-third non-malleable codes.

[BibT_eX]

[DOI]

Sai Lakshmi Bhavana Obbattu

Bhavana Kanukurthi

Sruthi Sekar

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Algebraic Restriction Codes and Their Applications.

[BibT_eX]

[DOI]

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021

A note on the concrete hardness of the shortest independent vector in lattices.

[BibT_eX]

[DOI]

Eldon Chung

Inf. Process. Lett., 2021

Simplicity Meets Near-Optimal Rate: Non-malleable Codes and Non-malleable Two-source Extractors via Rate Boosters.

[BibT_eX]

[DOI]

Sai Lakshmi Bhavana Obbattu

Bhavana Kanukurthi

Sruthi Sekar

Electron. Colloquium Comput. Complex., 2021

Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms.

[BibT_eX]

[DOI]

CoRR, 2021

Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else).

[BibT_eX]

[DOI]

Huck Bennett

Alexander Golovnev

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

A 2n/2-Time Algorithm for $\sqrt{n}$-SVP and $\sqrt{n}$-Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP.

[BibT_eX]

[DOI]

Zeyong Li

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

2020

Two-Source Non-Malleable Extractors and Applications to Privacy Amplification with Tamperable Memory.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Computational and Information-Theoretic Two-Source (Non-Malleable) Extractors.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

A 2n/2-Time Algorithm for √n-SVP and √n-Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP.

[BibT_eX]

[DOI]

Zeyong Li

CoRR, 2020

A Note on the Concrete Hardness of the Shortest Independent Vectors Problem in Lattices.

[BibT_eX]

[DOI]

Eldon Chung

CoRR, 2020

A constant rate non-malleable code in the split-state model.

[BibT_eX]

[DOI]

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

How to Extract Useful Randomness from Unreliable Sources.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Slide Reduction, Revisited - Filling the Gaps in SVP Approximation.

[BibT_eX]

[DOI]

Jianwei Li

Phong Q. Nguyen

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

Extractor Lower Bounds, Revisited.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2020

2019

Faster Sieving Algorithm for Approximate SVP with Constant Approximation Factors.

[BibT_eX]

[DOI]

Bogdan Ursu

Serge Vaudenay

IACR Cryptol. ePrint Arch., 2019

Inception makes non-malleable codes shorter as well!

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Continuous Non-Malleable Codes in the 8-Split-State Model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

A Quantum-Proof Non-malleable Extractor - With Application to Privacy Amplification Against Active Quantum Adversaries.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018

Quantum Attacks on Bitcoin, and How to Protect Against Them.

[BibT_eX]

[DOI]

Ledger, 2018

Faster algorithms for SVP and CVP in the 𝓁∞ norm.

[BibT_eX]

[DOI]

Priyanka Mukhopadhyay

CoRR, 2018

(Gap/S)ETH hardness of SVP.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Just Take the Average! An Embarrassingly Simple 2^n-Time Algorithm for SVP (and CVP).

[BibT_eX]

[DOI]

Proceedings of the 1st Symposium on Simplicity in Algorithms, 2018

Leakage-Resilient Algebraic Manipulation Detection Codes with Optimal Parameters.

[BibT_eX]

[DOI]

Tomasz Kazana

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Improved Algorithms for the Shortest Vector Problem and the Closest Vector Problem in the Infinity Norm.

[BibT_eX]

[DOI]

Priyanka Mukhopadhyay

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

A New Public-Key Cryptosystem via Mersenne Numbers.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017

Inception Makes Non-malleable Codes Stronger.

[BibT_eX]

[DOI]

Tomasz Kazana

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

2016

Revisiting the Sanders-Freiman-Ruzsa Theorem in $\mathbb{F}_p^n$ and its Application to Non-malleable Codes.

[BibT_eX]

[DOI]

Jop Briët

CoRR, 2016

A Note on Discrete Gaussian Combinations of Lattice Vectors.

[BibT_eX]

[DOI]

Oded Regev

Chic. J. Theor. Comput. Sci., 2016

Optimal Computational Split-state Non-malleable Codes.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Affine-malleable extractors, spectrum doubling, and application to privacy amplification.

[BibT_eX]

[DOI]

Kaave Hosseini

Shachar Lovett

Proceedings of the IEEE International Symposium on Information Theory, 2016

Revisiting the Sanders-Bogolyubov-Ruzsa theorem in Fpn and its application to non-malleable codes.

[BibT_eX]

[DOI]

Jop Briët

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Affine-evasive sets modulo a prime.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Leakage-Resilient Non-malleable Codes.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Solving the Shortest Vector Problem in 2n Time Using Discrete Gaussian Sampling: Extended Abstract.

[BibT_eX]

[DOI]

Daniel Dadush

Oded Regev

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Non-malleable Reductions and Applications.

[BibT_eX]

[DOI]

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

A note on lower bounds for non-interactive message authentication using weak keys.

[BibT_eX]

[DOI]

Alexander Golovnev

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Solving the Closest Vector Problem in 2^n Time - The Discrete Gaussian Strikes Again!

[BibT_eX]

[DOI]

Daniel Dadush

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014

Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling.

[BibT_eX]

[DOI]

Daniel Dadush

Oded Regev

CoRR, 2014

Non-malleable codes from additive combinatorics.

[BibT_eX]

[DOI]

Yevgeniy Dodis

Shachar Lovett

Proceedings of the Symposium on Theory of Computing, 2014

Amplifying Privacy in Privacy Amplification.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

2013

Improved hardness results for unique shortest vector problem.

[BibT_eX]

[DOI]

Chandan K. Dubey

Electron. Colloquium Comput. Complex., 2013

2011

The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy.

[BibT_eX]

[DOI]

Ueli Maurer

Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

2009

Breaking RSA Generically Is Equivalent to Factoring.

[BibT_eX]

[DOI]

Ueli M. Maurer

Proceedings of the Advances in Cryptology, 2009

2006

Algorithms on Graphs with Small Dominating Targets.

[BibT_eX]

[DOI]

Chandan K. Dubey

Shashank K. Mehta

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

2005

Domination Search on Graphs with Low Dominating-Target-Number.

[BibT_eX]

[DOI]