Semigroup-homomorphic Signature
By: Heng Guo , Kun Tian , Fengxia Liu and more
Potential Business Impact:
Keeps secret messages safe even when shared.
In 2002, Johnson et al. posed an open problem at the Cryptographers' Track of the RSA Conference: how to construct a secure homomorphic signature on a semigroup, rather than on a group. In this paper, we introduce, for the first time, a semigroup-homomorphic signature scheme. Under certain conditions, we prove that the security of this scheme is based on the hardness of the Short Integer Solution (SIS) problem and is tightly secure. Furthermore, we extend it to a linear semigroup-homomorphic signature scheme over lattices, and this scheme can also ensure privacy.
Similar Papers
Invariant-Based Cryptography
Cryptography and Security
Secures secret messages using hidden math tricks.
On key exchange protocol based on Two-side multiplication action
Cryptography and Security
Breaks secret codes by solving math puzzles.
Secured Encryption scheme based on the Ree groups
Cryptography and Security
Makes secret codes much harder to break.