Damien Couroussé
ABSTRACT
No abstract available.
- Giovanni Agosta, Alessandro Barenghi, and Gerardo Pelosi. 2012. A Code Morphing Methodology to Automate Power Analysis Countermeasures. In DAC. 77--82. Google Scholar
Digital Library
- Giovanni Agosta, Alessandro Barenghi, Gerardo Pelosi, and Michele Scandale. 2015. The MEET Approach: Securing Cryptographic Embedded Software Against Side Channel Attacks. 34, 8 (2015), 1320--1333.Google Scholar
- Damien Couroussé, Thierno Barry, Bruno Robisson, Philippe Jaillon, Olivier Potin, and Jean-Louis Lanet. 2016. Runtime Code Polymorphism as a Protection Against Side Channel Attacks. Springer, 136--152.Google Scholar
- Stephen Crane, Andrei Homescu, Stefan Brunthaler, Per Larsen, and Michael Franz. 2015. Thwarting Cache Side-Channel Attacks Through Dynamic Software Diversity.. In NDSS. 8--11.Google Scholar
- Andrei Homescu, Stefan Brunthaler, Per Larsen, and Michael Franz. 2013. Librando: Transparent Code Randomization for Just-in-Time Compilers. In CCS (CCS '13). ACM, 993--1004. Google ScholarDigital Library
- Stefan Mangard, Elisabeth Oswald, and Thomas Popp. 2007. Power Analysis Attacks: Revealing the Secrets of Smart Cards. Vol. 31. Springer-Verlag. Google ScholarDigital Library
- Eyal Ronen, Adi Shamir, Achi-Or Weingarten, and Colin OFlynn. 2017. IoT Goes Nuclear: Creating a ZigBee Chain Reaction. IEEE, 195--212.Google Scholar
Index Terms
- All paths lead to Rome: Polymorphic Runtime Code Generation for Embedded Systems
Recommendations
Improved algorithms for the k simple shortest paths and the replacement paths problems
Given a directed, non-negatively weighted graph G=(V,E) and s,t@?V, we consider two problems. In the k simple shortest paths problem, we want to find the k simple paths from s to t with the k smallest weights. In the replacement paths problem, we want ...
Replacement paths and k simple shortest paths in unweighted directed graphs
Let G = (V,E) be a directed graph and let P be a shortest path from s to t in G. In the replacement paths problem, we are required to find, for every edge e on P, a shortest path from s to t in G that avoids e. The only known algorithm for solving the ...
Improving WCET by Optimizing Worst-Case Paths
RTAS '05: Proceedings of the 11th IEEE Real Time on Embedded Technology and Applications SymposiumIt is advantageous to perform compiler optimizations to lower the WCET of a task since tasks with lower WCETs are easier to schedule and more likely to meet their deadlines. Compiler writers in recent years have used profile information to detect the ...
Comments