Constant-Size Verifiable Timed Signatures from RSA Group for Bitcoin-Based Voting Protocols
A verifiable timed signature (VTS) scheme allows a signature to be time-locked to a known message for a predetermined duration denoted as \mathsf {T} T . Verifiability ensures that anyone can verify that the time-lock contains a valid signature without completing the computation. In this paper, we i...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on services computing 2024-07, Vol.17 (4), p.1414-1425 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 1425 |
---|---|
container_issue | 4 |
container_start_page | 1414 |
container_title | IEEE transactions on services computing |
container_volume | 17 |
creator | Bao, Zijian He, Debiao Feng, Qi Luo, Min Zeng, Xiangyong |
description | A verifiable timed signature (VTS) scheme allows a signature to be time-locked to a known message for a predetermined duration denoted as \mathsf {T} T . Verifiability ensures that anyone can verify that the time-lock contains a valid signature without completing the computation. In this paper, we introduce a novel VTS construction method based on the RSA group, designed to maintain a constant level of size. This approach serves as an improvement over the previous linear level size construction method (CCS 2020). First, we construct it by using a commitment to a valid RSA signature. This commitment can only be opened to a regular RSA signature after a sequential computation period. Our scheme utilizes a trapdoor verifiable delay function, RSA signatures, and a specialized zero-knowledge proof to instantiate the proposed scheme. We also conduct proofs in three aspects: correctness, soundness, and security. Furthermore, we identify potential applications for VTS and present a simple Bitcoin voting protocol based on an open vote protocol by utilizing VTS. Experimental results show that our scheme is more efficient compared to the construction of VTS (CCS 2020), reducing the signature size by at least 90.5% and lowering computational costs by at least 77%. |
doi_str_mv | 10.1109/TSC.2023.3347526 |
format | Article |
fullrecord | <record><control><sourceid>crossref_RIE</sourceid><recordid>TN_cdi_ieee_primary_10375109</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>10375109</ieee_id><sourcerecordid>10_1109_TSC_2023_3347526</sourcerecordid><originalsourceid>FETCH-LOGICAL-c217t-44f7dd1aed14ff0e9e5f74b44c7c8001293171056348f7f682d2e34df80545473</originalsourceid><addsrcrecordid>eNpNkL1OwzAURi0EEqWwMzD4BVyufxInYxtBQaoEIqULQ-Qm15VRG1e2O8DTk6odmL7lnG84hNxzmHAO5eOyriYChJxIqXQm8gsyElILBgLUJRnxUpaMS62uyU2M3wC5KIpyRL4q38dk-sRq94t0hcFZZ9ZbpEu3w47WbtObdAgYqQ1-Rz_qKZ0Hf9hT6wOdudR617OZiQO78sn1G_oefPKt38ZbcmXNNuLdecfk8_lpWb2wxdv8tZouWCu4Tkwpq7uOG-y4shawxMxqtVaq1W0BwEUpueaQ5VIVVtu8EJ1AqTpbQKYypeWYwOm3DT7GgLbZB7cz4afh0BzjNEOc5hinOccZlIeT4hDxHy51NvDyD_XHYDY</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Constant-Size Verifiable Timed Signatures from RSA Group for Bitcoin-Based Voting Protocols</title><source>IEEE Electronic Library (IEL)</source><creator>Bao, Zijian ; He, Debiao ; Feng, Qi ; Luo, Min ; Zeng, Xiangyong</creator><creatorcontrib>Bao, Zijian ; He, Debiao ; Feng, Qi ; Luo, Min ; Zeng, Xiangyong</creatorcontrib><description><![CDATA[A verifiable timed signature (VTS) scheme allows a signature to be time-locked to a known message for a predetermined duration denoted as <inline-formula><tex-math notation="LaTeX">\mathsf {T}</tex-math> <mml:math><mml:mi mathvariant="sans-serif">T</mml:mi></mml:math><inline-graphic xlink:href="he-ieq1-3347526.gif"/> </inline-formula>. Verifiability ensures that anyone can verify that the time-lock contains a valid signature without completing the computation. In this paper, we introduce a novel VTS construction method based on the RSA group, designed to maintain a constant level of size. This approach serves as an improvement over the previous linear level size construction method (CCS 2020). First, we construct it by using a commitment to a valid RSA signature. This commitment can only be opened to a regular RSA signature after a sequential computation period. Our scheme utilizes a trapdoor verifiable delay function, RSA signatures, and a specialized zero-knowledge proof to instantiate the proposed scheme. We also conduct proofs in three aspects: correctness, soundness, and security. Furthermore, we identify potential applications for VTS and present a simple Bitcoin voting protocol based on an open vote protocol by utilizing VTS. Experimental results show that our scheme is more efficient compared to the construction of VTS (CCS 2020), reducing the signature size by at least 90.5% and lowering computational costs by at least 77%.]]></description><identifier>ISSN: 1939-1374</identifier><identifier>EISSN: 2372-0204</identifier><identifier>DOI: 10.1109/TSC.2023.3347526</identifier><identifier>CODEN: ITSCAD</identifier><language>eng</language><publisher>IEEE</publisher><subject>Authentication ; bitcoin voting ; Cryptography ; Delays ; Encryption ; Privacy ; Protocols ; RSA signature ; Security ; Timed signature ; zero-knowledge proof</subject><ispartof>IEEE transactions on services computing, 2024-07, Vol.17 (4), p.1414-1425</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c217t-44f7dd1aed14ff0e9e5f74b44c7c8001293171056348f7f682d2e34df80545473</cites><orcidid>0000-0002-1819-9332 ; 0000-0002-6927-7855 ; 0000-0002-2145-9713 ; 0000-0002-8351-8766 ; 0000-0002-2446-7436</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/10375109$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/10375109$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Bao, Zijian</creatorcontrib><creatorcontrib>He, Debiao</creatorcontrib><creatorcontrib>Feng, Qi</creatorcontrib><creatorcontrib>Luo, Min</creatorcontrib><creatorcontrib>Zeng, Xiangyong</creatorcontrib><title>Constant-Size Verifiable Timed Signatures from RSA Group for Bitcoin-Based Voting Protocols</title><title>IEEE transactions on services computing</title><addtitle>TSC</addtitle><description><![CDATA[A verifiable timed signature (VTS) scheme allows a signature to be time-locked to a known message for a predetermined duration denoted as <inline-formula><tex-math notation="LaTeX">\mathsf {T}</tex-math> <mml:math><mml:mi mathvariant="sans-serif">T</mml:mi></mml:math><inline-graphic xlink:href="he-ieq1-3347526.gif"/> </inline-formula>. Verifiability ensures that anyone can verify that the time-lock contains a valid signature without completing the computation. In this paper, we introduce a novel VTS construction method based on the RSA group, designed to maintain a constant level of size. This approach serves as an improvement over the previous linear level size construction method (CCS 2020). First, we construct it by using a commitment to a valid RSA signature. This commitment can only be opened to a regular RSA signature after a sequential computation period. Our scheme utilizes a trapdoor verifiable delay function, RSA signatures, and a specialized zero-knowledge proof to instantiate the proposed scheme. We also conduct proofs in three aspects: correctness, soundness, and security. Furthermore, we identify potential applications for VTS and present a simple Bitcoin voting protocol based on an open vote protocol by utilizing VTS. Experimental results show that our scheme is more efficient compared to the construction of VTS (CCS 2020), reducing the signature size by at least 90.5% and lowering computational costs by at least 77%.]]></description><subject>Authentication</subject><subject>bitcoin voting</subject><subject>Cryptography</subject><subject>Delays</subject><subject>Encryption</subject><subject>Privacy</subject><subject>Protocols</subject><subject>RSA signature</subject><subject>Security</subject><subject>Timed signature</subject><subject>zero-knowledge proof</subject><issn>1939-1374</issn><issn>2372-0204</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpNkL1OwzAURi0EEqWwMzD4BVyufxInYxtBQaoEIqULQ-Qm15VRG1e2O8DTk6odmL7lnG84hNxzmHAO5eOyriYChJxIqXQm8gsyElILBgLUJRnxUpaMS62uyU2M3wC5KIpyRL4q38dk-sRq94t0hcFZZ9ZbpEu3w47WbtObdAgYqQ1-Rz_qKZ0Hf9hT6wOdudR617OZiQO78sn1G_oefPKt38ZbcmXNNuLdecfk8_lpWb2wxdv8tZouWCu4Tkwpq7uOG-y4shawxMxqtVaq1W0BwEUpueaQ5VIVVtu8EJ1AqTpbQKYypeWYwOm3DT7GgLbZB7cz4afh0BzjNEOc5hinOccZlIeT4hDxHy51NvDyD_XHYDY</recordid><startdate>20240701</startdate><enddate>20240701</enddate><creator>Bao, Zijian</creator><creator>He, Debiao</creator><creator>Feng, Qi</creator><creator>Luo, Min</creator><creator>Zeng, Xiangyong</creator><general>IEEE</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0002-1819-9332</orcidid><orcidid>https://orcid.org/0000-0002-6927-7855</orcidid><orcidid>https://orcid.org/0000-0002-2145-9713</orcidid><orcidid>https://orcid.org/0000-0002-8351-8766</orcidid><orcidid>https://orcid.org/0000-0002-2446-7436</orcidid></search><sort><creationdate>20240701</creationdate><title>Constant-Size Verifiable Timed Signatures from RSA Group for Bitcoin-Based Voting Protocols</title><author>Bao, Zijian ; He, Debiao ; Feng, Qi ; Luo, Min ; Zeng, Xiangyong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c217t-44f7dd1aed14ff0e9e5f74b44c7c8001293171056348f7f682d2e34df80545473</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Authentication</topic><topic>bitcoin voting</topic><topic>Cryptography</topic><topic>Delays</topic><topic>Encryption</topic><topic>Privacy</topic><topic>Protocols</topic><topic>RSA signature</topic><topic>Security</topic><topic>Timed signature</topic><topic>zero-knowledge proof</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bao, Zijian</creatorcontrib><creatorcontrib>He, Debiao</creatorcontrib><creatorcontrib>Feng, Qi</creatorcontrib><creatorcontrib>Luo, Min</creatorcontrib><creatorcontrib>Zeng, Xiangyong</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><jtitle>IEEE transactions on services computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bao, Zijian</au><au>He, Debiao</au><au>Feng, Qi</au><au>Luo, Min</au><au>Zeng, Xiangyong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Constant-Size Verifiable Timed Signatures from RSA Group for Bitcoin-Based Voting Protocols</atitle><jtitle>IEEE transactions on services computing</jtitle><stitle>TSC</stitle><date>2024-07-01</date><risdate>2024</risdate><volume>17</volume><issue>4</issue><spage>1414</spage><epage>1425</epage><pages>1414-1425</pages><issn>1939-1374</issn><eissn>2372-0204</eissn><coden>ITSCAD</coden><abstract><![CDATA[A verifiable timed signature (VTS) scheme allows a signature to be time-locked to a known message for a predetermined duration denoted as <inline-formula><tex-math notation="LaTeX">\mathsf {T}</tex-math> <mml:math><mml:mi mathvariant="sans-serif">T</mml:mi></mml:math><inline-graphic xlink:href="he-ieq1-3347526.gif"/> </inline-formula>. Verifiability ensures that anyone can verify that the time-lock contains a valid signature without completing the computation. In this paper, we introduce a novel VTS construction method based on the RSA group, designed to maintain a constant level of size. This approach serves as an improvement over the previous linear level size construction method (CCS 2020). First, we construct it by using a commitment to a valid RSA signature. This commitment can only be opened to a regular RSA signature after a sequential computation period. Our scheme utilizes a trapdoor verifiable delay function, RSA signatures, and a specialized zero-knowledge proof to instantiate the proposed scheme. We also conduct proofs in three aspects: correctness, soundness, and security. Furthermore, we identify potential applications for VTS and present a simple Bitcoin voting protocol based on an open vote protocol by utilizing VTS. Experimental results show that our scheme is more efficient compared to the construction of VTS (CCS 2020), reducing the signature size by at least 90.5% and lowering computational costs by at least 77%.]]></abstract><pub>IEEE</pub><doi>10.1109/TSC.2023.3347526</doi><tpages>12</tpages><orcidid>https://orcid.org/0000-0002-1819-9332</orcidid><orcidid>https://orcid.org/0000-0002-6927-7855</orcidid><orcidid>https://orcid.org/0000-0002-2145-9713</orcidid><orcidid>https://orcid.org/0000-0002-8351-8766</orcidid><orcidid>https://orcid.org/0000-0002-2446-7436</orcidid></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1939-1374 |
ispartof | IEEE transactions on services computing, 2024-07, Vol.17 (4), p.1414-1425 |
issn | 1939-1374 2372-0204 |
language | eng |
recordid | cdi_ieee_primary_10375109 |
source | IEEE Electronic Library (IEL) |
subjects | Authentication bitcoin voting Cryptography Delays Encryption Privacy Protocols RSA signature Security Timed signature zero-knowledge proof |
title | Constant-Size Verifiable Timed Signatures from RSA Group for Bitcoin-Based Voting Protocols |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T07%3A29%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Constant-Size%20Verifiable%20Timed%20Signatures%20from%20RSA%20Group%20for%20Bitcoin-Based%20Voting%20Protocols&rft.jtitle=IEEE%20transactions%20on%20services%20computing&rft.au=Bao,%20Zijian&rft.date=2024-07-01&rft.volume=17&rft.issue=4&rft.spage=1414&rft.epage=1425&rft.pages=1414-1425&rft.issn=1939-1374&rft.eissn=2372-0204&rft.coden=ITSCAD&rft_id=info:doi/10.1109/TSC.2023.3347526&rft_dat=%3Ccrossref_RIE%3E10_1109_TSC_2023_3347526%3C/crossref_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=10375109&rfr_iscdi=true |