Short Signature From Factoring Assumption in the Standard Model

Date Added: Oct 2012
Format: PDF

Digital signatures are one of the most important fundamental cryptographic primitives, which can be used to construct complex cryptographic protocols. However, most practical signatures can only be proved secure in random oracles, while signatures in standard model are often considered as less efficient or based on the stronger assumptions, such as Strong RSA assumption, Strong q-Diffie-Hellman assumption et al. In Strong q-assumption, an attacker is provided with q random "Solved instances" (leaked information) and has to compute a given, fixed instance.