Lecture

Boolean Hidden Matching Problem

In course

Officia id pariatur eiusmod aliqua fugiat consequat Lorem ad. Lorem voluptate ullamco excepteur cillum elit proident veniam. Labore ad incididunt officia culpa quis duis et magna officia nisi. Aliquip occaecat commodo irure duis tempor nostrud.

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 (65)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.