Verifiable secret sharing scheme without dealer based on vector space access structures over bilinear groups

In general, most of the previous secret sharing schemes involve a secret dealer and a number of participants. The dealer generates a secret and then distributes the secret shares to the participants in a centralised manner, which may lead to the data tamper problem. A verifiable secret sharing schem...

Full description

Saved in:
Bibliographic Details
Published in:Electronics letters 2018-01, Vol.54 (2), p.77-79
Main Authors: Wang, Na, Fu, Junsong, Zeng, Jiwen
Format: Article
Language:English
Subjects:
bilinear groups
computational complexity
computing complexity
cryptography
Information and communications
random element
security
vector space access structures
verifiable secret sharing scheme
Citations: Items that this one cites
Items that cite this one
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c3430-d4f604f269e3f787e8055a17989cef4a28df76d709f7049cbfe61e320333801b3
cites cdi_FETCH-LOGICAL-c3430-d4f604f269e3f787e8055a17989cef4a28df76d709f7049cbfe61e320333801b3
container_end_page 79
container_issue 2
container_start_page 77
container_title Electronics letters
container_volume 54
creator Wang, Na
Fu, Junsong
Zeng, Jiwen
description In general, most of the previous secret sharing schemes involve a secret dealer and a number of participants. The dealer generates a secret and then distributes the secret shares to the participants in a centralised manner, which may lead to the data tamper problem. A verifiable secret sharing scheme without dealer on vector space access structures over bilinear groups is presented. In particular, each participant can act as a ‘dealer’ and the secret in the proposed scheme is a random element generated by all the participants from a bilinear group. In addition, the performance of the proposed scheme in terms of security and computing complexity is analysed in detail and compared it with that of the scheme by Zhang and Zhang. The results show that the proposed scheme performs better in terms of computational cost.
doi_str_mv 10.1049/el.2017.1840
format article
fullrecord <record><control><sourceid>wiley_24P</sourceid><recordid>TN_cdi_crossref_primary_10_1049_el_2017_1840</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>ELL2BF05370</sourcerecordid><originalsourceid>FETCH-LOGICAL-c3430-d4f604f269e3f787e8055a17989cef4a28df76d709f7049cbfe61e320333801b3</originalsourceid><addsrcrecordid>eNp90LFOwzAQBmALgURVuvEAHhgYSDnHTpyMUFFAqsQCiC1ynHNr5CaRnbTq25OoDAwV0y3fnf77CblmMGcg8nt08xiYnLNMwBmZMJ5AlDP2dU4mAIxHCcvFJZmFYEtggokUBJsQ94neGqtKhzSg9tjRsFHe1msa9Aa3SPe22zR9RytUDj0tVcCKNjXdoe4aT0OrNFKlNYZAQ-d73fUeA212I7bO1qg8Xfumb8MVuTDKBZz9zin5WD69L16i1dvz6-JhFWkuOESVMEM4E6c5ciMziRkkiWIyz3KNRqg4q4xMKwm5kcPnujSYMuQxcM4zYCWfkrvjXe2bEDyaovV2q_yhYFCMZRXoirGsYixr4MmR763Dw7-2eFqt4sclJFyOezfHPYtd8d30vh6eGsQf3lZmYLcn2MkkP3kqhtY</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Verifiable secret sharing scheme without dealer based on vector space access structures over bilinear groups</title><source>Wiley Open Access</source><creator>Wang, Na ; Fu, Junsong ; Zeng, Jiwen</creator><creatorcontrib>Wang, Na ; Fu, Junsong ; Zeng, Jiwen</creatorcontrib><description>In general, most of the previous secret sharing schemes involve a secret dealer and a number of participants. The dealer generates a secret and then distributes the secret shares to the participants in a centralised manner, which may lead to the data tamper problem. A verifiable secret sharing scheme without dealer on vector space access structures over bilinear groups is presented. In particular, each participant can act as a ‘dealer’ and the secret in the proposed scheme is a random element generated by all the participants from a bilinear group. In addition, the performance of the proposed scheme in terms of security and computing complexity is analysed in detail and compared it with that of the scheme by Zhang and Zhang. The results show that the proposed scheme performs better in terms of computational cost.</description><identifier>ISSN: 0013-5194</identifier><identifier>ISSN: 1350-911X</identifier><identifier>EISSN: 1350-911X</identifier><identifier>DOI: 10.1049/el.2017.1840</identifier><language>eng</language><publisher>The Institution of Engineering and Technology</publisher><subject>bilinear groups ; computational complexity ; computing complexity ; cryptography ; Information and communications ; random element ; security ; vector space access structures ; verifiable secret sharing scheme</subject><ispartof>Electronics letters, 2018-01, Vol.54 (2), p.77-79</ispartof><rights>The Institution of Engineering and Technology</rights><rights>2020 The Institution of Engineering and Technology</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c3430-d4f604f269e3f787e8055a17989cef4a28df76d709f7049cbfe61e320333801b3</citedby><cites>FETCH-LOGICAL-c3430-d4f604f269e3f787e8055a17989cef4a28df76d709f7049cbfe61e320333801b3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1049%2Fel.2017.1840$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1049%2Fel.2017.1840$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,780,784,9755,11562,27924,27925,46052,46476</link.rule.ids><linktorsrc>$$Uhttps://onlinelibrary.wiley.com/doi/abs/10.1049%2Fel.2017.1840$$EView_record_in_Wiley-Blackwell$$FView_record_in_$$GWiley-Blackwell</linktorsrc></links><search><creatorcontrib>Wang, Na</creatorcontrib><creatorcontrib>Fu, Junsong</creatorcontrib><creatorcontrib>Zeng, Jiwen</creatorcontrib><title>Verifiable secret sharing scheme without dealer based on vector space access structures over bilinear groups</title><title>Electronics letters</title><description>In general, most of the previous secret sharing schemes involve a secret dealer and a number of participants. The dealer generates a secret and then distributes the secret shares to the participants in a centralised manner, which may lead to the data tamper problem. A verifiable secret sharing scheme without dealer on vector space access structures over bilinear groups is presented. In particular, each participant can act as a ‘dealer’ and the secret in the proposed scheme is a random element generated by all the participants from a bilinear group. In addition, the performance of the proposed scheme in terms of security and computing complexity is analysed in detail and compared it with that of the scheme by Zhang and Zhang. The results show that the proposed scheme performs better in terms of computational cost.</description><subject>bilinear groups</subject><subject>computational complexity</subject><subject>computing complexity</subject><subject>cryptography</subject><subject>Information and communications</subject><subject>random element</subject><subject>security</subject><subject>vector space access structures</subject><subject>verifiable secret sharing scheme</subject><issn>0013-5194</issn><issn>1350-911X</issn><issn>1350-911X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><recordid>eNp90LFOwzAQBmALgURVuvEAHhgYSDnHTpyMUFFAqsQCiC1ynHNr5CaRnbTq25OoDAwV0y3fnf77CblmMGcg8nt08xiYnLNMwBmZMJ5AlDP2dU4mAIxHCcvFJZmFYEtggokUBJsQ94neGqtKhzSg9tjRsFHe1msa9Aa3SPe22zR9RytUDj0tVcCKNjXdoe4aT0OrNFKlNYZAQ-d73fUeA212I7bO1qg8Xfumb8MVuTDKBZz9zin5WD69L16i1dvz6-JhFWkuOESVMEM4E6c5ciMziRkkiWIyz3KNRqg4q4xMKwm5kcPnujSYMuQxcM4zYCWfkrvjXe2bEDyaovV2q_yhYFCMZRXoirGsYixr4MmR763Dw7-2eFqt4sclJFyOezfHPYtd8d30vh6eGsQf3lZmYLcn2MkkP3kqhtY</recordid><startdate>20180125</startdate><enddate>20180125</enddate><creator>Wang, Na</creator><creator>Fu, Junsong</creator><creator>Zeng, Jiwen</creator><general>The Institution of Engineering and Technology</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20180125</creationdate><title>Verifiable secret sharing scheme without dealer based on vector space access structures over bilinear groups</title><author>Wang, Na ; Fu, Junsong ; Zeng, Jiwen</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c3430-d4f604f269e3f787e8055a17989cef4a28df76d709f7049cbfe61e320333801b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>bilinear groups</topic><topic>computational complexity</topic><topic>computing complexity</topic><topic>cryptography</topic><topic>Information and communications</topic><topic>random element</topic><topic>security</topic><topic>vector space access structures</topic><topic>verifiable secret sharing scheme</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wang, Na</creatorcontrib><creatorcontrib>Fu, Junsong</creatorcontrib><creatorcontrib>Zeng, Jiwen</creatorcontrib><collection>CrossRef</collection><jtitle>Electronics letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Wang, Na</au><au>Fu, Junsong</au><au>Zeng, Jiwen</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Verifiable secret sharing scheme without dealer based on vector space access structures over bilinear groups</atitle><jtitle>Electronics letters</jtitle><date>2018-01-25</date><risdate>2018</risdate><volume>54</volume><issue>2</issue><spage>77</spage><epage>79</epage><pages>77-79</pages><issn>0013-5194</issn><issn>1350-911X</issn><eissn>1350-911X</eissn><abstract>In general, most of the previous secret sharing schemes involve a secret dealer and a number of participants. The dealer generates a secret and then distributes the secret shares to the participants in a centralised manner, which may lead to the data tamper problem. A verifiable secret sharing scheme without dealer on vector space access structures over bilinear groups is presented. In particular, each participant can act as a ‘dealer’ and the secret in the proposed scheme is a random element generated by all the participants from a bilinear group. In addition, the performance of the proposed scheme in terms of security and computing complexity is analysed in detail and compared it with that of the scheme by Zhang and Zhang. The results show that the proposed scheme performs better in terms of computational cost.</abstract><pub>The Institution of Engineering and Technology</pub><doi>10.1049/el.2017.1840</doi><tpages>3</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 0013-5194
ispartof Electronics letters, 2018-01, Vol.54 (2), p.77-79
issn 0013-5194
1350-911X
1350-911X
language eng
recordid cdi_crossref_primary_10_1049_el_2017_1840
source Wiley Open Access
subjects bilinear groups
computational complexity
computing complexity
cryptography
Information and communications
random element
security
vector space access structures
verifiable secret sharing scheme
title Verifiable secret sharing scheme without dealer based on vector space access structures over bilinear groups
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T15%3A24%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-wiley_24P&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Verifiable%20secret%20sharing%20scheme%20without%20dealer%20based%20on%20vector%20space%20access%20structures%20over%20bilinear%20groups&rft.jtitle=Electronics%20letters&rft.au=Wang,%20Na&rft.date=2018-01-25&rft.volume=54&rft.issue=2&rft.spage=77&rft.epage=79&rft.pages=77-79&rft.issn=0013-5194&rft.eissn=1350-911X&rft_id=info:doi/10.1049/el.2017.1840&rft_dat=%3Cwiley_24P%3EELL2BF05370%3C/wiley_24P%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c3430-d4f604f269e3f787e8055a17989cef4a28df76d709f7049cbfe61e320333801b3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true