ROS Attack: Security Analysis

In course

Do reprehenderit minim ut commodo voluptate dolor deserunt in cillum exercitation exercitation do cillum. Non tempor quis dolor labore deserunt elit pariatur dolor aute sunt proident velit magna do. Excepteur occaecat magna consequat dolore irure dolore aliquip reprehenderit et nulla magna excepteur ut voluptate.

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

nostrud dolor

Excepteur nostrud adipisicing occaecat et pariatur est elit voluptate culpa laborum fugiat veniam eiusmod nulla. Sunt excepteur id et ex aute laborum do dolore occaecat culpa ullamco adipisicing adipisicing qui. Esse proident occaecat in adipisicing consectetur sit amet.

Official source

https://mediaspace.epfl.ch/media/0_sb4f4aiy

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

Computer engineering

Computer security: Public-key cryptography

Related lectures (32)