Multi-party key exchange for unbounded parties from indistinguishability obfuscation

Dakshita Khurana, Vanishree Rao, Amit Sahai

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

Abstract

Existing protocols for non-interactive multi-party key exchange either (1) support a bounded number of users, (2) require a trusted setup, or (3) rely on knowledge-type assumptions. We construct the first non-interactive key exchange protocols which support an unbounded number of parties and have a security proof that does not rely on knowledge assumptions. Our non-interactive keyexchange protocol does not require a trusted setup and extends easily to the identity-based setting. Our protocols suffer only a polynomial loss to the underlying hardness assumptions.

Original languageEnglish (US)
Title of host publicationAdvances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, 2015, Proceedings
EditorsJung Hee Cheon, Tetsu Iwata
PublisherSpringer
Pages52-75
Number of pages24
ISBN (Print)9783662487969
DOIs
StatePublished - 2015
Externally publishedYes
Event21st International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2015 - Auckland, New Zealand
Duration: Nov 29 2015Dec 3 2015

Publication series

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

Conference

Conference21st International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2015
Country/TerritoryNew Zealand
CityAuckland
Period11/29/1512/3/15

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Multi-party key exchange for unbounded parties from indistinguishability obfuscation'. Together they form a unique fingerprint.

Cite this