Lecture
Boolean Hidden Matching Problem
In course
DEMO: reprehenderit tempor consectetur eu
Dolor esse cupidatat Lorem reprehenderit pariatur cillum incididunt sunt cupidatat dolor mollit. Sit elit aliqua magna ea deserunt consectetur duis dolore nostrud est. Consequat laborum cupidatat laboris reprehenderit aute. Dolore do quis tempor ex exercitation eiusmod.
Description
This lecture covers the Boolean Hidden Matching Problem, where Alice and Bob engage in a matching game with messages of different sizes, aiming to distinguish between them with negligible probability. The lecture explores various conditions and defines the problem, emphasizing the challenge of distinguishing between messages. It provides insights into the indicator function and the implications for most matches. The lecture concludes by highlighting the difficulty of distinguishing between messages, even with small differences, and the negligible probability of success.
Official source
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.