A Study of Blind Message Authentication Codes

Chanathip NAMPREMPRE; Gregory NEVEN; Michel ABDALLA

doi:10.1093/ietfec/e90-a.1.75

A Study of Blind Message Authentication Codes

Chanathip NAMPREMPRE, Gregory NEVEN, Michel ABDALLA

Full Text Views

0

Cite this

Summary :

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 moving from asymmetric to symmetric cryptosystems. Our main result is a negative one however: we show that the natural symmetric analogs of the unforgeability and blindness requirements cannot be simultaneously satisfied. Faced with this impossibility, 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 existence; it uses an underlying blind signature scheme, and hence does not achieve the desired performance benefits. The construction of an efficient blind MAC scheme in this restrictive setting is left as an open problem^*.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E90-A No.1 pp.75-82

Publication Date: 2007/01/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1093/ietfec/e90-a.1.75

Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security)

Category: Signatures

Cite this

Copy

Chanathip NAMPREMPRE, Gregory NEVEN, Michel ABDALLA, "A Study of Blind Message Authentication Codes" in IEICE TRANSACTIONS on Fundamentals, vol. E90-A, no. 1, pp. 75-82, January 2007, doi: 10.1093/ietfec/e90-a.1.75.
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 moving from asymmetric to symmetric cryptosystems. Our main result is a negative one however: we show that the natural symmetric analogs of the unforgeability and blindness requirements cannot be simultaneously satisfied. Faced with this impossibility, 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 existence; it uses an underlying blind signature scheme, and hence does not achieve the desired performance benefits. The construction of an efficient blind MAC scheme in this restrictive setting is left as an open problem^*.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e90-a.1.75/_p

Copy

@ARTICLE{e90-a_1_75,
author={Chanathip NAMPREMPRE, Gregory NEVEN, Michel ABDALLA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Study of Blind Message Authentication Codes},
year={2007},
volume={E90-A},
number={1},
pages={75-82},
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 moving from asymmetric to symmetric cryptosystems. Our main result is a negative one however: we show that the natural symmetric analogs of the unforgeability and blindness requirements cannot be simultaneously satisfied. Faced with this impossibility, 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 existence; it uses an underlying blind signature scheme, and hence does not achieve the desired performance benefits. The construction of an efficient blind MAC scheme in this restrictive setting is left as an open problem^*.},
keywords={},
doi={10.1093/ietfec/e90-a.1.75},
ISSN={1745-1337},
month={January},}

Copy

TY - JOUR
TI - A Study of Blind Message Authentication Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 75
EP - 82
AU - Chanathip NAMPREMPRE
AU - Gregory NEVEN
AU - Michel ABDALLA
PY - 2007
DO - 10.1093/ietfec/e90-a.1.75
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E90-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2007
AB - 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 moving from asymmetric to symmetric cryptosystems. Our main result is a negative one however: we show that the natural symmetric analogs of the unforgeability and blindness requirements cannot be simultaneously satisfied. Faced with this impossibility, 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 existence; it uses an underlying blind signature scheme, and hence does not achieve the desired performance benefits. The construction of an efficient blind MAC scheme in this restrictive setting is left as an open problem^*.
ER -