Volume 2 - Issue 3 – 4
Short signature from factoring assumption in the standard model
- Zhiwei Wang
College of Computer, Nanjing University of Posts and Telecommunications Nanjing, 210046, China
zhwwang@njupt.edu.cn
- Guozi Sun
College of Computer, Nanjing University of Posts and Telecommunications Nanjing, 210046, China
sun@njupt.edu.cn
- Danwei Chen
College of Computer, Nanjing University of Posts and Telecommunications Nanjing, 210046, China
chendw@njupt.edu.cn
Keywords: signature, factoring problem, Programmable hash functions, standard model, provable security.
Abstract
Programmable hash functions (PHFs) is a new cryptographic primitive, which can mimic certain
programmability properties of random oracles. Due to these properties, PHFs are very useful to con-
struct short signatures in standard models. Based on (m,1)-PHF, we propose an efficient construction
of short signature from factoring problem. Our signature doesn’t require the generation of primes at
signing, and it can resist the information leakage to some extent.