Multiparty Protocols
summary
Shows a multiparty non‑interactive key exchange from a new Ring Key‑Homomorphic weak PRF primitive, with concrete N‑party construction using public matrices Y0…YN‑1 and secret matrices S1…SN so all parties derive AY0BY1C…AN‑1, proving correctness algebraically and security by pseudorandomness of large matrix products plus the leftover hash lemma; rules out Field key‑homomorphic weak PRFs and leaves open concrete instantiations. Separately, gives a covert‑security paradigm using short MACs, applies it to TinyOT, claims ~35% communication savings for 40‑bit MACs and a deterrence‑replacement theorem with only constant overhead.
AI-written summary · about
chapters (13)
- 0:00Intro
- 0:16Key Exchange
- 4:52Definitions
- 8:01Construction: 3-party NIKE from RKHWPRF
- 11:07Proof Outline
- 12:06Pseudorandomness of Matrix Products over Output Ring
- 17:58Future Directions
- 22:52Types of Adversaries
- 26:07Offline/Online Approach
- 32:26TinyOT Overview
- 34:31Evaluation - Offline Communication Complexity
- 38:00Benefit of the Deterrence Replacement Theorem
- 39:05Take-Home Messages
related talks
01h 10mSecure Multiparty Computation II
40mAuthentication and Key Exchange
32mSymmetric Key Exchange: Lightweight Alternatives for a Post-Quantum IoT
28mTwo Round MPC via Multi-Key FHE
40mPost-quantum Key Exchange—A New Hope
58mSecure Multiparty Computation I
01h 08mSecure Computation 1
36mPublic Key Cryptography