Digital Proximity Tracing: SwissCovid Protocol

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (30)

Network Access Control: Security Overview Log in to Mediaspace to watch this video

Provides an overview of Network Access Control (NAC) and security challenges discussed at the 2022 Forum SI.

Optimal Abatement: Part 2 Log in to Mediaspace to watch this video

Explores optimal abatement in environmental economics, focusing on trade-offs, policies, and pollution control.

Learning-aided Program Reasoning Log in to Mediaspace to watch this video

Explores bug-finding, verification, and the use of learning-aided approaches in program reasoning, showcasing examples like the Heartbleed bug and differential Bayesian reasoning.

Finite Element Methodology Log in to Mediaspace to watch this video

Explores finite element methodology, covering geometric modeling, technical data, physical behavior assumptions, and mesh convergence studies.

Security Design Principles: Preliminaries Log in to Mediaspace to watch this video

Covers basic security concepts, adversarial thinking, security mechanisms, and responsible conduct in security design principles.

Password Security Log in to Mediaspace to watch this video

Emphasizes the importance of safeguarding passwords and avoiding sharing them.

Biometric Technologies: Enhancing Security and Privacy Log in to Mediaspace to watch this video

Explores the development of biometric technologies based on finger vein recognition to enhance security and privacy.

Space Mission Design and Operations: JWST Log in to Mediaspace to watch this video

Covers the James Webb Space Telescope, launched in 2021 to study distant objects and exoplanets from a halo orbit around the L2 Lagrange point.

WireGuard: Cryptographic Protocol for VPNs Log in to Mediaspace to watch this video

Explores the WireGuard Protocol, a modern VPN replacement for IPsec and OpenVPN, focusing on encrypted tunnelling and security properties.

Sparsest Cut: Leighton-Rao Algorithm Log in to Mediaspace to watch this video

Covers the Leighton-Rao algorithm for finding the sparsest cut in a graph, focusing on its steps and theoretical foundations.

Page 2 of 2