ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Anonymous Authentication with Shared Secrets

Alwen, Joel and Hirt, Martin and Maurer, Ueli and Patra, Arpita and Raykov, Pavel (2015) Anonymous Authentication with Shared Secrets. In: 3rd International Conference on Cryptology and Information Security in Latin America, SEP 17-19, 2014, Florianopolis, BRAZIL, pp. 219-236.

Full text not available from this repository. (Request a copy)
Official URL: http://dx.doi.org/10.1007/978-3-319-16295-9_12

Abstract

Anonymity and authenticity are both important yet often conflicting security goals in a wide range of applications. On the one hand for many applications (say for access control) it is crucial to be able to verify the identity of a given legitimate party (a.k.a. entity authentication). Alternatively an application might require that no one but a party can communicate on its behalf (a.k.a. message authentication). Yet, on the other hand privacy concerns also dictate that anonymity of a legitimate party should be preserved; that is no information concerning the identity of parties should be leaked to an outside entity eavesdropping on the communication. This conflict becomes even more acute when considering anonymity with respect to an active entity that may attempt to impersonate other parties in the system. In this work we resolve this conflict in two steps. First we formalize what it means for a system to provide both authenticity and anonymity even in the presence of an active man-in-the-middle adversary for various specific applications such as message and entity authentication using the constructive cryptography framework of Mau11, MR11]. Our approach inherits the composability statement of constructive cryptography and can therefore be directly used in any higher-level context. Next we demonstrate several simple protocols for realizing these systems, at times relying on a new type of (probabilistic) Message Authentication Code (MAC) called key indistinguishable (KI) MACs. Similar to the key hiding encryption schemes of BBDP01] they guarantee that tags leak no discernible information about the keys used to generate them.

Item Type: Conference Proceedings
Related URLs:
Additional Information: Copy right for this article belongs to the SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
Department/Centre: Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited: 19 Nov 2015 04:57
Last Modified: 19 Nov 2015 04:57
URI: http://eprints.iisc.ernet.in/id/eprint/52793

Actions (login required)

View Item View Item