Adaptive Multiparty NIKE

Venkata Koppula, Brent Waters, Mark Zhandry

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationTheory of Cryptography - 20th International Conference, TCC 2022, Proceedings
EditorsEike Kiltz, Vinod Vaikuntanathan
PublisherSpringer Science and Business Media Deutschland GmbH
Pages244-273
Number of pages30
ISBN (Print)9783031223648
DOIs
StatePublished - 2022
Event20th Theory of Cryptography Conference, TCC 2022 - Chicago, United States
Duration: Nov 7 2022Nov 10 2022

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13748 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference20th Theory of Cryptography Conference, TCC 2022
Country/TerritoryUnited States
CityChicago
Period11/7/2211/10/22

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Adaptive Multiparty NIKE'. Together they form a unique fingerprint.

Cite this