An efficient self-certified multi-proxy signature scheme based on elliptic curve discrete logarithm problem

Multi-proxy signature schemes (MPSS) allow n proxy signers to generate a valid signature on behalf of the original signer. A new efficient self-certified MPSS with message recovery based on the Elliptic Curve Discrete Logarithm Problem (i.e., ECDLP) is proposed in this paper. A rationale for proposi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of discrete mathematical sciences & cryptography Jg. 23; H. 4; S. 935 - 948
Hauptverfasser: Tahat, Nedal, Alomari, A. K., Al-Hazaimeh, Obaida M., Al-Jamal, Mohammad F.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Taylor & Francis 18.05.2020
Schlagworte:
ISSN:0972-0529, 2169-0065
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Multi-proxy signature schemes (MPSS) allow n proxy signers to generate a valid signature on behalf of the original signer. A new efficient self-certified MPSS with message recovery based on the Elliptic Curve Discrete Logarithm Problem (i.e., ECDLP) is proposed in this paper. A rationale for proposing a new scheme is to improve the verification process performance by combining the verification process with message recovery in one single stage (i.e., simultaneously). The security and performance analysis shows, the new scheme has many advantages over the traditional MPS schemes. These benefits include decreasing costs (i.e., certificate sizes, consumption time, and bandwidth requirements) and increasing speed.
AbstractList Multi-proxy signature schemes (MPSS) allow n proxy signers to generate a valid signature on behalf of the original signer. A new efficient self-certified MPSS with message recovery based on the Elliptic Curve Discrete Logarithm Problem (i.e., ECDLP) is proposed in this paper. A rationale for proposing a new scheme is to improve the verification process performance by combining the verification process with message recovery in one single stage (i.e., simultaneously). The security and performance analysis shows, the new scheme has many advantages over the traditional MPS schemes. These benefits include decreasing costs (i.e., certificate sizes, consumption time, and bandwidth requirements) and increasing speed.
Author Tahat, Nedal
Al-Jamal, Mohammad F.
Al-Hazaimeh, Obaida M.
Alomari, A. K.
Author_xml – sequence: 1
  givenname: Nedal
  surname: Tahat
  fullname: Tahat, Nedal
  email: Nedal@hu.edu.jo
  organization: Department of Mathematics, The Hashemite University
– sequence: 2
  givenname: A. K.
  surname: Alomari
  fullname: Alomari, A. K.
  organization: Department of Mathematics, Yarmouk University
– sequence: 3
  givenname: Obaida M.
  surname: Al-Hazaimeh
  fullname: Al-Hazaimeh, Obaida M.
  organization: Department of Computer Science, Al- Balqa' Applied University
– sequence: 4
  givenname: Mohammad F.
  surname: Al-Jamal
  fullname: Al-Jamal, Mohammad F.
  organization: Department of Mathematics, Yarmouk University
BookMark eNqFkM1KAzEUhYMo2FYfQcgLTL2TmcxMcGMp_kHBja6HTH7aaCYpSar27Z2hdeNCVxcO5ztwvyk6dd4phK5ymOfQwDWwmgAlbE6ADFFdlIQVJ2hC8oplABU9RZOxk42lczSN8Q2AMpKzCXpfOKy0NsIol3BUVmdChWS0URL3O5tMtg3-a4-jWTuedkHhKDaqV7jjcaj4AbfWbJMRWOzCh8LSRBFUUtj6NQ8mbXo8LHRW9RfoTHMb1eXxztDr_d3L8jFbPT88LRerTBQ5pKykpOay00SWNZVlBVxxBmVDeDG81nUVCK0ZrWWd67KhOW8AalmKjjacdIIUM0QPuyL4GIPS7TaYnod9m0M7Gmt_jLWjsfZobOBufnHCJJ6MdylwY_-lbw-0cdqHnn_6YGWb-N76oAN3wsS2-HviG247iKk
CitedBy_id crossref_primary_10_1007_s11042_022_13546_z
crossref_primary_10_32604_cmc_2023_035337
crossref_primary_10_1007_s12652_023_04608_7
crossref_primary_10_1371_journal_pone_0290323
crossref_primary_10_1080_09720529_2021_1930656
crossref_primary_10_1080_09720529_2022_2101601
crossref_primary_10_1080_09720529_2020_1866298
crossref_primary_10_1155_2021_2459628
Cites_doi 10.1109/TIT.1976.1055638
10.4304/jnw.7.10.1616-1623
10.1090/S0025-5718-1987-0866109-5
10.1631/jzus.A0820202
10.1007/s00145-010-9082-x
10.1007/978-3-540-30501-9_113
10.1007/s00521-017-3195-1
10.1007/BF00125076
10.1023/A:1008354106356
10.5539/cis.v7n4p65
10.1080/02522667.2016.1220092
10.1002/dac.2683
10.1016/j.csi.2007.01.004
10.1016/j.compeleceng.2008.05.005
ContentType Journal Article
Copyright 2020 Taru Publications 2020
Copyright_xml – notice: 2020 Taru Publications 2020
DBID AAYXX
CITATION
DOI 10.1080/09720529.2020.1734293
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 2169-0065
EndPage 948
ExternalDocumentID 10_1080_09720529_2020_1734293
1734293
Genre Research Article
GroupedDBID 30N
4.4
ABCCY
ABFIM
ABPEM
ABTAI
ABXYU
ACGFS
ACTIO
ADCVX
AEYOC
AGDLA
AIJEM
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AQRUH
AQTUD
AVBZW
AWYRJ
BLEHA
CCCUG
DGEBU
DKSSO
EBS
E~A
E~B
GTTXZ
H13
HZ~
H~P
IPNFZ
J9A
KYCEM
LJTGL
M4Z
O9-
P2P
S-T
SNACF
TDBHL
TFW
TTHFI
UT5
AAYXX
CITATION
ID FETCH-LOGICAL-c310t-4527adbf2d475d460aea90482a3734bb60cff957d71f4851a8007d4cb58a2bc23
IEDL.DBID TFW
ISICitedReferencesCount 11
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000548446700010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0972-0529
IngestDate Sat Nov 29 02:16:50 EST 2025
Tue Nov 18 21:49:02 EST 2025
Mon Oct 20 23:49:00 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 4
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c310t-4527adbf2d475d460aea90482a3734bb60cff957d71f4851a8007d4cb58a2bc23
PageCount 14
ParticipantIDs informaworld_taylorfrancis_310_1080_09720529_2020_1734293
crossref_citationtrail_10_1080_09720529_2020_1734293
crossref_primary_10_1080_09720529_2020_1734293
PublicationCentury 2000
PublicationDate 2020-05-18
PublicationDateYYYYMMDD 2020-05-18
PublicationDate_xml – month: 05
  year: 2020
  text: 2020-05-18
  day: 18
PublicationDecade 2020
PublicationTitle Journal of discrete mathematical sciences & cryptography
PublicationYear 2020
Publisher Taylor & Francis
Publisher_xml – name: Taylor & Francis
References Lee J. Y. (CIT0013) 2003
Miller V. S. (CIT0018) 1985
CIT0010
CIT0011
Pan C. (CIT0023) 2015; 17
Girault M. (CIT0007) 1991
Mambo . M. (CIT0016) 1966
Contini S. (CIT0005) 2006
Lin . C.Y. (CIT0014) 2002
CIT0015
CIT0019
Obaida M. A. (CIT0020) 2012; 9
Chande M. K. (CIT0003) 2017; 19
CIT0021
CIT0001
Ji J (CIT0008) 2004; 27
CIT0022
Tiwari N. (CIT0025) 2015; 17
Mambo M. (CIT0017) 1996; 79
Xue Q. (CIT0028) 2008; 2004
CIT0002
CIT0024
CIT0027
CIT0004
Lee B. (CIT0012) 2001
CIT0026
CIT0006
CIT0009
Yong Y. (CIT0029) 2008; 17
References_xml – start-page: 48
  year: 1966
  ident: CIT0016
  publication-title: Proceedings of the 3rd ACM conference on Computer and communications security
– ident: CIT0006
  doi: 10.1109/TIT.1976.1055638
– volume: 27
  start-page: 1429
  issue: 10
  year: 2004
  ident: CIT0008
  publication-title: Chinese Journal of Computers
– volume: 17
  start-page: 736
  year: 2015
  ident: CIT0025
  publication-title: IJ Network Security
– ident: CIT0027
  doi: 10.4304/jnw.7.10.1616-1623
– volume: 19
  start-page: 340
  year: 2017
  ident: CIT0003
  publication-title: International Journal Network Security
– ident: CIT0010
  doi: 10.1090/S0025-5718-1987-0866109-5
– ident: CIT0026
  doi: 10.1631/jzus.A0820202
– volume: 17
  start-page: 475
  year: 2008
  ident: CIT0029
  publication-title: Chinese journal of Electronics
– start-page: 68
  year: 2003
  ident: CIT0013
  publication-title: Cryptographers’ Track at the RSA Conference
– start-page: 165
  year: 2006
  ident: CIT0005
  publication-title: in Annual International Conference on the Theory and Applications of Cryptographic Techniques
– start-page: 417
  year: 1985
  ident: CIT0018
  publication-title: Conference on the theory and application of cryptographic techniques
– volume: 9
  start-page: 241
  issue: 3
  year: 2012
  ident: CIT0020
  publication-title: International Journal of Computer Science Issues (IJCSI)
– ident: CIT0001
  doi: 10.1007/s00145-010-9082-x
– volume: 17
  start-page: 29
  year: 2015
  ident: CIT0023
  publication-title: IJ Network Security
– volume: 2004
  start-page: 450
  year: 2008
  ident: CIT0028
  publication-title: CIT
– start-page: 474
  year: 2001
  ident: CIT0012
  publication-title: in Australasian Conference on Information Security and Privacy
– ident: CIT0015
  doi: 10.1007/978-3-540-30501-9_113
– year: 2002
  ident: CIT0014
  publication-title: Institute of Information Management, NCTU
– ident: CIT0022
  doi: 10.1007/s00521-017-3195-1
– start-page: 490
  year: 1991
  ident: CIT0007
  publication-title: Workshop on the Theory and Application of of Cryptographic Techniques
– ident: CIT0019
  doi: 10.1007/BF00125076
– volume: 79
  start-page: 1338
  year: 1996
  ident: CIT0017
  publication-title: IEICE transactions on fundamentals of electronics, communications and computer sciences
– ident: CIT0011
  doi: 10.1023/A:1008354106356
– ident: CIT0021
  doi: 10.5539/cis.v7n4p65
– ident: CIT0009
  doi: 10.1080/02522667.2016.1220092
– ident: CIT0024
  doi: 10.1002/dac.2683
– ident: CIT0004
  doi: 10.1016/j.csi.2007.01.004
– ident: CIT0002
  doi: 10.1016/j.compeleceng.2008.05.005
SSID ssj0059219
Score 2.1913416
Snippet Multi-proxy signature schemes (MPSS) allow n proxy signers to generate a valid signature on behalf of the original signer. A new efficient self-certified MPSS...
SourceID crossref
informaworld
SourceType Enrichment Source
Index Database
Publisher
StartPage 935
SubjectTerms 11T71 Algebraic coding theory
cryptography
Digital signature
Elliptic curve discrete logarithm
Message recovery
Multi-proxy signature
Proxy signature
Self-certified key
Title An efficient self-certified multi-proxy signature scheme based on elliptic curve discrete logarithm problem
URI https://www.tandfonline.com/doi/abs/10.1080/09720529.2020.1734293
Volume 23
WOSCitedRecordID wos000548446700010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAWR
  databaseName: Taylor & Francis
  customDbUrl:
  eissn: 2169-0065
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0059219
  issn: 0972-0529
  databaseCode: TFW
  dateStart: 19980101
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV05T8MwFLZQxcBCOUW55IHV0DiHk7FCVAyoYijQLfIpEG2KmrS_n_cSB7UDMMASKZFejme_K_78PUKuUm3C0PZjJo2wLFLKMim0ggOSwYGlixo8_vwgRqN0MskePZqw9LBKrKFdQxRR-2o0bqnKFhF3g4wzuEAF1R2HSyIEn4p8nxD60TTHw5fWF8cZDxq2PcEZirR7eL67y0Z02uAuXYs6w-4_vO8e2fUpJx00c2SfbNnigHTbdg7UW_cheR8U1NaMEhCIaGmnjmlEXTvIUmkNPGQ16IUi5qPmA6VQGtuZpRgKDZ2DOK4swGOoXi5WluKW3wVk5RQcLNTk1euM-gY2R-RpeDe-vWe-FwPTkABWLIq5kEY5biIRmyjpSyszsH4uQ_gepZK-di6LhRGBiyCLk5CIChNpFaeSK83DY9Ip5oU9IVSkSrsgtZlWSaS1S5XTKhQa4mQSJE71SNSOQa49UTn2y5jmQctn6hWao0Jzr9Aeuf4S-2iYOn4TyNYHOK_qXySu6WeShz_Knv5B9ozs4ClCEIL0nHSqxdJekG29qt7KxWU9fz8BbxztnQ
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELagIMFCeYry9MBqaBwnTsYKURVROhXoFsWOLRBtitK0v5-7PFA7AAMsGRJdEr_uYX_3HSFXgU5c17Q9FifSMKGUYbHUCi5IBgcrXRbg8ee-HAyC0ShczoVBWCXG0LYkiih0NS5u3IyuIXE3SDmDJ1QQ3nG4JV1Qqu462fDA1iJ__rD7UmtjL-ROybcnOUOZOovnu9es2KcV9tIlu9Nt_scf75KdyuuknXKa7JE1k-6TZl3RgVYL_IC8d1JqClIJsEV0ZsaWaQReW3BUaYE9ZAXuhSLso6AEpRAdm4mhaA0TOgVxPFyAz1A9zxaGYtZvBo45BR0LYXn-OqFVDZtD8tS9G972WFWOgWnwAXMmPC7jRFmeCOklwm_HJg5BAfDYhfYo5be1taEnE-lYAY5cDL6oTIRWXhBzpbl7RBrpNDXHhMpAaesEJtTKF1rbQFmtXKnBVPqOb1WLiHoQIl1xlWPJjHHk1JSmVYdG2KFR1aEtcv0l9lGSdfwmEC6PcJQXuyS2LGkSuT_KnvxB9pJs9YaP_ah_P3g4Jdv4CBEJjjgjjTybm3OyqRf52yy7KCbzJ4ME8cM
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV05T8MwFLagIMRCOUU5PbAaGudwMlZABKKqOhToFsWXQLRplab9_TwnDmoHYIAlQ6KX49nvij9_D6GrUEjXVW2fpJIp4nGuSMoEh4MhgwNLZyV4_KXLer1wOIz6Fk04s7BKU0Priiii9NXGuKdS14i4G8M4YxaooLqjcIq54FPddbQBqXNgJvkgfq2dsR9Rp6LbY5QYmXoTz3e3WQlPK-SlS2Enbv7DC--iHZtz4k41SfbQmsr2UbPu54CteR-gj06GVUkpAZEIz9RIE2Fg1xrSVFwiD0mJesEG9FESgmKojdVYYRMLJZ6AuFlagMdgMc8XCps9vzmk5Rg8LBTlxdsY2w42h-g5vh_cPhDbjIEIyAAL4vmUpZJrKj3mSy9opyqNwPxp6sL3cB60hdaRzyRztAdpXAqZKJOe4H6YUi6oe4Qa2SRTxwizkAvthCoSPPCE0CHXgrtMQKAMnEDzFvLqMUiEZSo3DTNGiVMTmlqFJkahiVVoC11_iU0rqo7fBKLlAU6K8h-JrhqaJO6Psid_kL1EW_27OOk-9p5O0ba5YuAITniGGkU-V-doUyyK91l-UU7lT7I48Hk
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+efficient+self-certified+multi-proxy+signature+scheme+based+on+elliptic+curve+discrete+logarithm+problem&rft.jtitle=Journal+of+discrete+mathematical+sciences+%26+cryptography&rft.au=Tahat%2C+Nedal&rft.au=Alomari%2C+A.+K.&rft.au=Al-Hazaimeh%2C+Obaida+M.&rft.au=Al-Jamal%2C+Mohammad+F.&rft.date=2020-05-18&rft.pub=Taylor+%26+Francis&rft.issn=0972-0529&rft.eissn=2169-0065&rft.volume=23&rft.issue=4&rft.spage=935&rft.epage=948&rft_id=info:doi/10.1080%2F09720529.2020.1734293&rft.externalDocID=1734293
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0972-0529&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0972-0529&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0972-0529&client=summon