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 32 papers between 2009 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

Noah's Ark: Efficient Threshold-FHE Using Noise Flooding.
IACR Cryptol. ePrint Arch., 2023

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

Liberating TFHE: Programmable Bootstrapping with General Quotient Polynomials.
IACR Cryptol. ePrint Arch., 2022

CoCoA: Concurrent Continuous Group Key Agreement.
IACR Cryptol. ePrint Arch., 2022

2021
Dual lattice attacks for closest vector problems (with preprocessing).
IACR Cryptol. ePrint Arch., 2021

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

Grafting Key Trees: Efficient Key Management for Overlapping Groups.
IACR Cryptol. ePrint Arch., 2021

The Cost of Adaptivity in Security Games on Graphs.
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

2020
The Convergence of Slide-type Reductions.
IACR Cryptol. ePrint Arch., 2020

Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography.
IACR Cryptol. ePrint Arch., 2020

Inverse-Sybil Attacks in Automated Contact Tracing.
IACR Cryptol. ePrint Arch., 2020

2019
Sampling the Integers with Low Relative Error.
IACR Cryptol. ePrint Arch., 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.
IACR Cryptol. ePrint Arch., 2019

2018
On the Bit Security of Cryptographic Primitives.
IACR Cryptol. ePrint Arch., 2018

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

Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time.
IACR Cryptol. ePrint Arch., 2017

Creating Cryptographic Challenges Using Multi-Party Computation: The LWE Challenge.
IACR Cryptol. ePrint Arch., 2017

2015
Practical, Predictable Lattice Basis Reduction.
IACR Cryptol. ePrint Arch., 2015

2014
Lattice Point Enumeration on Block Reduced Bases.
IACR Cryptol. ePrint Arch., 2014

Fast Lattice Point Enumeration with Minimal Overhead.
IACR Cryptol. ePrint Arch., 2014

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

2013
Improved algebraic side-channel attack on AES.
J. Cryptogr. Eng., 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

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

2009


  Loading...