| 摘要 |
PROBLEM TO BE SOLVED: To realize an efficient key deposition system for a prime factorization type open key cipher while reducing the amount of communication and calculation by authenticating the holding of secret information on a certifier's commitment when a computing element meets specific requirements. SOLUTION: A certifier 100 calculates t=BC(b ,n) (w,η) using a random number generator and a commitment computing BC unit, while a verifier 200 generates a random number using a random number generator and sends it to the certifier 100; and the certifier 100 calculates X=es+wmodn and R= r<e>ηb<k> modN (here k=es+w/n) with an arithmetical operating unit and sends the results to the verifier 200, which performs authentication by making use of a verification unit VCHECK. When BC(b ,n) (X, R)=tc<e> (modN) is satisfied, VCHECK=(X, R, c, t, e, n)=0 is outputted, but when not, 1 is outputted. The verifier 200 authenticate the holding of secret information (s) by the certifier 100 for commitment (c).
|
