Abstract

Aggregate signcryption could verify the multiple messages via a single operation. Most of the identity-based aggregate signcryption are based on random oracle. To exploit the advantage of multilinear maps and erase the key escrow problem, a new Identity-based certificate less aggregate signcryption scheme is proposed. The new scheme is proved to be confidential and unforgeable under the assumption of multilinear Diffie-Hellman problem in the standard model. Compared with others, the scheme sacrifices a little in exponent arithmetic, but gives an effective remedy to the key escrow problem.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call