Paper 2013/037

Provably Secure Identity-Based Aggregate Signcryption Scheme in Random Oracles

Jayaprakash Kar


This article proposes a provably secure aggregate signcryption scheme in random oracles. Security of the scheme is based on computational infesibility of solving Decisional Bilinear Diffie-Hellman Problem and Discrete Logarithm Problems. Confidentiality and authenticity are two fundamental security requirement of Public key Cryptography. These are achieved by encryption scheme and digital signatures respectively. Signcryption scheme is a cryptographic primitive that performs signature and encryption simultaneously in a single logical steps. An aggregate signcryption scheme can be constructed of the aggregation of individual signcryption. The aggreagtion is done taking n distinct signcryptions on n messages signed by n distinct users.

Available format(s)
Cryptographic protocols
Publication info
Published elsewhere. Unknown where it was published
Contact author(s)
jayaprakashkar @ yahoo com
2013-01-29: received
Short URL
Creative Commons Attribution


      author = {Jayaprakash Kar},
      title = {Provably Secure Identity-Based Aggregate Signcryption Scheme in Random Oracles},
      howpublished = {Cryptology ePrint Archive, Paper 2013/037},
      year = {2013},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.