| 摘要 |
PROBLEM TO BE SOLVED: To reduce computation costs and communication costs as to certification of knowledge using encryption technique and verification thereof. SOLUTION: A knowledge certifying device considers that a certification side knows s<SB>i</SB>b<SB>i</SB>for elements P, G<SB>i,o</SB>=s<SB>i,o</SB>P, and G<SB>i,1</SB>=s<SB>i,1</SB>P of a finite group (g) of certain order (q) (where s<SB>i,o</SB>and s<SB>i,1</SB>are natural numbers below (q) and i=1 to (n)). The certification side generates numerals ci and bi based upon R0, R1, ci, and 1-bi as to i=1 to (n) from equations 1-1 and 1-2 (where äf¾bi=1} represents a set of i's such that bi=1 as to i=1 to (n), and äi¾bi=0} is the same), calculates equations 2-1 and 2-2, and outputs certification information. COPYRIGHT: (C)2008,JPO&INPIT
|
