A Study of Blind Message Authentication Codes

Abstract : Blind signatures allow a signer to digitally sign a document without being able to glean any information about the document. In this paper, we investigate the symmetric analog of blind signatures, namely blind message authentication codes (blind MACs). One may hope to get the same efficiency gain from blind MAC constructions as is usually obtained when mov- ing from asymmetric to symmetric cryptosystems. Our main result is a negative one however: we show that the natural sym- metric analogs of the unforgeability and blindness requirements cannot be simultaneously satisfied. Faced with this impossibil- ity, we show that blind MACs do exist (under the one-more RSA assumption in the random oracle model) in a more restrictive setting where users can share common state information. Our construction, however, is only meant to demonstrate the exis- tence; it uses an underlying blind signature scheme, and hence does not achieve the desired performance benefits. The construc- tion of an efficient blind MAC scheme in this restrictive setting is left as an open problem.
Type de document :
Article dans une revue
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Institute of Electronics, Information and Communication Engineers, 2007, E90-A (1), pp.75-82. 〈10.1093/ietfec/e90-a.1.75〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00918388
Contributeur : Michel Abdalla <>
Soumis le : vendredi 13 décembre 2013 - 14:30:45
Dernière modification le : jeudi 11 janvier 2018 - 06:22:10

Identifiants

Collections

Citation

Chanathip Namprempre, Gregory Neven, Michel Abdalla. A Study of Blind Message Authentication Codes. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Institute of Electronics, Information and Communication Engineers, 2007, E90-A (1), pp.75-82. 〈10.1093/ietfec/e90-a.1.75〉. 〈hal-00918388〉

Partager

Métriques

Consultations de la notice

131