Boolean Hidden Matching Problem

In course

Voluptate sit et excepteur anim in consequat est anim in nulla ad sunt adipisicing dolore. Nulla cupidatat cillum ut non proident. Elit sunt labore ut quis culpa aute anim elit eiusmod exercitation esse. Elit ex nostrud dolore cupidatat magna voluptate ea eiusmod et ut. Ea ullamco occaecat commodo deserunt adipisicing velit amet amet qui ex laboris. Lorem nostrud do anim qui irure cupidatat sit minim reprehenderit ut cillum.

Description

This lecture covers the Boolean Hidden Matching Problem, where Alice and Bob aim to find a matching of size n without revealing their inputs. The slides discuss message matching, total communication, and applications to lower bounds.

Official source

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

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

Statistics

Statistical inference: Mathematical statistics

Computer engineering

Computer security: Pseudorandomness

Mathematics

Discrete mathematics: Graph theory

Related lectures (70)