Adaptive Multiparty NIKE

Venkata Koppula; Brent Waters; Mark Zhandry

Paper 2022/1324

Adaptive Multiparty NIKE

Venkata Koppula, Indian Institute of Technology Delhi

Brent Waters, The University of Texas at Austin

Mark Zhandry, Princeton University

Abstract

We construct adaptively secure multiparty non-interactive key exchange (NIKE) from polynomially hard indistinguishability obfuscation and other standard assumptions. This improves on all prior such protocols, which required sub-exponential hardness. Along the way, we establish several compilers which simplify the task of constructing new multiparty NIKE protocols, and also establish a close connection with a particular type of constrained PRF.

Metadata

Available format(s): PDF
Category: Foundations
Publication info: A minor revision of an IACR publication in TCC 2022
Contact author(s): kvenkata @ cse iitd ac in
bwaters @ cs utexas edu
mzhandry @ gmail com
History: 2022-10-05: approved; 2022-10-05: received; See all versions
Short URL: https://ia.cr/2022/1324
License: CC BY

BibTeX

@misc{cryptoeprint:2022/1324,
      author = {Venkata Koppula and Brent Waters and Mark Zhandry},
      title = {Adaptive Multiparty NIKE},
      howpublished = {Cryptology ePrint Archive, Paper 2022/1324},
      year = {2022},
      note = {\url{https://eprint.iacr.org/2022/1324}},
      url = {https://eprint.iacr.org/2022/1324}
}