Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
In this paper we present a family of transforms that map existentially unforgeable signature schemes to signature schemes being strongly unforgeable. In spite of rising security, the transforms let us make a signature on a union of messages at once. The number of elements in this union depends on the signing algorithm of a scheme being transformed. In addition to that we define an existentially unforgeable signature scheme based on pairings, which satisfies all assumptions of the first part and is able to be subjected to transformation.
Słowa kluczowe
Rocznik
Tom
Strony
473--480
Opis fizyczny
Bibliogr. 5 poz.
Twórcy
autor
- Faculty of Cybernetics, Military University of Technology, Warsaw, Poland
Bibliografia
- [1] J. An, Y. Dodis, and T. Rabin, ”On the security of joint signature and encryption”, Proceedings of Eurocrypt 2002, vol. 2332 of LNCS, pages 83-107. Springer-Verlag, 2002.
- [2] S. D. Galbraith, K. G. Paterson, and N. P. Smart, ”Pairings for cryptographers”, Discrete Applied Mathematics, 156(16): 3113–3121, 2008.
- [3] S. Goldwasser, S. Micali, and R. L. Rivest, ”A digital signature scheme secure against adaptive chosen-message attacks”, SIAM Journal on Computing, 17(2): 281–308, 1988.
- [4] B. Waters, ”Efficient identity-based encryption without random oracles”, Proceedings of Eurocrypt 2005, vol. 3494 of LNCS, pages 114–127. Springer-Verlag, 2005.
- [5] D. Boneh and M. K. Franklin, ”Identity-based encryption from the weil pairing”, SIAM J. Comput., 32(3): 586–615, 2003.
Uwagi
Opracowanie rekordu ze środków MNiSW, umowa Nr 461252 w ramach programu "Społeczna odpowiedzialność nauki" - moduł: Popularyzacja nauki i promocja sportu (2020).
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-6a0dabdb-030d-4a13-b490-e9965afbb2c7