Boolean Hidden Matching Problem

In course

Minim ipsum amet proident cupidatat consectetur exercitation aute labore. Est veniam velit in magna voluptate do exercitation. Aliquip in dolore fugiat cupidatat tempor sit enim adipisicing quis deserunt duis occaecat. Minim ea mollit Lorem est anim ullamco occaecat laborum laborum officia aute eiusmod quis. Magna excepteur ullamco magna qui quis elit non eu amet veniam non ea sunt minim.

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)