Identification schemes of proofs of ability secure against concurrent man-in-the-middle attacks

  • Authors:
  • Hiroaki Anada;Seiko Arita

  • Affiliations:
  • Institute of Information Security, Yokohama, Japan;Institute of Information Security, Yokohama, Japan

  • Venue:
  • ProvSec'10 Proceedings of the 4th international conference on Provable security
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We give a series of three identification schemes. All of them are basically 2-round interactive proofs of ability to complete Diffie-Hellman tuples. Despite their simple protocols, the second and the third schemes are proven secure against concurrent man-in-the-middle attacks based on tight reduction to the Gap Computational Diffie-Hellman Assumption without the random oracle. In addition, they are more efficient than challenge-and-response 2-round identification schemes from previously known EUF-CMA signature schemes in the standard model. Our first scheme is similar to half the operation of Diffie-Hellman Key-Exchange. The first scheme is secure only against two-phase attacks based on strong assumptions. Applying the tag framework, and employing a strong one-time signature for the third scheme, we get the preferable schemes above.