Michael Walter

Orcid: 0000-0003-3186-2482

Affiliations:
  • Zama, France
  • IST Austria (former)
  • University of California San Diego, La Jolla, CA, USA (Ph.D., 2017)
  • Technische Universität Darmstadt, Germany (former)


According to our database1, Michael Walter authored at least 36 papers between 2009 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Threshold (Fully) Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2025

Error-Simulatable Sanitization for TFHE and Applications.
IACR Commun. Cryptol., 2025

Drifting Towards Better Error Probabilities in Fully Homomorphic Encryption Schemes.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

2024
Towards Verifiable FHE in Practice: Proving Correct Execution of TFHE's Bootstrapping using plonky2.
IACR Cryptol. ePrint Arch., 2024

2023
Improving Convergence and Practicality of Slide-type Reductions.
IACR Cryptol. ePrint Arch., 2023

Noah's Ark: Efficient Threshold-FHE Using Noise Flooding.
Proceedings of the 11th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, 2023

2022
On Side-Channel and CVO Attacks against TFHE and FHEW.
IACR Cryptol. ePrint Arch., 2022

CoCoA: Concurrent Continuous Group Key Agreement.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

Liberating TFHE: Programmable Bootstrapping with General Quotient Polynomials.
Proceedings of the 10th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, 2022

2021
On the Cost of Adaptivity in Graph-Based Games.
IACR Cryptol. ePrint Arch., 2021

The Cost of Adaptivity in Security Games on Graphs.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Grafting Key Trees: Efficient Key Management for Overlapping Groups.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.
Proceedings of the 42nd IEEE Symposium on Security and Privacy, 2021

The Convergence of Slide-Type Reductions.
Proceedings of the Public-Key Cryptography - PKC 2021, 2021

Dual Lattice Attacks for Closest Vector Problems (with Preprocessing).
Proceedings of the Topics in Cryptology - CT-RSA 2021, 2021

Inverse-Sybil Attacks in Automated Contact Tracing.
Proceedings of the Topics in Cryptology - CT-RSA 2021, 2021

2020
Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography.
Proceedings of the Public-Key Cryptography - PKC 2020, 2020

2019
Keep the Dirt: Tainted TreeKEM, an Efficient and Provably Secure Continuous Group Key Agreement Protocol.
IACR Cryptol. ePrint Arch., 2019

Reversible Proofs of Sequential Work.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Sampling the Integers with Low Relative Error.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2019, 2019

2018
On the Bit Security of Cryptographic Primitives.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

2017
On the Concrete Security of Lattice-Based Cryptography.
PhD thesis, 2017

Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016
Practical, Predictable Lattice Basis Reduction.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

Creating Cryptographic Challenges Using Multi-Party Computation: The LWE Challenge.
Proceedings of the 3rd ACM International Workshop on ASIA Public-Key Cryptography, 2016

2015
Fast Lattice Point Enumeration with Minimal Overhead.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Lattice Point Enumeration on Block Reduced Bases.
Proceedings of the Information Theoretic Security - 8th International Conference, 2015

2014
Full analysis of PRINTcipher with respect to invariant subspace attack: efficient key recovery and countermeasures.
Des. Codes Cryptogr., 2014

2013
Many Weak Keys for PRINTcipher: Fast Key Recovery and Countermeasures.
Proceedings of the Topics in Cryptology - CT-RSA 2013, 2013

2012
Improving 3D similarity search by enhancing and combining 3D descriptors.
Multim. Tools Appl., 2012

Improved Algebraic Side-Channel Attack on AES.
IACR Cryptol. ePrint Arch., 2012

Study of the invariant coset attack on PRINTcipher: more weak keys with practical key recovery.
IACR Cryptol. ePrint Arch., 2012

Graph-based combinations of fragment descriptors for improved 3D Object Retrieval.
Proceedings of the Third Annual ACM SIGMM Conference on Multimedia Systems, 2012

Improved algebraic side-channel attack on AES.
Proceedings of the 2012 IEEE International Symposium on Hardware-Oriented Security and Trust, 2012

Optimizing Guessing Strategies for Algebraic Cryptanalysis with Applications to EPCBC.
Proceedings of the Information Security and Cryptology - 8th International Conference, 2012

2009


  Loading...