On the security of a practical identification scheme

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We analyze the security of an interactive identification scheme. The scheme is the obvious extension of the original square root scheme of Goldwasser, Micali and Rackoff to 2mth roots. This scheme is quite practical, especially in terms of storage and communication complexity. Although this scheme is certainly not new, its security was apparently not fully understood. We prove that this scheme is secure if factoring integers is hard, even against active attacks where the adversary is first allowed to pose as a verifier before attempting impersonation.

Original languageEnglish (US)
Title of host publicationAdvances in Cryptology - EUROCRYPT 1996 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings
PublisherSpringer Verlag
Pages344-353
Number of pages10
Volume1070
ISBN (Print)354061186X, 9783540611868
StatePublished - 1996
Event15th International conference on Theory and Application of Cryptographic Techniques, EUROCRYPT 1996 - Saragossa, Spain
Duration: May 12 1996May 16 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1070
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other15th International conference on Theory and Application of Cryptographic Techniques, EUROCRYPT 1996
CountrySpain
CitySaragossa
Period5/12/965/16/96

Fingerprint

Identification Scheme
Communication
Communication Complexity
Factoring
Square root
Attack
Roots
Integer

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Shoup, V. (1996). On the security of a practical identification scheme. In Advances in Cryptology - EUROCRYPT 1996 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings (Vol. 1070, pp. 344-353). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1070). Springer Verlag.

On the security of a practical identification scheme. / Shoup, Victor.

Advances in Cryptology - EUROCRYPT 1996 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings. Vol. 1070 Springer Verlag, 1996. p. 344-353 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1070).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Shoup, V 1996, On the security of a practical identification scheme. in Advances in Cryptology - EUROCRYPT 1996 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings. vol. 1070, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1070, Springer Verlag, pp. 344-353, 15th International conference on Theory and Application of Cryptographic Techniques, EUROCRYPT 1996, Saragossa, Spain, 5/12/96.
Shoup V. On the security of a practical identification scheme. In Advances in Cryptology - EUROCRYPT 1996 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings. Vol. 1070. Springer Verlag. 1996. p. 344-353. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Shoup, Victor. / On the security of a practical identification scheme. Advances in Cryptology - EUROCRYPT 1996 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings. Vol. 1070 Springer Verlag, 1996. pp. 344-353 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{cd9344f4561d40edba2d9cb58b0681b3,
title = "On the security of a practical identification scheme",
abstract = "We analyze the security of an interactive identification scheme. The scheme is the obvious extension of the original square root scheme of Goldwasser, Micali and Rackoff to 2mth roots. This scheme is quite practical, especially in terms of storage and communication complexity. Although this scheme is certainly not new, its security was apparently not fully understood. We prove that this scheme is secure if factoring integers is hard, even against active attacks where the adversary is first allowed to pose as a verifier before attempting impersonation.",
author = "Victor Shoup",
year = "1996",
language = "English (US)",
isbn = "354061186X",
volume = "1070",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "344--353",
booktitle = "Advances in Cryptology - EUROCRYPT 1996 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings",

}

TY - GEN

T1 - On the security of a practical identification scheme

AU - Shoup, Victor

PY - 1996

Y1 - 1996

N2 - We analyze the security of an interactive identification scheme. The scheme is the obvious extension of the original square root scheme of Goldwasser, Micali and Rackoff to 2mth roots. This scheme is quite practical, especially in terms of storage and communication complexity. Although this scheme is certainly not new, its security was apparently not fully understood. We prove that this scheme is secure if factoring integers is hard, even against active attacks where the adversary is first allowed to pose as a verifier before attempting impersonation.

AB - We analyze the security of an interactive identification scheme. The scheme is the obvious extension of the original square root scheme of Goldwasser, Micali and Rackoff to 2mth roots. This scheme is quite practical, especially in terms of storage and communication complexity. Although this scheme is certainly not new, its security was apparently not fully understood. We prove that this scheme is secure if factoring integers is hard, even against active attacks where the adversary is first allowed to pose as a verifier before attempting impersonation.

UR - http://www.scopus.com/inward/record.url?scp=84947923743&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84947923743&partnerID=8YFLogxK

M3 - Conference contribution

SN - 354061186X

SN - 9783540611868

VL - 1070

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 344

EP - 353

BT - Advances in Cryptology - EUROCRYPT 1996 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings

PB - Springer Verlag

ER -