Key Agreement
Two-party protocols for agreeing on a shared secret, and their black-box (im)possibility from weaker primitives.
| Status | Statement | Tags |
|---|---|---|
|
No key agreement from GC-OWF Open for round complexity growing with the security parameter. Proved in full for two messages, which is public-key encryption; the constant-round extension is sketched in the paper’s appendix without a theorem, its security half deferred to the PKE proof. 5 open |
Black Box SeparationsGarbled CircuitsKey Agreementotherseparationadaptation (ai) | |
|
OWFs are black-box useless for key agreement Open in the general case, which the paper names as the central open problem left by its work. Settled for three restricted protocol classes: constant-query perfect, constant-round constant-query imperfect, and Merkle-type. 5 open |
Black Box SeparationsKey AgreementOne Way Functionsotherimpossibility |
No matching items