| 摘要 |
A group structure preserving signature system that can be applied to groups based on symmetric bilinear mapping, that reduces the signature length, and that enables efficient computation of verification equations is provided. At least, information indicating p, G 1 , G 2 , G T , e, g 1 , and g 2 , information needed to obtain e(h u , h v ), and data that includes g s , h s , g t , h t , {g 1 , h 1 }, ..., {g K , h K } are held as a public key vk, and data that includes vk, ³ s , ´ s , ³ t , ´ t , ´ u , ´ v , {³ 1 , ´ 1 }, ..., {³ K , ´ K } are held as a secret key sk. A signature device selects ¶ and p at random from integers between 0 and p - 1, both inclusive, obtains w, s, t, and r, and generates, as a signature Ã, data that includes w, s, t, and r. A verification device verifies the signature à by using two verification equations. |
