Lecture
ROS Attack: Security Analysis
In course
DEMO: sint ut sint occaecat
Quis laborum sunt voluptate eu mollit fugiat sint excepteur. Consequat veniam non consequat voluptate excepteur. Do incididunt anim tempor occaecat non eu labore labore commodo dolor.
Description
This lecture delves into the (in)security of ROS, focusing on the k-sum problem and Wagner's k-list algorithm. It explores the implications of ROS Attack for IA, blind signatures, and Schnorr's Blind Signature. The instructors Max Duparc and Christophe Marciot present a detailed analysis of ROS security, including the use of random inhomogeneities in overdetermined solvable linear systems.
Instructor
tempor cillum incididunt
Voluptate ex adipisicing do Lorem ex. Proident deserunt eu aute eu. Aliqua ut laborum duis cillum mollit veniam velit id aute exercitation qui.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Ontological neighbourhood
Related lectures (31)
Proving Security: Random Oracle Model
Explores the Random Oracle Model, Hybrid ElGamal, and the Fujisaki Okamoto Transform in proving security.
Cryptography: IntroductionMOOC: Humanitarian Action in the Digital Age
Explores the fundamentals of cryptography, its properties, historical development, and potential challenges from quantum computers.
Hash Functions: Security and Applications
Explores hash functions, their security, common attacks, and applications in data verification and blockchain.
Exercise - Capsules and Group Selection
Covers exercises on capsules creation, group selection, and evaluation criteria.
Bluetooth Security: Pairing Protocols
Explores Bluetooth security, focusing on pairing protocols, key recovery, and active attacks in Bluetooth 2.0 and the enhanced Bluetooth 2.1 with Secure Simple Pairing (SSP).