• DocumentCode
    1603131
  • Title

    A New Efficient Multiple Broadcasters Signcryption Scheme (MBSS) for Secure Distributed Networks

  • Author

    Elkamchouchi, H. ; Nasr, M. ; Ismail, Roayat

  • Author_Institution
    Fac. of Eng., Alexandria Univ., Alexandria
  • fYear
    2009
  • Firstpage
    204
  • Lastpage
    209
  • Abstract
    Multiple broadcasters signcryption schemes (MBSS) allow multiple centers to distribute signed and encrypted data to a large set of users so that only a particular subset of privileged authorized users can decrypt it. These schemes require the authentication of the message or the broadcaster and public ciphertext authenticity which allows the gateway of the system to filter the incorrect ciphertext and therefore alleviate the receiver´s workload. In this paper we propose a new MBSS which has the following advantages over the first proposed distributed signcryption scheme (FPDSS) [1]: (i) There is no need for a group manager who knows all the members private keys in the FPDSS and who may be malicious or may be attacked by an adversary and so causes security threats. (ii) It provides both public verifiability and public ciphertext authenticity while the FPDSS doesn´t. (iii) It is more efficient than the FPDSS. (iv) Its security is based on the intractability of three hard problems: discrete logarithm problem (DLP), Diffie-Hellman problem (DHP) and reversing a one-way hash function (OWHF).
  • Keywords
    message authentication; private key cryptography; public key cryptography; Diffie-Hellman problem; discrete logarithm problem; first proposed distributed signcryption scheme; message authentication; multiple broadcasters signcryption scheme; one-way hash function; private keys; public ciphertext authenticity; public verifiability authenticity; secure distributed networks; security threats; Authentication; Broadcasting; Costs; Cryptography; Data engineering; Digital signatures; Filters; Information management; Multimedia communication; Security; Broadcast signcryption scheme; diffie hellman problem; discrete logarithm problem; public verifiability;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Networking and Services, 2009. ICNS '09. Fifth International Conference on
  • Conference_Location
    Valencia
  • Print_ISBN
    978-1-4244-3688-0
  • Electronic_ISBN
    978-0-7695-3586-9
  • Type

    conf

  • DOI
    10.1109/ICNS.2009.102
  • Filename
    4976761