2009 | OriginalPaper | Buchkapitel
A Storage Efficient Redactable Signature in the Standard Model
verfasst von : Ryo Nojima, Jin Tamura, Youki Kadobayashi, Hiroaki Kikuchi
Erschienen in: Information Security
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.