Combinatorial Bounds for Authentication Codes with Arbitration

@inproceedings{Kurosawa1995CombinatorialBF,
  title={Combinatorial Bounds for Authentication Codes with Arbitration},
  author={Kaoru Kurosawa and Satoshi Obana},
  booktitle={EUROCRYPT},
  year={1995}
}
Unconditionally secure authentication codes with arbitration (A 2 -codes) protect against deceptions from the transmitter and the receiver as well as that from the opponent. In this paper, we present combinatorial lower bounds on the cheating probabilities for A 2 -codes in terms of the number of source states, that of the whole messages and that of messages which the receiver accepts as authentic for each source state. Previously, only entropy based lower bounds were known. Our bounds for the… CONTINUE READING

From This Paper

Topics from this paper.
17 Citations
7 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Cryptography -A selective survey

  • J. L. Massey
  • Alta Frequenza, vol.55, no.1, pages 4{11
  • 1986
1 Excerpt

A few results in message authenticaiton

  • E. F. Brickell
  • Congr.Numer., 43, pages 141{154
  • 1984
1 Excerpt

Similar Papers

Loading similar papers…