Dr. Martin Schaffer | June 28, 2016 | 12:00 | E.1.42

Abstract

Though cryptographic algorithms like AES are crypto-analytically secure, real implementations must at least be analyzed versus logical attacks like API misuse. Smart Cards and similar devices in addition face fault- and side channel analysis attacks. Such attacks exploit physical effects to manipulate the device or learn information about secret information. As these attacks are very critical, customers in the Smart Card world ask for third party evaluation (e.g. Common Criteria or EMVCo) to high assurance levels. If passed, a certificate is issued by a trusted party. With the rise of the IoT, physical attacks and the respective third-party witnessing of resistance soon get relevant there as well. This talk will give an overview of physical attacks and respective countermeasures in HW and SW. Moreover, it introduces how such devices are evaluated and certified and how much do attacks “cost”.

Dr. Schaffer studied computer science at Klagenfurt University and Swiss Federal Institute of Technology, focusing on security, privacy and cryptography. While conducting research in these fields, he received his PhD from Klagenfurt University. In 2001 he also worked for IBM Research Zurich Lab. 2008, Dr. Schaffer joined NXP Semiconductors where he held several positions in the security area over the last years, such as Security Architect and Cryptographer. Since 2014, Dr. Schaffer is Head of Security Maturity & Certification.

Dr. Roland Brockers | 01.06.2016 | 18:00 Uhr | Lakeside B11, Raum Leibniz
Vortrag zusammen mit Gerhard Paar siehe https://kiss.aau.at/

Kurzfassung

Kameras sind ein wesentlicher Bestandteil von fast jedem unbemannten Raumschiff, welches für die Weltraumforschung verwendet wird. Da ein Bild mehr als tausend Worte sagen kann, sind wir überwältigt von Bildern, die uns Weltraum-Teleskope, Planeten-Orbiter, oder Roboter zur Erforschung von unbekannten Himmelskörpern senden. Bilder und Videos bieten eine so reiche Quelle an Informationen, dass sie mit Unterstützung von Bildverarbeitungsmethoden für verschiedene Missionen in der Vergangenheit erfolgreich genutzt wurden. Während Bilddaten von Orbiter verwendet werden, um ganze Planeten abzubilden und zukünftige Oberflächen-Missionen zu planen, haben Planeten-Landefahrzeuge Bilddaten für die Evaluierung einer sicherer Landezone verwendet. Autonome Fahrzeuge wie der Mars Rover verwendeten Bildverarbeitungsmethoden für die autonome Navigation. In diesem Vortrag werden wir erforschen, wie Bildverarbeitung von verschiedenen Weltraummissionen eingesetzt wurden und einen Blick darauf werfen, wie der Bedarf an Autonomie bei künftigen Missionen die Anwendung von Bildverarbeitung die Weltraumforschung erweitern wird.

Dr. Roland Brockers ist ein Mitglied der Mobility and Robotic Systems Section am Jet Propulsion Laboratory in Pasadena, Kalifornien. Er erwarb seinen Doktortitel in Elektrotechnik an der Universität Paderborn in Deutschland im Jahr 2005. Mit mehr als 16 Jahren Erfahrung in Forschung und Entwicklung in der visuellen, autonomen Navigation von unbemannten Systemen konzentriert sich seine Arbeit derzeit auf unbemannte Luftfahrzeuge. Roland Brockers war in den letzten 6 Jahre als Projektleiter bei mehreren Projekten mit Mikroluftfahrzeugen am JPL beteiligt, einschließlich an autonomen Landungen, visuelle Lagebestimmung, autonome Hindernisvermeidung und der Einsatz von UAVs in verschiedenen Forschungsanwendungen, wie z. B. Ökosystem Monitoring in Precision Farming-Szenarien.

Alexander Beck | 02.06.2016 | 08:30 Uhr | E.2.37

Kurzfassung

Einen neuen Ansatz stellt die Analyse von Bedrohungsszenarien mit ganzheitlichem Blick auf IT-Infrastrukturen dar. Allerdings ist die Schutzbedarfs- oder Auswirkungsanalyse ein proaktiver Blick in die Zukunft, wo welche Bedrohungen zu erwarten sind. Eine Betrachtung der Auswirkungen auf Geschäftsprozesse wie sie typischerweise durch Business Impact Analysen angefertigt werden, ist nicht inbegriffen. (Wo kommen wir her). So stellt die Einbeziehung der unterschiedlichsten Architekturschichten einer IT-Infrastruktur eine sinnvolle Ergänzung dar, so dass die Frage nach dem richtigen Fokus möglicher Handlungsfelder sich von einem potentiellen Angriffsvektor weg, hin zu einem Kritikalitätsgrad hinsichtlich der Geschäftsprozesse wandelt. (Was wollen wir verändern). Die Frage die sich dabei stellt, wie können die umfangreichen Architekturinformationen in ausreichendem Maße beschrieben und analysiert werden, um solch eine Geschäftsprozessanalyse für einen eingetretenen Schadensfall zu ermöglichen. (Was ist das Ziel). Der Vortrag bietet einen Überblick über damit einhergehende Herausforderungen und stellt eine Diskussionsgrundlage für weitere Ansätze zu dieser Problematik dar. (Wo stehen wir, Erwartungshaltung)

Alexander Beck ist seit 2011 bei der Volkswagen AG tätig. Zuvor studierte er Informatik an Hochschule Harz und Otto-von-Guericke-Universität Magdeburg unter anderem mit den Schwerpunkten Datenintensive Systeme und Sicherheit. Im Rahmen seiner Dissertation erforscht er Verfahren zur automatisierten Sicherheitsbewertung von komplexen heterogenen IT-Infrastrukturen auf Basis neuronaler Netze. Beruflich war er mehrere Jahre in der Informationssicherheit im Volkswagen Konzern tätig und beschäftigte sich mit den Themen Authentifizierung und Verschlüsselung. Aktuell arbeitet er im Bereich IT Projekt- und Programmmanagement der Volkwagen Financial Services AG  und verantwortet IT Projekte im In- und Ausland.

Tamer Khatib | 17.05.2016 | 16:00 Uhr | B04 L4.1.114

Abstract: This book presents simplified coded models for photovoltaic (PV)-based systems using MATLAB to help readers understand the dynamic behavior of these systems. Through the use of MATLAB, the reader has the ability to modify system configuration, parameters, and optimization criteria. Topics covered include energy sources, storage, and power electronic devices. The book contains six chapters that cover systems’ components from the solar source to the end user. Chapter 1 discusses modeling of the solar source, and Chapter 2 discusses modeling of the PV source. Chapter 3 focuses on modeling of PV systems’ power electronic features and auxiliary power sources. Modeling of PV systems’ energy flow is examined in Chapter 4, while Chapter 5 discusses PV systems in electrical power systems. Chapter 6 presents an application of PV system models in systems’ size optimization. Common control methodologies applied to these systems are also modeled in this book.

• Covers the basic models of the whole PV power system, enabling the reader modify the models to provide different sizing and control methodologies
• Examines auxiliary components to PV systems, including wind turbines, diesel generators, and pumps
• Contains examples, drills, and codes Modeling of Photovoltaic Systems Using MATLAB: Simplified Green Codes is a reference for researchers, students, and engineers who work in the field of renewable energy, and specifically in PV systems.

Video:

Biography:
Tamer T.N. Khatib, Biography
Latest update:May,2016

Tamer is a photovoltaic power systems professional. He holds a B.Sc. degree in electrical power systems from An-Najah National University, Palestine as well as a M.Sc. degree and a Ph.D degree in photovoltaic power systems from National University of Malaysia, Malaysia. In addition he holds Habilitation (the highest academic degree in German speaking countries) in Renewable and sustainable energy from Alpen Adria Universität, Klagenfurt, Austria. Currently he is an Assistant professor of renewable energy at An-Najah National University.
So far, he has 2 patents, 3 books and 90 research articles, while  his current h-index is 17. He has lectured 20 courses for undergraduate students, supervised 4 Ph.D researches, 4 master researches and 25 bachelor researches.
He is a senior member of IEEE, IEEE Power and Energy Society, The International Solar Energy society, Jordanian Engineers Association, Palestinian Solar and Sustainable Energy Association and International Association of Engineers.
His research interests mainly fall in the scope of photovoltaic systems and solar energy fundamentals. These interests include PV systems design and optimization, modeling and control of PV systems, hybrid PV/Wind systems, hybrid PV/diesel systems, Grid connected PV systems, sun trackers, MPPT technology, inverters in PV system, solar chargers, batteries and charge controllers, solar energy fundamentals, solar energy prediction, AI applications for solar energy and PV systems, wind power systems, wind chargers, wind energy modeling and prediction.​

Dr. Bernhard Standl-Gruber | 18.05.2016 | 13:00 Uhr | E.2.37

Abstract

Successful learning can take place when the learner is addressed at all levels of learning instead of limiting teaching to knowledge transfer but also involving an emotional and skills level. Considering this as the student-centered approach, we designed, carried out and revised in practice computer science lessons in 9^th grade classrooms. During these real classroom experiences we identified certain successful scenarios when such learning was effective. We subsequently transformed scenarios to a more abstract representation and obtained as a result 24 patterns, which uniformly describe how student-centered lessons in computer science can be carried out. The patterns don’t specify detailed instructions for the teacher but still hold all the information necessary to be coherent with the pedagogical approach in the context of computer science. Instead of providing a detailed description of lesson plans and exact scenarios, the patterns describe how different teaching procedures can be approached alongside the student-centered approach. The advantage of this representation is, that it leaves the freedom of individual implementation to the teacher. In order to prove the concept of the patterns four case studies in classrooms were carried out with the design-based research approach as driving force combined with mixed methods as questionnaires, classroom meetings, and audio recordings. Outcomes showed, that these patterns have impact on students’ perception of the teacher’s attitudes. Furthermore, we identified detailed aspects of students’ communication characteristics during problem solving processes. In a next step, these patterns were further applied during a research visit in the United States in the context of computational thinking problem solving tasks. Assuming that problem solving processes can be found in everyday occurrences, computational thinking problem solving skills affect everyone and should be part of a general knowledge every person should have these days. Therefore, we combined the patterns with computer science algorithms in the context of everyday life settings and designed lesson scenarios for four high school classes. These classroom activities were accompanied with the mixed research approach and case studies. First results of this study showed, that students improved required skills for computational problem solving.

Bernhard Standl is a postdoctoral researcher and lecturer at the Faculty of Computer Science at the University of Vienna and computer science teacher at a secondary school in Vienna. After graduating from computer science and history studies with teacher certification, he finished in 2014 the PhD studies in computer science education at the University of Vienna in Austria and completed the thesis in the interdisciplinary field of computer science and education. Since 2008 he was part of computer science education and interdisciplinary, international projects. 2015 he stayed as Fulbright research fellow at Missouri State University in Springfield, MO where he carried out an individual research project named coThink – Computational Thinking. His research interests are focused on computer science education and technology enhanced learning at secondary school level and is interested in research for promoting computational thinking aimed at inspiring students for experiencing computer science as an exciting subject.

Dr. Stephan Alexander Weiss | 25.04.2016 | 11:00 Uhr | B04, L4101

Abstract

Polynomial matrices can help to elegantly formulate many broadband multi-sensor / multi-channel processing problems, and represent a direct extension of well-established narrowband techniques which typically involve eigen- (EVD) and singular value decompositions (SVD) for optimisation. Polynomial matrix decompositions extend the utility of the EVD to polynomial parahermitian matrices, and this talk presents a brief overview of such polynomial matrices, characteristics of the polynomial EVD (PEVD) and iterative algorithms for its solution. The presentation concludes with some surprising results when applying the PEVD to subband coding and broadband beamforming.

Stephan Weiss is Head of the Centre for Signal and Image Processing at the University of Strathclyde. He obtained Dipl.-Ing. and PhD degrees in 1995 and 1998 from the Universities of Erlangen-Nuernberg and from the University of Strathclyde. Since then, he has been a member of academic staff at the Universities of Southampton (1999-2006) and Strathclyde (1998/99 and since 2006). With his team we works on adaptive, array and statistical signal processing problems with applications in acoustics & audio, communications and biomedical problems. He has been co-organiser of the European Signal Processing Conference (EUSIPCO) 2009 in Glasgow and a number of other events.

Prof. Giuliano Antoniol | 19.04.2016 | 11:00 Uhr | I.2.35

Abstract

The IEEE glossary defines traceability as “the degree to which a relationship can be established between two or more products of the development process.” Traceability underlies many important software and systems engineering activities, such as program understanding, change impact analysis, contractual agreement as well as verification and validation. Despite important research advances in the automated creation and maintenance of trace links, artifact traceability is still not completely understood.

This talk briefly introduces key traceability ideas; the basic information retrieval models and traceability recovery approaches. It briefly summarizes the state of the art in traceability recovery and recent advances. Finally it discusses an on going research effort to determine an optimal and minimal set of candidate links to build a robust traceability recovering recognizer. Surprisingly, it may happen that a system built with just a handful of carefully selected candidate links, outperforms systems built using much more information. The talk presents preliminary results on publicly available datasets and it discuss findings, implications and research directions.

Giuliano Antoniol is professor of Software Engineering in the Department of Computer and Software Engineering of the Polytechnique Montréal where he directs the SOCCER laboratory. He worked in private companies, research institutions and universities. In 2005 he was awarded the Canada Research Chair Tier I in Software Change and Evolution. He has served in the program, organization and steering committees of numerous IEEE and ACM sponsored international conferences and workshops. His research interest include software evolution, empirical software engineering, software traceability, search based software engineering, mining software repositories and software testing.

Muhammad Taimoor Khan, MSc. PhD. | 29.02.2016 | 11:00 Uhr | E.2.69

Abstract

In this talk, we present a rigorous behavior based approach to develop reliable, secure and resilient application software for industrial control systems (in particular). The goal here is to employ formal methods to first build application right and then to continuously monitor the application for security and resilience.
To achieve the goal, we first develop correct-and-secure-by-construction application software using theorem proving (i.e. prover Coq) through refinement and synthesis of abstract data types. Then we introduce a run-time security monitor for application software, which detects both known and unknown computational cyber attacks. For resilience, we employ dependency directed reasoning to recover the system in a safe state, if any inconsistency is detected. Our security monitor is sound and complete, eliminating false alarms, as well as efficient, supporting real-time systems. In contrast, conventional run-time security monitors for application software either produce (high rates of) false alarms (e.g. intrusion detection systems) or limit application performance (e.g. run-time verification systems).
Our run-time monitor detects attacks by checking the consistency between the application run-time behavior and its expected behavior modeled in its specification. Our specification language is based on monadic second order logic (i.e. first order logic and set theory) and event calculus interpreted over algebraic data structures; application implementation can be in any programming language. Based on our defined denotational semantics of the specification language, we prove that the security monitor is sound and complete, i.e. it produces an alarm if and only if it detects an inconsistency between the application execution and the specified behavior. Importantly, the monitor detects not only cyberattacks but all behavioral deviations from specification, e.g. bugs, and so, is readily applicable to the security of legacy systems.
Finally, we present the evaluation of the monitor in the industrial control systems security domain, specifically in water management, demonstrating that run-time, sound and complete monitors employing verification techniques are effective, efficient and readily applicable to demanding real-time critical systems, without scalability limitations.

Muhammad Taimoor Khan is a postdoctoral researcher at Qatar Computing Research Institute (jointly with CSAIL, MIT, USA), Qatar. His current research is to develop reliable, secure and resilient software by the application of formal methods. On one hand, his project is focused on developing a tool to automatically detect and correct, known and unknown attacks through monitoring behavioral inconsistencies between specification and execution at run-time. On the other hand, his another project is focused on using theorem prover as a programming language to develop correct-and-secure-by construction software.
Prior to this, Taimoor Khan has passed doctoral studies at Research Institute for Symbolic Computation, Hagenberg, Austria with All-Distinctions in 2014. His PhD dissertation was about formal specification and verification of computer algebra software. Before joining RISC, he graduated in MSc Advanced Distributed Systems from the University of Leicester, UK with Distinction in 2008. As a final semester project he worked on the model-based verification of the various communication protocols of NASA in the frame of project “Space Link Extension Service Management”. Also prior to this, he completed his M.Sc. in Computer Science from Pakistan in 2001 and then worked for about five years in the software industry specializing in Java (EE/ME), XML and Web Services.
Taimoor Khan has been visiting scientist at various international reputed institutes including CSAIL, MIT, USA and ENSIIE, INRIA, France. Also he has won various research awards including the best student paper award at the most premier conference in computer algebra (CICM) in 2012.
He is also working as an associate tutor at University of Leicester, UK. Here he is teaching different courses (e.g. Domain Specific Languages) to MSc students (DL) and supervising their final semester projects. Prior to that, he has also taught undergraduate and graduate students at numerous universities in Pakistan as an assistant professor for several years.

Alexander Beck | 10.12.2015 | 15:00 Uhr | HS 4

Kurzfassung

IT-Systeme sind stark zusammenhängende komplexe Strukturen, so dass eine Fokussierung auf das IT-System im Ganzen nur eine bedingt effiziente Sicherheitsbewertung gewährleistet. Die Sicherheit dieser komplexen Systemlandschaften stets aktualisiert unter Berücksichtigung aller Wechselbeziehungen zwischen Komponenten dieser Systemlandschaften darzustellen, gestaltet sich mangels geeigneter Modelle schwierig. Neben diesen Modellen bilden Schwachstellenbewertungen die Grundlage für die Bewertung der Sicherheit und werden durch aufwändige Betrachtungen interpretiert, um eine Gesamtbewertung zu ermitteln. Will man dieses Vorgehen automatisieren, muss zunächst eine gemeinsame Repräsentation von Schwachstellenbewertungen vereinbart werden. Das dazu geeignete Common Vulnerability Scoring System (CVSS) ermöglicht die Bewertung einzelner Schwachstellen hinsichtlich verschiedenster Fragestellungen. Um eine Darstellung der Gesamtsicherheit zu erreichen, müssen diese Schwachstellen aggregiert werden. Unter einer Aggregation ist dabei die gemeinsame Interpretation aller im Fokus stehenden Schwachstellen zur Erreichung einer Gesamtbewertung zu verstehen, welche auf Basis eines neuronalen Netzwerkes erfolgt. Das neuronale Netz ist ein lernfähiges Konzept der Informatik, mit dem es möglich ist auf Basis definierter Eingabeparameter ein definiertes Ergebnis zu modellieren. Dabei wird das Netz trainiert und die Ergebnisse mit Ergebnissen der bisherigen manuellen Bewertungsverfahren verglichen, bis eine entsprechende Qualität der automatisch ermittelten Ergebnisse gesichert ist.

Alexander Beck ist seit 2011 bei der Volkswagen AG tätig. Zuvor studierte er Informatik an Hochschule Harz und Otto-von-Guericke-Universität Magdeburg unter anderem mit den Schwerpunkten Datenintensive Systeme und Sicherheit. Im Rahmen seiner Dissertation erforscht er Verfahren zur automatisierten Sicherheitsbewertung von komplexen heterogenen IT-Infrastrukturen auf Basis neuronaler Netze.
Beruflich war er mehrere Jahre in der Informationssicherheit im Volkswagen Konzern tätig und beschäftigte sich mit den Themen Authentifizierung und Verschlüsselung. Aktuell arbeitet er im Bereich IT Projekt- und Programmmanagement der Volkwagen Financial Services AG und verantwortet IT Projekte im In- und Ausland.

Dr. Christian Beecks | 24.11.2015 | 16:00 Uhr | E.2.42

Abstract

With the advent of social networks and the advancement of powerful internet-enabled mobile devices, millions of users are able to easily generate, process, and share multimedia data at billion-scale every single day. The resulting multitude and versatility of multimedia data made available in the Internet challenge todays’ data management and analysis algorithms. In many research and application areas including information retrieval, data mining, and computer vision, users are no longer satisfied with keyword-based access but want to search, browse, explore, and analyze multimedia data according to content-based characteristics. One fundamental operation underlying many data analysis algorithms is similarity search which aims at retrieving the most similar multimedia objects with respect to a query. In order to carry out similarity search for query-like multimedia objects, the way of modeling similarity is of major significance due to its impact on efficiency and effectiveness.

In this talk, I will present my ongoing research in this fascinating field and highlight future research directions. More specifically, I will show how to approach similarity between multimedia data objects by means of gradient-based signatures in order to facilitate data analysis with high efficiency and efficacy.

Christian Beecks is a postdoctoral researcher in the data management and data exploration group at RWTH Aachen University, Germany. His research interests include efficient and adaptive multimedia data analysis, distance-based multimedia indexing and query processing, and real-time data management.