Practical UC security with a global random oracle

Ran Canetti, Abhishek Jain, Alessandra Scafuro

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Contrary to prior belief, we show that there exist commitment, zero-knowledge and general function evaluation protocols with universally composable security, in a model where all parties and all protocols have access to a single, global, random oracle and no other trusted setup. This model provides significantly stronger composable security guarantees than the traditional random oracle model of Bellare and Rogaway [CCS'93] or even the common reference string model. Indeed, these latter models provide no security guarantees in the presence of arbitrary protocols that use the same random oracle (or reference string or hash function). Furthermore, our protocols are highly efficient. Specifically, in the interactive setting, our commitment and general computation protocols are much more efficient than the best known ones due to Lindell [Crypto'11,'13] which are secure in the common reference string model. In the non-interactive setting, our protocols are slightly less efficient than the best known ones presented by Afshar et al. [Euro-crypt '14] but do away with the need to rely on a non-global (programmable) reference string.

Original languageEnglish
Title of host publicationProceedings of the ACM Conference on Computer and Communications Security
PublisherAssociation for Computing Machinery
Pages597-608
Number of pages12
ISBN (Print)9781450329576
DOIs
StatePublished - 3 Nov 2014
Event21st ACM Conference on Computer and Communications Security, CCS 2014 - Scottsdale, United States
Duration: 3 Nov 20147 Nov 2014

Publication series

NameProceedings of the ACM Conference on Computer and Communications Security
ISSN (Print)1543-7221

Conference

Conference21st ACM Conference on Computer and Communications Security, CCS 2014
Country/TerritoryUnited States
CityScottsdale
Period3/11/147/11/14

Keywords

  • Global random oracle model
  • Secure computation
  • Universal composition

Fingerprint

Dive into the research topics of 'Practical UC security with a global random oracle'. Together they form a unique fingerprint.

Cite this