VARIANTS OF THE FIAT-SHAMIR IDENTIFICATION AND SIGNATURE SCHEME

摘要

ABSTRACTA method of proving the identify of an entitycomprising the steps of establishing a public key for the entityconsisting of a modulus n which is the product of at least twoprime numbers, and a sequence of k numbers vl,...,vk; computing aprivate key for the entity consisting of k numbers sl,...,sksatisfying sjdvj=l (mod n) for all l?j?k, where d is auniversally known constant larger than l; transmitting from theentity to a verifier x=rd (mod n) where r is a random number inthe range orn; transmitting from the verifier to the entity asequence of k random numbers el,...,ek in the range o?ejd;transmitting from the entity to the verifier the value (mod n); and verifying the identity of the entity bychecking that (mod n).