Size-Hiding Computation for Multiple Parties

Explore a talk from Asiacrypt 2016 on size-hiding computation for multiple parties, presented by Kazumasa Shinagawa and colleagues. Delve into the introduction, applications, and key concepts such as the millionaire problem, strong secure channels, and sharing protocols. Gain insights into the classification for multiple parties, intuition behind the approach, and potential infeasibility issues. Examine the physical class and key observations presented, concluding with a Q&A session for further discussion on this cryptographic topic.

Introduction
Presentation
Applications
Millionaire
Outline
Notations
Previous Results
Classification for Multiple Parties
Intuition
Strong Secure Channel
Sharing Protocol
Infeasibility
Physical Class
Key Observation
Questions Comments