GNUC: A New Universal Composability Framework

Dennis Hofheinz, Victor Shoup

Research output: Contribution to journalArticle

Abstract

We put forward a framework for the modular design and analysis of multi-party protocols. Our framework is called “GNUC” (with the recursive meaning “GNUC’s Not UC”), already alluding to the similarity to Canetti’s Universal Composability (UC) framework. In particular, like UC, we offer a universal composition theorem, as well as a theorem for composing protocols with joint state. We deviate from UC in several important aspects. Specifically, we have a rather different view than UC on the structuring of protocols, on the notion of polynomial-time protocols and attacks, and on corruptions. We will motivate our definitional choices by explaining why the definitions in the UC framework are problematic, and how we overcome these problems. Our goal is to offer a framework that is largely compatible with UC, such that previous results formulated in UC carry over to GNUC with minimal changes. We exemplify this by giving explicit formulations for several important protocol tasks, including authenticated and secure communication, as well as commitment and secure function evaluation.

Original languageEnglish (US)
Pages (from-to)423-508
Number of pages86
JournalJournal of Cryptology
Volume28
Issue number3
DOIs
StatePublished - Jul 12 2015

Fingerprint

Universal Composability
Function evaluation
Polynomials
Chemical analysis
Modular Design
Secure communication
Framework
Secure Communication
Evaluation Function
Theorem
Polynomial time
Attack

Keywords

  • Composition
  • Protocols
  • Universal composability

ASJC Scopus subject areas

  • Applied Mathematics
  • Computer Science Applications
  • Software

Cite this

GNUC : A New Universal Composability Framework. / Hofheinz, Dennis; Shoup, Victor.

In: Journal of Cryptology, Vol. 28, No. 3, 12.07.2015, p. 423-508.

Research output: Contribution to journalArticle

Hofheinz, Dennis ; Shoup, Victor. / GNUC : A New Universal Composability Framework. In: Journal of Cryptology. 2015 ; Vol. 28, No. 3. pp. 423-508.
@article{32c29c072c0b475eb8ee580cfc6f45bb,
title = "GNUC: A New Universal Composability Framework",
abstract = "We put forward a framework for the modular design and analysis of multi-party protocols. Our framework is called “GNUC” (with the recursive meaning “GNUC’s Not UC”), already alluding to the similarity to Canetti’s Universal Composability (UC) framework. In particular, like UC, we offer a universal composition theorem, as well as a theorem for composing protocols with joint state. We deviate from UC in several important aspects. Specifically, we have a rather different view than UC on the structuring of protocols, on the notion of polynomial-time protocols and attacks, and on corruptions. We will motivate our definitional choices by explaining why the definitions in the UC framework are problematic, and how we overcome these problems. Our goal is to offer a framework that is largely compatible with UC, such that previous results formulated in UC carry over to GNUC with minimal changes. We exemplify this by giving explicit formulations for several important protocol tasks, including authenticated and secure communication, as well as commitment and secure function evaluation.",
keywords = "Composition, Protocols, Universal composability",
author = "Dennis Hofheinz and Victor Shoup",
year = "2015",
month = "7",
day = "12",
doi = "10.1007/s00145-013-9160-y",
language = "English (US)",
volume = "28",
pages = "423--508",
journal = "Journal of Cryptology",
issn = "0933-2790",
publisher = "Springer New York",
number = "3",

}

TY - JOUR

T1 - GNUC

T2 - A New Universal Composability Framework

AU - Hofheinz, Dennis

AU - Shoup, Victor

PY - 2015/7/12

Y1 - 2015/7/12

N2 - We put forward a framework for the modular design and analysis of multi-party protocols. Our framework is called “GNUC” (with the recursive meaning “GNUC’s Not UC”), already alluding to the similarity to Canetti’s Universal Composability (UC) framework. In particular, like UC, we offer a universal composition theorem, as well as a theorem for composing protocols with joint state. We deviate from UC in several important aspects. Specifically, we have a rather different view than UC on the structuring of protocols, on the notion of polynomial-time protocols and attacks, and on corruptions. We will motivate our definitional choices by explaining why the definitions in the UC framework are problematic, and how we overcome these problems. Our goal is to offer a framework that is largely compatible with UC, such that previous results formulated in UC carry over to GNUC with minimal changes. We exemplify this by giving explicit formulations for several important protocol tasks, including authenticated and secure communication, as well as commitment and secure function evaluation.

AB - We put forward a framework for the modular design and analysis of multi-party protocols. Our framework is called “GNUC” (with the recursive meaning “GNUC’s Not UC”), already alluding to the similarity to Canetti’s Universal Composability (UC) framework. In particular, like UC, we offer a universal composition theorem, as well as a theorem for composing protocols with joint state. We deviate from UC in several important aspects. Specifically, we have a rather different view than UC on the structuring of protocols, on the notion of polynomial-time protocols and attacks, and on corruptions. We will motivate our definitional choices by explaining why the definitions in the UC framework are problematic, and how we overcome these problems. Our goal is to offer a framework that is largely compatible with UC, such that previous results formulated in UC carry over to GNUC with minimal changes. We exemplify this by giving explicit formulations for several important protocol tasks, including authenticated and secure communication, as well as commitment and secure function evaluation.

KW - Composition

KW - Protocols

KW - Universal composability

UR - http://www.scopus.com/inward/record.url?scp=84930759315&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84930759315&partnerID=8YFLogxK

U2 - 10.1007/s00145-013-9160-y

DO - 10.1007/s00145-013-9160-y

M3 - Article

VL - 28

SP - 423

EP - 508

JO - Journal of Cryptology

JF - Journal of Cryptology

SN - 0933-2790

IS - 3

ER -