Although distributed key generation (DKG) has been studied for some time,
it has never been examined outside of the synchronous communication
setting. In this talk, I will present the first practical and provably
secure asynchronous DKG protocol and its implementation for use over the
Internet. I will also discuss cryptographic properties such as uniform
randomness of the shared secret, and will provide proactive security and
group modification primitives. Notably, this asynchronous DKG protocol
requires a set agreement protocol, and implements it using a leader-based
Byzantine agreement scheme.
In the second half of the talk, I will describe applications of the DKG
protocol in designing distributed private-key generators (PKGs) for
identity-based cryptography (IBC), a pairing-based onion routing (PB-OR)
circuit construction and two robust communication protocols in distributed
hash tables. Looking in detail at PB-OR, I will describe a provably secure
privacy-preserving key agreement scheme in the IBC setting with
distributed PKG and use it to design an efficient and compact onion
routing circuit construction that is secure in the universal composability
framework.