Round-optimal deniable ring authentication in the presence of big brother

Rafael Dowsley, Goichiro Hanaoka, Hideki Imai, Anderson C.A. Nascimento

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

6 Citations (Scopus)


In this work we propose a Deniable Ring Authentication scheme secure against a powerful Big Brother type of adversary and yielding an optimal number of communication rounds. Our scheme is based on an infra-structure assumption: the existence of verifiable Broadcast Encryption. Particularly, our solution can be instantiated by using the Broadcast Encryption protocol of Boneh, Gentry and Waters (CRYPTO 2005), resulting in a Deniable Ring Authentication protocol with constant message size.

Original languageEnglish
Title of host publicationInformation Security Applications - 11th International Workshop, WISA 2010, Revised Selected Papers
EditorsYongwha Chung, Moti Yung
Number of pages15
ISBN (Print)9783642179549
Publication statusPublished - 2010
Externally publishedYes
EventInternational Workshop on Information Security Applications 2010 - Jeju Island, Korea, Republic of (South)
Duration: 24 Aug 201026 Aug 2010
Conference number: 11th (Proceedings)

Publication series

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


WorkshopInternational Workshop on Information Security Applications 2010
Abbreviated titleWISA 2010
Country/TerritoryKorea, Republic of (South)
CityJeju Island
Internet address


  • Big Brother
  • Broadcast Encryption
  • Deniable Ring Authentication

Cite this