Abstract
A signature scheme is presented that, when combined with the Groth-Sahai proof system, can efficiently prove the validity of a committed signature to a message shown in the clear. Compared to the Boneh-Boyen signature scheme, the proposed scheme yields a shorter proof of validity and is based on a more desirable hardness assumption that achieves a better security bound when analyzed in the generic group model. © 2011 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Abe, M., & Ohkubo, M. (2011). A signature scheme with efficient proof of validity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6639 LNCS, pp. 1–10). https://doi.org/10.1007/978-3-642-20901-7_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
