| 2026 | CRYPTO | Orthus: Practical Sublinear Batch-Verification of Lattice Relations from Standard Assumptions. | Madalina Bolboceanu, Jonathan Bootle, Vadim Lyubashevsky, Antonio Merino-Gallardo, Gregor Seiler |
| 2024 | CCS | The LaZer Library: Lattice-Based Zero Knowledge and Succinct Proofs for Quantum-Safe Privacy. | Vadim Lyubashevsky, Gregor Seiler, Patrick Steuer |
| 2024 | CRYPTO | Greyhound: Fast Polynomial Commitments from Lattices. | Ngoc Khanh Nguyen, Gregor Seiler |
| 2023 | CCS | Lattice-Based Blind Signatures: Short, Efficient, and Round-Optimal. | Ward Beullens, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler |
| 2023 | CRYPTO | LaBRADOR: Compact Proofs for R1CS from Module-SIS. | Ward Beullens, Gregor Seiler |
| 2023 | PKC | A Thorough Treatment of Highly-Efficient NTRU Instantiations. | Julien Duman, Kathrin Hvelmanns, Eike Kiltz, Vadim Lyubashevsky, Gregor Seiler, Dominique Unruh |
| 2022 | CRYPTO | Practical Sublinear Proofs for R1CS from Lattices. | Ngoc Khanh Nguyen, Gregor Seiler |
| 2021 | ASIACRYPT | Shorter Lattice-Based Group Signatures via "Almost Free" Encryption and Other Optimizations. | Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Planon, Gregor Seiler |
| 2021 | CCS | Faster Lattice-Based KEMs via a Generic Fujisaki-Okamoto Transform Using Prefix Hashing. | Julien Duman, Kathrin Hvelmanns, Eike Kiltz, Vadim Lyubashevsky, Gregor Seiler |
| 2021 | CRYPTO | SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions. | Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler |
| 2021 | ESORICS | More Efficient Amortization of Exact Zero-Knowledge Proofs for LWE. | Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler |
| 2021 | PKC | Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments. | Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler |
| 2020 | ASIACRYPT | Practical Exact Proofs from Lattices: New Techniques to Exploit Fully-Splitting Rings. | Muhammed F. Esgin, Ngoc Khanh Nguyen, Gregor Seiler |
| 2020 | CCS | Practical Lattice-Based Zero-Knowledge Proofs for Integer Relations. | Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler |
| 2020 | CRYPTO | Practical Product Proofs for Lattice Commitments. | Thomas Attema, Vadim Lyubashevsky, Gregor Seiler |
| 2020 | CRYPTO | A Non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge. | Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler |
| 2020 | PQCrypto | Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions. | Jonathan Bootle, Anja Lehmann, Vadim Lyubashevsky, Gregor Seiler |
| 2019 | CRYPTO | Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs. | Jonathan Bootle, Vadim Lyubashevsky, Gregor Seiler |
| 2019 | PKC | Short Discrete Log Proofs for FHE and Ring-LWE Ciphertexts. | Rafal del Pino, Vadim Lyubashevsky, Gregor Seiler |
| 2018 | CCS | Lattice-Based Group Signatures and Zero-Knowledge Proofs of Automorphism Stability. | Rafal del Pino, Vadim Lyubashevsky, Gregor Seiler |
| 2018 | EuroCrypt | Short, Invertible Elements in Partially Splitting Cyclotomic Rings and Applications to Lattice-Based Zero-Knowledge Proofs. | Vadim Lyubashevsky, Gregor Seiler |
| 2017 | CCS | Practical Quantum-Safe Voting from Lattices. | Rafal del Pino, Vadim Lyubashevsky, Gregory Neven, Gregor Seiler |
| 2016 | ISIT | On the impossibility of information-theoretic composable coin toss extension. | Gregor Seiler, Ueli Maurer |