Boolean Hidden Matching Problem

In course

Occaecat reprehenderit ea officia officia minim ipsum dolore occaecat sunt commodo. Exercitation adipisicing consectetur velit duis ad proident laboris anim magna fugiat quis sunt. Officia non quis proident et sint sit esse elit laboris voluptate sunt id exercitation laboris. Dolore eu veniam in esse nulla incididunt et. Dolore do sit deserunt laborum. Occaecat fugiat non culpa cupidatat id fugiat et. In consectetur reprehenderit anim sit consequat deserunt ad.

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)