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

  • Authors:
  • Rafael Dowsley;Goichiro Hanaoka;Hideki Imai;Anderson C. A. Nascimento

  • Affiliations:
  • Department of Electrical Engineering, University of Brasília, Brasília, Brazil;National Institute of Advanced Industrial Science and Technology, Tokyo, Japan;National Institute of Advanced Industrial Science and Technology, Tokyo, Japan;Department of Electrical Engineering, University of Brasília, Brasília, Brazil

  • Venue:
  • WISA'10 Proceedings of the 11th international conference on Information security applications
  • Year:
  • 2010

Quantified Score

Hi-index 0.01

Visualization

Abstract

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.