In this paper, we propose a simple redactable signature scheme for super-sets whose message-signature size is O(|M|+τ), where τ is a security parameter and M is a message to be signed. The scheme proposed by Johnson et al. in CT-RSA 2003 has the similar performance but this scheme was proven secure based on the RSA assumption in the random oracle model. In this paper, we show that such a scheme can be constructed based on the RSA assumption without the random oracles. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Nojima, R., Tamura, J., Kadobayashi, Y., & Kikuchi, H. (2009). A storage efficient redactable signature in the standard model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5735 LNCS, pp. 326–337). https://doi.org/10.1007/978-3-642-04474-8_26
Mendeley helps you to discover research relevant for your work.