You are here

FAU Collections » FAU Research Repository » FAU Theses and Dissertations

Efficient implementation of zero-knowledge based identification protocols

Download pdf | Full Screen View

Date Issued:
2004
Summary:
A zero knowledge identification protocol is an interactive proof system that allows a person to prove that he knows a secret key associated with his identity without revealing the secret key. This type of protocol is the topic of a fairy tale, by Gustavus Simmons called the King's Dilemma, about a king and the problem he has with thieves impersonating his tax collectors. It describes a zero-knowledge identification protocol that will rid the king of his problem. I present this system, the motivation for this thesis, and the transformations from this protocol, that uses lead weights and containers, to protocols that use mathematical elements. The security of these protocols is determined by the complexity of the underlying mathematical problem, such as the knapsack and discrete logarithm problem, and three properties: completeness, soundness, and zero knowledge.
Title: Efficient implementation of zero-knowledge based identification protocols.
87 views
24 downloads
Name(s): Barella, Michelle Elizabeth.
Florida Atlantic University, Degree grantor
Mullin, Ronald C., Thesis advisor
Type of Resource: text
Genre: Electronic Thesis Or Dissertation
Issuance: monographic
Date Issued: 2004
Publisher: Florida Atlantic University
Place of Publication: Boca Raton, Fla.
Physical Form: application/pdf
Extent: 73 p.
Language(s): English
Summary: A zero knowledge identification protocol is an interactive proof system that allows a person to prove that he knows a secret key associated with his identity without revealing the secret key. This type of protocol is the topic of a fairy tale, by Gustavus Simmons called the King's Dilemma, about a king and the problem he has with thieves impersonating his tax collectors. It describes a zero-knowledge identification protocol that will rid the king of his problem. I present this system, the motivation for this thesis, and the transformations from this protocol, that uses lead weights and containers, to protocols that use mathematical elements. The security of these protocols is determined by the complexity of the underlying mathematical problem, such as the knapsack and discrete logarithm problem, and three properties: completeness, soundness, and zero knowledge.
Identifier: 9780496094523 (isbn), 13181 (digitool), FADT13181 (IID), fau:10040 (fedora)
Collection: FAU Electronic Theses and Dissertations Collection
Note(s): Charles E. Schmidt College of Science
Thesis (M.S.)--Florida Atlantic University, 2004.
Subject(s): Cryptography
Telecommunication systems--Security measures
Knapsack problem (Mathematics)
Mathematical optimization
Finite fields (Algebra)
Data encryption (Computer science)
Held by: Florida Atlantic University Libraries
Persistent Link to This Record: http://purl.flvc.org/fcla/dt/13181
Sublocation: Digital Library
Use and Reproduction: Copyright © is held by the author, with permission granted to Florida Atlantic University to digitize, archive and distribute this item for non-profit research and educational purposes. Any reuse of this item in excess of fair use or other copyright exemptions requires permission of the copyright holder.
Use and Reproduction: http://rightsstatements.org/vocab/InC/1.0/
Host Institution: FAU
Is Part of Series: Florida Atlantic University Digital Library Collections.