Please use this identifier to cite or link to this item:
|Statistics||SHARE CORE MendeleyBASE||
|Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL|
Identity-based ring signatures from RSA
|Keywords:||Identity-based ring signatures|
|Citation:||Theoretical Computer Science 389(1-2): 100-117 (2007)|
|Abstract:||Shamir proposed in 1984 the first identity-based signature scheme, whose security relies on the RSA problem. A similar scheme was proposed by Guillou and Quisquater in 1988. Formal security of these schemes was not argued and/or proved until many years later [D. Pointcheval, J. Stern, Security arguments for digital signatures and blind signatures, Journal of Cryptology 13 (3) (2000) 361–396; Y. Dodis, J. Katz, S. Xu, M. Yung, Strong key-insulated signature schemes, in: Proceedings of PKC’03, in: LNCS, vol. 2567, Springer-Verlag, 2002, pp. 130–144; M. Bellare, C. Namprempre, G. Neven, Security proofs for identity-based identification and signature schemes, in: Proceedings of Eurocrypt’04, in: LNCS, vol. 3027, Springer-Verlag, 2004, pp. 268–286].|
Taking the Guillou–Quisquater scheme as the starting point, we design and analyze in this work ring signature schemes and distributed ring signature schemes for identity-based scenarios whose security is based on the hardness of the RSA problem. These are the first identity-based ring signature schemes which do not employ bilinear pairings. Furthermore, the resulting schemes satisfy an interesting property: the real author(s) of a ring signature can later open the anonymity and prove that he is actually the person who signed the message.
|Description:||18 pages.-- Printed version published on Dec 10, 2007.|
|Publisher version (URL):||http://dx.doi.org/10.1016/j.tcs.2007.08.002|
|Appears in Collections:||(IIIA) Artículos|
Files in This Item:
There are no files associated with this item.