Log in
Language:

MERAL Myanmar Education Research and Learning Portal

  • Top
  • Universities
  • Ranking
To
lat lon distance
To

Field does not validate



Index Link

Index Tree

Please input email address.

WEKO

One fine body…

WEKO

One fine body…

Item

{"_buckets": {"deposit": "9840e55e-ad5e-4cd9-8c50-214b3e69092e"}, "_deposit": {"id": "3240", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "3240"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/3240", "sets": ["1597824273898", "user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Comparison of Scalar Multiplication Methods by Using Proposed Blind Signature Scheme", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Today blind signatures scheme are importanttechniques and can be used in many e-commerceservices, such as electronic voting and cash paymentsystem.Privacy is one of the basic rights for individualsand institutions that need to preserve theirconfidentiality.The performance of blind signaturescheme is based on operation of scalar multiplicationmethod. In this paper, we present the comparison ofmultiplication methods such asbinary double and adds,ternary expansion, Montgomery ladder and nonadjacentalgorithm. The security of proposed blindsignature scheme is based on solving the problem ofelliptic curve discrete logarithm problem (ECDLP) andit can satisfy the requirements blind signature.Theproposed scheme desired to reduce time consumingproblem by using efficient multiplicationmethod.Althoughmontgomery ladder algorithm is moreefficient than the other algorithms, double and addalgorithm is more compatible with the proposedsystem."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "BDS"}, {"interim": "DLP"}, {"interim": "ECC"}, {"interim": "ECDLP"}, {"interim": "E-commerce"}, {"interim": "Electronic voting system"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2019-07-02"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "2.Comparison of Scalar Multiplication Methods by Using Propo.pdf", "filesize": [{"value": "646 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 646000.0, "url": {"url": "https://meral.edu.mm/record/3240/files/2.Comparison of Scalar Multiplication Methods by Using Propo.pdf"}, "version_id": "6ff9a52a-58ec-4942-a09c-3df6ccfaf8fd"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "Thirteenth International Conferences on Computer Applications(ICCA 2015)", "subitem_pages": "", "subitem_volume": ""}]}, "item_1583103147082": {"attribute_name": "Conference papers", "attribute_value_mlt": [{"subitem_acronym": "", "subitem_c_date": "", "subitem_conference_title": "", "subitem_part": "", "subitem_place": "", "subitem_session": "", "subitem_website": ""}]}, "item_1583103211336": {"attribute_name": "Books/reports/chapters", "attribute_value_mlt": [{"subitem_book_title": "", "subitem_isbn": "", "subitem_pages": "", "subitem_place": "", "subitem_publisher": ""}]}, "item_1583103233624": {"attribute_name": "Thesis/dissertations", "attribute_value_mlt": [{"subitem_awarding_university": "", "subitem_supervisor(s)": [{"subitem_supervisor": ""}]}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Thu, Aye Aye"}, {"subitem_authors_fullname": "Mya, Khin Than"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Publication"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Article"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2015-02-05"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/101"}, "item_title": "Comparison of Scalar Multiplication Methods by Using Proposed Blind Signature Scheme", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000003240", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-07-02"}, "publish_date": "2019-07-02", "publish_status": "0", "recid": "3240", "relation": {}, "relation_version_is_last": true, "title": ["Comparison of Scalar Multiplication Methods by Using Proposed Blind Signature Scheme"], "weko_shared_id": -1}
  1. University of Computer Studies, Yangon
  2. Conferences

Comparison of Scalar Multiplication Methods by Using Proposed Blind Signature Scheme

http://hdl.handle.net/20.500.12678/0000003240
http://hdl.handle.net/20.500.12678/0000003240
a41122a0-fd17-4bea-9ff4-eb56cf074bfb
9840e55e-ad5e-4cd9-8c50-214b3e69092e
None
Preview
Name / File License Actions
2.Comparison 2.Comparison of Scalar Multiplication Methods by Using Propo.pdf (646 Kb)
Publication type
Article
Upload type
Publication
Title
Title Comparison of Scalar Multiplication Methods by Using Proposed Blind Signature Scheme
Language en
Publication date 2015-02-05
Authors
Thu, Aye Aye
Mya, Khin Than
Description
Today blind signatures scheme are importanttechniques and can be used in many e-commerceservices, such as electronic voting and cash paymentsystem.Privacy is one of the basic rights for individualsand institutions that need to preserve theirconfidentiality.The performance of blind signaturescheme is based on operation of scalar multiplicationmethod. In this paper, we present the comparison ofmultiplication methods such asbinary double and adds,ternary expansion, Montgomery ladder and nonadjacentalgorithm. The security of proposed blindsignature scheme is based on solving the problem ofelliptic curve discrete logarithm problem (ECDLP) andit can satisfy the requirements blind signature.Theproposed scheme desired to reduce time consumingproblem by using efficient multiplicationmethod.Althoughmontgomery ladder algorithm is moreefficient than the other algorithms, double and addalgorithm is more compatible with the proposedsystem.
Keywords
BDS, DLP, ECC, ECDLP, E-commerce, Electronic voting system
Identifier http://onlineresource.ucsy.edu.mm/handle/123456789/101
Journal articles
Thirteenth International Conferences on Computer Applications(ICCA 2015)
Conference papers
Books/reports/chapters
Thesis/dissertations
Back
0
0
views
downloads
See details
Views Downloads

Versions

Ver.1 2020-09-01 09:49:25.587596
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Export

OAI-PMH
  • OAI-PMH DublinCore
Other Formats
  • JSON

Confirm


Back to MERAL


Back to MERAL