On the security of a practical identification scheme

Victor Shoup

doi:10.1007/3-540-68339-9_30

On the security of a practical identification scheme

Victor Shoup

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	Advances in Cryptology - EUROCRYPT 1996 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings
Editors	Ueli Maurer
Publisher	Springer Verlag
Pages	344-353
Number of pages	10
ISBN (Print)	354061186X, 9783540611868
DOIs	https://doi.org/10.1007/3-540-68339-9_30
State	Published - 1996
Event	15th International conference on Theory and Application of Cryptographic Techniques, EUROCRYPT 1996 - Saragossa, Spain Duration: May 12 1996 → May 16 1996

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1070
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	15th International conference on Theory and Application of Cryptographic Techniques, EUROCRYPT 1996
Country/Territory	Spain
City	Saragossa
Period	5/12/96 → 5/16/96

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-68339-9_30

Cite this

Shoup, V. (1996). On the security of a practical identification scheme. In U. Maurer (Ed.), Advances in Cryptology - EUROCRYPT 1996 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings (pp. 344-353). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1070). Springer Verlag. https://doi.org/10.1007/3-540-68339-9_30

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. ed. / Ueli Maurer. 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 proceeding › Conference contribution

Shoup, V 1996, On the security of a practical identification scheme. in U Maurer (ed.), Advances in Cryptology - EUROCRYPT 1996 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings. 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. https://doi.org/10.1007/3-540-68339-9_30

Shoup V. On the security of a practical identification scheme. In Maurer U, editor, Advances in Cryptology - EUROCRYPT 1996 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings. Springer Verlag. 1996. p. 344-353. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-68339-9_30

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. editor / Ueli Maurer. 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",

doi = "10.1007/3-540-68339-9_30",

language = "English (US)",

isbn = "354061186X",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "344--353",

editor = "Ueli Maurer",

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

note = "15th International conference on Theory and Application of Cryptographic Techniques, EUROCRYPT 1996 ; Conference date: 12-05-1996 Through 16-05-1996",

}

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

U2 - 10.1007/3-540-68339-9_30

DO - 10.1007/3-540-68339-9_30

M3 - Conference contribution

AN - SCOPUS:84947923743

SN - 354061186X

SN - 9783540611868

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

A2 - Maurer, Ueli

PB - Springer Verlag

T2 - 15th International conference on Theory and Application of Cryptographic Techniques, EUROCRYPT 1996

Y2 - 12 May 1996 through 16 May 1996

ER -

On the security of a practical identification scheme

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this