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. © 2011 Springer-Verlag.
CITATION STYLE
Dowsley, R., Hanaoka, G., Imai, H., & Nascimento, A. C. A. (2011). Round-optimal deniable ring authentication in the presence of big brother. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6513 LNCS, pp. 307–321). Springer Verlag. https://doi.org/10.1007/978-3-642-17955-6_23
Mendeley helps you to discover research relevant for your work.