Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: bilinear pairings

Sortuj według:

Ogranicz wyniki do:

Certificateless Proxy Signature Scheme in the Standard Model

Ming Y., Wang Y.

Fundamenta Informaticae

2018

Vol. 160, nr 4

409--445

Proxy signature is extension of the standard signature, in which the original signer can delegate his or her signing capability to proxy signer in such a way that the latter can sign messages on behalf of the former. Certificateless cryptography eliminates the need of certificates in the traditional public key cryptography and solves the inherent key escrow problem in the identity based cryptography. In this paper, we extend security model of proxy signature to certificateless setting and formalize the security model of certificateless proxy signature. We propose a certificateless proxy signature scheme with concrete implementation which is probably secure in the standard model. Furthermore, the proposed scheme is proven to be existentially unforgeable under the hardness of the computational Diffie-Hellman problem.

A New Short Signature Scheme with Random Oracle from Bilinear Pairings

Akleylek S., Kirlar B. B., Sever Ö, Yüce Z.

Journal of Telecommunications and Information Technology

2011

nr 1

5-10

In this paper, we propose a new and efficient short signature scheme from the bilinear pairings. Our scheme is constructed by bilinear inverse-square Diffie-Hellman problem (BISDHP) and does not require any special hash function. The exact security proofs are also explained in the random Oracle model. We give the implementation and comparison results of our proposed signature scheme with the signature scheme proposed by Boneh, Lynn, Shacham (BLS) and Zhang, Safavi, Susilo (ZSS). Furthermore, we use this signature scheme to construct a ring signature scheme.