default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Walter 0001
Person information
- affiliation: Zama, France
- affiliation (former): IST Austria
- affiliation (Ph.D., 2017): University of California San Diego, La Jolla, CA, USA
- affiliation (former): Technische Universität Darmstadt, Germany
Other persons with the same name
- Michael Walter — disambiguation page
- Michael Walter 0002
![[0000-0001-5659-8716]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0001-5659-8716")
— German Aerospace Center (DLR), Wessling, Germany - Michael Walter 0003 — University of Freiburg, Freiburg im Breisgau, Germany
- Michael Walter 0004 — University of Westminster, London, UK
- Michael Walter 0005 — Ruhr-University Bochum, Germany (and 1 more)
- Michael Walter 0006 — Technische Universität Darmstadt, Germany
- Michael Walter 0007 — Friedrich-Alexander-University Erlangen-Nuremberg, Erlangen, Germany
- Michael Walter 0008 — IBM Germany, Hamburg, Germany
- Michael Walter 0009 — Munich University of Technology (TUM), Munich, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i24]Louis Tremblay Thibault, Michael Walter:
Towards Verifiable FHE in Practice: Proving Correct Execution of TFHE's Bootstrapping using plonky2. IACR Cryptol. ePrint Arch. 2024: 451 (2024)- [i23]Olivier Bernard, Marc Joye, Nigel P. Smart, Michael Walter:
Drifting Towards Better Error Probabilities in Fully Homomorphic Encryption Schemes. IACR Cryptol. ePrint Arch. 2024: 1718 (2024) - 2023
- [j4]Jianwei Li, Michael Walter:
Improving convergence and practicality of slide-type reductions. Inf. Comput. 291: 105012 (2023) - [c23]Morten Dahl, Daniel Demmler, Sarah El Kazdadi, Arthur Meyre, Jean-Baptiste Orfila, Dragos Rotaru, Nigel P. Smart, Samuel Tap, Michael Walter:
Noah's Ark: Efficient Threshold-FHE Using Noise Flooding. WAHC@CCS 2023: 35-46 - [i22]Jianwei Li, Michael Walter:
Improving Convergence and Practicality of Slide-type Reductions. IACR Cryptol. ePrint Arch. 2023: 140 (2023) - [i21]Morten Dahl, Daniel Demmler, Sarah El Kazdadi, Arthur Meyre, Jean-Baptiste Orfila, Dragos Rotaru, Nigel P. Smart, Samuel Tap, Michael Walter:
Noah's Ark: Efficient Threshold-FHE Using Noise Flooding. IACR Cryptol. ePrint Arch. 2023: 815 (2023) - 2022
- [c22]Marc Joye, Michael Walter:
Liberating TFHE: Programmable Bootstrapping with General Quotient Polynomials. WAHC@CCS 2022: 1-11 - [c21]Joël Alwen, Benedikt Auerbach, Miguel Cueto Noval, Karen Klein, Guillermo Pascual-Perez, Krzysztof Pietrzak, Michael Walter:
CoCoA: Concurrent Continuous Group Key Agreement. EUROCRYPT (2) 2022: 815-844 - [i20]Joël Alwen, Benedikt Auerbach, Miguel Cueto Noval, Karen Klein, Guillermo Pascual-Perez, Krzysztof Pietrzak, Michael Walter:
CoCoA: Concurrent Continuous Group Key Agreement. IACR Cryptol. ePrint Arch. 2022: 251 (2022) - [i19]Marc Joye, Michael Walter:
Liberating TFHE: Programmable Bootstrapping with General Quotient Polynomials. IACR Cryptol. ePrint Arch. 2022: 1177 (2022) - [i18]Michael Walter:
On Side-Channel and CVO Attacks against TFHE and FHEW. IACR Cryptol. ePrint Arch. 2022: 1722 (2022) - 2021
- [c20]Benedikt Auerbach, Suvradip Chakraborty, Karen Klein, Guillermo Pascual-Perez, Krzysztof Pietrzak, Michael Walter, Michelle Yeo:
Inverse-Sybil Attacks in Automated Contact Tracing. CT-RSA 2021: 399-421 - [c19]Thijs Laarhoven, Michael Walter:
Dual Lattice Attacks for Closest Vector Problems (with Preprocessing). CT-RSA 2021: 478-502 - [c18]Michael Walter:
The Convergence of Slide-Type Reductions. Public Key Cryptography (1) 2021: 45-67 - [c17]Karen Klein, Guillermo Pascual-Perez, Michael Walter, Chethan Kamath, Margarita Capretto, Miguel Cueto, Ilia Markov, Michelle Yeo, Joël Alwen, Krzysztof Pietrzak:
Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement. SP 2021: 268-284 - [c16]Joël Alwen, Benedikt Auerbach, Mirza Ahad Baig, Miguel Cueto Noval, Karen Klein, Guillermo Pascual-Perez, Krzysztof Pietrzak, Michael Walter:
Grafting Key Trees: Efficient Key Management for Overlapping Groups. TCC (3) 2021: 222-253 - [c15]Chethan Kamath, Karen Klein, Krzysztof Pietrzak, Michael Walter:
The Cost of Adaptivity in Security Games on Graphs. TCC (2) 2021: 550-581 - [i17]Chethan Kamath, Karen Klein, Krzysztof Pietrzak, Michael Walter:
On the Cost of Adaptivity in Graph-Based Games. IACR Cryptol. ePrint Arch. 2021: 59 (2021) - [i16]Thijs Laarhoven, Michael Walter:
Dual lattice attacks for closest vector problems (with preprocessing). IACR Cryptol. ePrint Arch. 2021: 557 (2021) - [i15]Joël Alwen, Benedikt Auerbach, Mirza Ahad Baig, Miguel Cueto, Karen Klein, Guillermo Pascual-Perez, Krzysztof Pietrzak, Michael Walter:
Grafting Key Trees: Efficient Key Management for Overlapping Groups. IACR Cryptol. ePrint Arch. 2021: 1158 (2021) - 2020
- [c14]Nicholas Genise, Daniele Micciancio, Chris Peikert, Michael Walter:
Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography. Public Key Cryptography (1) 2020: 623-651 - [i14]Nicholas Genise, Daniele Micciancio, Chris Peikert, Michael Walter:
Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography. IACR Cryptol. ePrint Arch. 2020: 337 (2020) - [i13]Benedikt Auerbach, Suvradip Chakraborty, Karen Klein, Guillermo Pascual-Perez, Krzysztof Pietrzak, Michael Walter, Michelle Yeo:
Inverse-Sybil Attacks in Automated Contact Tracing. IACR Cryptol. ePrint Arch. 2020: 670 (2020) - [i12]Michael Walter:
The Convergence of Slide-type Reductions. IACR Cryptol. ePrint Arch. 2020: 1409 (2020)
2010 – 2019
- 2019
- [c13]Michael Walter:
Sampling the Integers with Low Relative Error. AFRICACRYPT 2019: 157-180 - [c12]Hamza Abusalah, Chethan Kamath, Karen Klein, Krzysztof Pietrzak, Michael Walter:
Reversible Proofs of Sequential Work. EUROCRYPT (2) 2019: 277-291 - [i11]Michael Walter:
Sampling the Integers with Low Relative Error. IACR Cryptol. ePrint Arch. 2019: 68 (2019) - [i10]Hamza Abusalah, Chethan Kamath, Karen Klein, Krzysztof Pietrzak, Michael Walter:
Reversible Proofs of Sequential Work. IACR Cryptol. ePrint Arch. 2019: 252 (2019) - [i9]Joël Alwen, Margarita Capretto, Miguel Cueto, Chethan Kamath, Karen Klein, Guillermo Pascual-Perez, Krzysztof Pietrzak, Michael Walter:
Keep the Dirt: Tainted TreeKEM, an Efficient and Provably Secure Continuous Group Key Agreement Protocol. IACR Cryptol. ePrint Arch. 2019: 1489 (2019) - 2018
- [c11]Daniele Micciancio, Michael Walter:
On the Bit Security of Cryptographic Primitives. EUROCRYPT (1) 2018: 3-28 - [i8]Daniele Micciancio, Michael Walter:
On the Bit Security of Cryptographic Primitives. IACR Cryptol. ePrint Arch. 2018: 77 (2018) - 2017
- [b1]Michael Walter:
On the Concrete Security of Lattice-Based Cryptography. University of California, San Diego, USA, 2017 - [c10]Daniele Micciancio, Michael Walter:
Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time. CRYPTO (2) 2017: 455-485 - [i7]Daniele Micciancio, Michael Walter:
Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time. IACR Cryptol. ePrint Arch. 2017: 259 (2017) - [i6]Johannes Buchmann, Niklas Büscher, Florian Göpfert, Stefan Katzenbeisser, Juliane Krämer, Daniele Micciancio, Sander Siim, Christine van Vredendaal, Michael Walter:
Creating Cryptographic Challenges Using Multi-Party Computation: The LWE Challenge. IACR Cryptol. ePrint Arch. 2017: 606 (2017) - 2016
- [c9]Johannes Buchmann, Niklas Büscher, Florian Göpfert, Stefan Katzenbeisser, Juliane Krämer, Daniele Micciancio, Sander Siim, Christine van Vredendaal, Michael Walter:
Creating Cryptographic Challenges Using Multi-Party Computation: The LWE Challenge. AsiaPKC@AsiaCCS 2016: 11-20 - [c8]Daniele Micciancio, Michael Walter:
Practical, Predictable Lattice Basis Reduction. EUROCRYPT (1) 2016: 820-849 - 2015
- [c7]Michael Walter:
Lattice Point Enumeration on Block Reduced Bases. ICITS 2015: 269-282 - [c6]Daniele Micciancio, Michael Walter:
Fast Lattice Point Enumeration with Minimal Overhead. SODA 2015: 276-294 - [i5]Daniele Micciancio, Michael Walter:
Practical, Predictable Lattice Basis Reduction. IACR Cryptol. ePrint Arch. 2015: 1123 (2015) - 2014
- [j3]Stanislav Bulygin, Michael Walter, Johannes Buchmann:
Full analysis of PRINTcipher with respect to invariant subspace attack: efficient key recovery and countermeasures. Des. Codes Cryptogr. 73(3): 997-1022 (2014) - [i4]Daniele Micciancio, Michael Walter:
Fast Lattice Point Enumeration with Minimal Overhead. IACR Cryptol. ePrint Arch. 2014: 569 (2014) - [i3]Michael Walter:
Lattice Point Enumeration on Block Reduced Bases. IACR Cryptol. ePrint Arch. 2014: 948 (2014) - 2013
- [j2]Mohamed Saied Emam Mohamed, Stanislav Bulygin, Michael Zohner, Annelie Heuser, Michael Walter, Johannes Buchmann:
Improved algebraic side-channel attack on AES. J. Cryptogr. Eng. 3(3): 139-156 (2013) - [c5]Stanislav Bulygin, Michael Walter, Johannes Buchmann:
Many Weak Keys for PRINTcipher: Fast Key Recovery and Countermeasures. CT-RSA 2013: 189-206 - 2012
- [j1]Benjamin Bustos, Tobias Schreck, Michael Walter, Juan Manuel Barrios, Matthias Schäfer, Daniel A. Keim:
Improving 3D similarity search by enhancing and combining 3D descriptors. Multim. Tools Appl. 58(1): 81-108 (2012) - [c4]Michael Walter, Stanislav Bulygin, Johannes Buchmann:
Optimizing Guessing Strategies for Algebraic Cryptanalysis with Applications to EPCBC. Inscrypt 2012: 175-197 - [c3]Mohamed Saied Emam Mohamed, Stanislav Bulygin, Michael Zohner, Annelie Heuser, Michael Walter, Johannes Buchmann:
Improved algebraic side-channel attack on AES. HOST 2012: 146-151 - [c2]Tobias Schreck, Maximilian Scherer, Michael Walter, Benjamin Bustos, Sang Min Yoon, Arjan Kuijper:
Graph-based combinations of fragment descriptors for improved 3D Object Retrieval. MMSys 2012: 23-28 - [i2]Mohamed Saied Emam Mohamed, Stanislav Bulygin, Michael Zohner, Annelie Heuser, Michael Walter:
Improved Algebraic Side-Channel Attack on AES. IACR Cryptol. ePrint Arch. 2012: 84 (2012) - [i1]Stanislav Bulygin, Michael Walter:
Study of the invariant coset attack on PRINTcipher: more weak keys with practical key recovery. IACR Cryptol. ePrint Arch. 2012: 85 (2012)
2000 – 2009
- 2009
- [c1]Afzal Godil, Helin Dutagaci, Ceyhun Burak Akgül, Apostolos Axenopoulos, Benjamin Bustos, Mohamed Chaouch, Petros Daras, Takahiko Furuya, Sebastian Kreft, Zhouhui Lian, Thibault Napoléon, Athanasios Mademlis, Ryutarou Ohbuchi, Paul L. Rosin, Bülent Sankur, Tobias Schreck, Xianfang Sun, Masaki Tezuka, Anne Verroust-Blondet, Michael Walter, Yücel Yemez:
SHREC'09 Track: Generic Shape Retrieval. 3DOR@Eurographics 2009: 61-68
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-11 22:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
