This preview shows page 1. Sign up to view the full content.
Unformatted text preview: ich a number of different people can sequentially sign a message [1200]. This scheme has been proposed for smartcard implementation [850]. Patents
FiatShamir is patented [1427]. Anyone interested in licensing the algorithm should contact Yeda Research and Development, The Weizmann Institute of Science, Rehovot 76100, Israel. 21.2 GuillouQuisquater
FeigeFiatShamir was the first practical identitybased protocol. It minimized computation by increasing the number of iterations and accreditations per iteration. For some implementations, like smart cards, this is less than ideal. Exchanges with the outside world are timeconsuming, and the storage required for each accreditation can strain the limited resources of the card. Louis Guillou and JeanJacques Quisquater developed a zeroknowledge identification algorithm more suited to applications like these [670,1280]. The exchanges between Peggy and Victor and the parallel accreditations in each exchange are both kept to an absolute minimum: There is only one exchange of one accreditation for each proof. For the same level of security, the computation required by GuillouQuisquater is greater than by FeigeFiatShamir by a factor of three. And like FeigeFiatShamir, this identification algorithm can be converted to a digital signature algorithm. GuillouQuisquater Identification Scheme
Peggy is a smart card who wants to prove her identity to Victor. Peggy’s identity consists of a set of credentials: a data string consisting of the card’s name, validity period, a bank account number, and whatever else the application warrants. This bit string is called J. (Actually, the credentials can be a longer string and hashed to a J value. This complexity does not modify the protocol in any way.) This is analogous to the public key. Other public information, shared by all “Peggys” who could use this application, is an exponent v and a modulus n, where n is the product of two secret primes. The private key is B, calculated such that JBv a 1 (mod n). Peggy sends Victor her credential...
View Full
Document
 Fall '10
 ALIULGER
 Cryptography

Click to edit the document details