| 摘要 |
PROBLEM TO BE SOLVED: To obtain higher tolerance to a coalition attack by making the value for respective components of divided vectors different, showing specific divided information obtained by dividing specific information of an entity into blocks, setting individual secret random numbers characteristic of entities set by the divided blocks, and generation a secret key by using an individual secret random number and a divided vector. SOLUTION: ID vectors as prescribed information representing the names, addresses, etc., of respective entities are generated as L-dimensional binary vectors and divided into J ID divided vectors Iej (j=1, 2,..., J) by block size M1 bits, M2 bits,..., and MJ bits. In each ID divided vector Iej, an individual secret random number is not fixed, and mutually different individual secret random numbers are set for respective components in the ID divided vectors Iej. A set individual secret random number and an ID divided vector Iej are used to generate a secret key which is unique to each entity.
|
