On the composability of statistically secure bit commitments

Rafael Dowsley, Jeroen Van De Graaf, Jörn Müller-Quade, Anderson C.A. Nascimento

Research output: Contribution to journalArticleResearchpeer-review

12 Citations (Scopus)

Abstract

We show that for bit commitment schemes based on two-party stateless primitives, the stand-alone statistical security implies the statistical universally composable security. I.e., all such schemes are secure with an unlimited adversary, an unlimited simulator and an unlimited environment machine in the universal composability framework. Especially, these protocols can be used in arbitrary statistically secure applications without lowering the security.

Original languageEnglish
Pages (from-to)509-516
Number of pages8
JournalJournal of Internet Technology
Volume14
Issue number3
DOIs
Publication statusPublished - 2013
Externally publishedYes

Keywords

  • Commitment
  • Noisy channels
  • Two-Party stateless primitives
  • Universal composability

Cite this