SYSTEM AUTHENTIFICATING AT LEAST ONE PROOF INSTRUMENT BY COLLATOR

摘要

PURPOSE: To perform the high-speed confirmation of a prover by a verifier and the use of the public and secret keys of an appropriate size by confirming at least one prover by the verifier, realizing authentication by using a knowledgeless type protocol and establishing the public key by constrained linear equations. CONSTITUTION: The prover presents the identification or the signed public key to the verifier and the verifier collates whether or not the identification matches with a vector P. Then, the two vectors U and V of orders (m) and (n) composed of integers 0-d-1 and the permutations (p) and (q) of the (m) and (n) pieces of elements are chosen at random. The prover calculates commitment indicated by equations h1 -h3 and sends it out to the verifier and a random number (b) is selected and sent to the prover. The prover sends out a response (r) to the (b)=1-3 to the verifier. The verifier receives (r), checks h1 -h3 for (b)=1-3, calculates the vectors U"-U, (p) and V"-V, (q) and checks whether or not constitution is performed only from the element of X. In the case that all the tests are success, it is considered that an authentication protocol is successfully ended.