| Universität Paderborn - Hörsaal L2
Titel: "The Quest for Meaning" (Prof. Dr. Axel Ngonga)
Humanity has produced more digital information over the last five years than over all of its previous history. With this flood of diverse data come a plethora of new requirements to data processing approaches. In particular, automatic approaches to capture, integrate, access and use the knowledge available in this data become indispensable. In this talk, we present how work carried out at the Data Science group of the University of Paderborn addresses some of the requirements to data processing aforementioned. After a short introduction, we epitomize the simple but powerful knowledge representation paradigm underlying the rest of the talk. We then delve into three of the pillars of our work, i.e., knowledge extraction, knowledge integration and knowledge access. For each pillar, we give some insights into the types of approaches developed by the group. Future challenges and open questions complete the talk.
Titel: "Secure Communication with Minimal Latency in Times of Surveillance" (Prof. Dr.-Ing. Tibor Jager)
Key establishment protocols are a cornerstone of secure communication on the Internet. For example, we use the TLS Handshake protocol whenever an Internet address starting with https:// is visited. Reducing latency while maintaining strong security guarantees like forward security (which makes large-scale Internet surveillance infeasible) has become a major design goal of modern key establishment protocols. Of particular interest in this regard are 0-RTT ("zero round-trip time") protocols, which can send cryptographically protected payload data "in 0-RTT", without the need for a prior interactive handshake that incurs latency. Prominent practical examples are Google's QUIC protocol and the 0-RTT mode of the upcoming TLS Version 1.3. The main difficulty in constructing 0-RTT key establishment protocols is to achieve forward security for the first message. According to cryptographic folklore, this was widely believed to be impossible. This talk will show that this belief is false, and describe the first 0-RTT key establishment protocol with full forward security. It will also present a very recent result, which introduces a new cryptographic building block called Bloom filter encryption and yields the first 0-RTT protocol with full forward security that is efficient enough for deployment in practice.