Design of Secure Real-Time Embedded Systems
Real-time embedded systems have several design time constraints such as timing,
resource efficieny and performance. Security has not been an important design
concern earlier, and has been overlooked in the past. Ke Jiang's PhD thesis at
IDA approaches the design of secure embedded systems with a focus on
communication confidentiality and side-channel attack resistance.
Several techniques are presented in this thesis for designing secure real-time embedded systems, including hardware/software co-design techniques for communication confidentiality on distributed platforms, a global framework for secure multi-mode real-time systems, and a scheduling policy for thwarting differential power analysis attacks.
All the proposed solutions have been extensively evaluated experimentally, including two real-life case studies, which demonstrate the efficiency of the presented techniques.
New algebraic methods to study the complexity of constraint satisfaction problems
Constraint satisfaction problems are an important type of computational
problems with many applications within for example scheduling and optimisation
problems. The so-called algebraic approach has for the past 20 years had
tremendous success in identifying constraint satisfaction problems solvable in
polynomial time. Since efficient algorithms exists for such problems, they are
often said to be tractable. However, this algebraic approach cannot be used to
study the worst-case time complexity for the problems that are not believed to
be tractable, even though these problems can vary substantially in complexity.
To study the difference in complexity between hard constraint satisfaction problems of this kind, Victor Lagerkvist in his PhD thesis on IDA proposes an algebraic framework based on partial functions. This framework is then used to study the complexity for many well-known variants of the constraint satisfaction problem. The complexity for these problems is then related to a complexity theoretical conjecture, the exponential-time hypothesis, which states that there is a sharp limit to how much it is possible to improve exponential-time algorithms for constraint satisfaction problems.
Page responsible: Webmaster