Affiliations: State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China. [email protected] | National Institute of Information and Communications Technology (NICT), 4-2-1, Nukui-Kitamachi, Koganei, Tokyo 184-8795, Japan | Department of Electronic and Communication Engineering, Yanshan University, Hebei 066004, China
Note: [] Also works: School of Mathematics and Computer Science, Shaanxi University of Technology, Shaanxi 723001, China
Note: [] Address for correspondence: P.Box 126, Information Security Center, Beijing University of Posts and Telecommunications, 10 Xitucheng Road, Haidian District, Beijing, China 100876.
Abstract: In this paper, we build a family of chameleon hash functions and strongly unforgeable one-time signature schemes based on the intractability assumption of the discrete logarithm problem (DLP) over inner automorphism groups. Since the DLP assumption over inner automorphism groups does not admit sub-exponential attacks, thus the sizes of the working parameters used in our constructions are shorten significantly. This leads to remarkable gains for our proposals both in running time and in storage space. In addition, as far as we know, this is the first time to build CHF and OTS based on noncommutative groups.
