A5070604415- Cryptography and Data Security
- Cryptographic Implementations and Security
- Coding theory and cryptography
- Chaos-based Image/Signal Encryption
- Complexity and Algorithms in Graphs
- Security in Wireless Sensor Networks
- Privacy-Preserving Technologies in Data
- 3D Shape Modeling and Analysis
- Advanced Image and Video Retrieval Techniques
- Robotics and Sensor-Based Localization
- Physical Unclonable Functions (PUFs) and Hardware Security
- Cryptography and Residue Arithmetic
- Logic, programming, and type systems
- Internet Traffic Analysis and Secure E-voting
- Privacy, Security, and Data Protection
- Image Retrieval and Classification Techniques
- Image Processing and 3D Reconstruction
- Data Management and Algorithms
- Advanced Malware Detection Techniques
- COVID-19 Digital Contact Tracing
- Advanced Database Systems and Queries
- Advanced Authentication Protocols Security
- Age of Information Optimization
- Bayesian Modeling and Causal Inference
- Smart Grid Security and Resilience
Zone Atelier Moselle
2021-2023
Institute of Science and Technology Austria
2018-2021
University of California, San Diego
2012-2017
Austrian Federal Railways
2017
Technical University of Darmstadt
2009-2016
IBM (United States)
2001
Justus-Liebig-Universität Gießen
2000
Enumeration algorithms are the best currently known methods to solve lattice problems, both in theory (within class of polynomial space algorithms), and practice (where they routinely used evaluate concrete security cryptography). However, there is an uncomfortable gap between our theoretical understanding practical performance point enumeration algorithms. The typically have worst-case asymptotic running time 2O(n2), but perform extremely well practice, at least for all values dimension...
Previous chapter Next Full AccessProceedings Proceedings of the 2015 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)Fast Lattice Point Enumeration with Minimal OverheadDaniele Micciancio and Michael WalterDaniele Walterpp.276 - 294Chapter DOI:https://doi.org/10.1137/1.9781611973730.21PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAboutAbstract algorithms are best currently known methods solve lattice problems, both in theory (within class...
In this paper we present improvements of the algebraic side-channel analysis Advanced Encryption Standard (AES) proposed in [1]. particular, optimize representation AES and obtained information order to speed up attack increase success rate. We study performance our both known unknown plaintext/ciphertext scenarios. Our experiments indicate that cases amount required is less than one attacks introduced Furthermore, introduce a method for error handling, which allows improved escape...
While messaging systems with strong security guarantees are widely used in practice, designing a protocol that scales efficiently to large groups and enjoys similar remains largely open. The two existing proposals date ART (Cohn-Gordon et al., CCS18) TreeKEM (IETF, Messaging Layer Security Protocol, draft). is the currently considered candidate by IETF MLS working group, but dynamic group operations (i.e. adding removing users) can cause efficiency issues. In this paper we formalize analyze...
We outline a secure and efficient methodology to do threshold distributed decryption for LWE based Fully Homomorphic Encryption schemes. Due the smaller parameters used in some FHE schemes, such as Torus-FHE (TFHE), standard technique of "noise flooding'' seems not apply. show that noise flooding can also be with schemes small parameters, by utilizing switch scheme slightly higher then bootstrapping operations which TFHE offers. Our protocol is proved via simulation argument, making its...
In this paper we present the results of SHREC'09- Generic Shape Retrieval Contest. The aim track was to evaluate performances various 3D shape retrieval algorithms on NIST generic benchmark. We hope that benchmark will provide valuable contributions community. Seven groups have participated in and they submitted 22 sets rank lists based different methods parameters. performance evaluation Contest is 6 metrics.
Practical hardness results are necessary to select parameters for cryptographic schemes. Cryptographic challenges proved be useful determining the practical of computational problems that used build public-key cryptography. However, several these have drawback it is not known how create a challenge them without knowing solutions. Hence, creators excluded from participating. In this work, we present method excluding anyone This based on secure multi-party computation (MPC). We demonstrate...
Recently, a number of offloading approaches have been proposed to reduce the burden on cellular infrastructure, especially during peak hours. Ranging from pure data concepts using local caches fully-fledged services operating ad hoc networks, these are mostly tuned towards their performance. Consequently, cache hit ratios, achieved throughput, or end-to-end latencies, prominent evaluation metrics. However, when utilizing users' resources improve performance shared service, fairness with...