微信服务号

微信订阅号

2025-4-24- 14
Home > Archive>Volume 34, Issue 5, 2023 >2465-2481. DOI:10.13328/j.cnki.jos.006396
PDF HTML XML Export Cite reminder
Verifiable Attribute-based Timed Signatures and Its Applications
Author:
Affiliation:

Clc Number:

TP309

Fund Project:

This work is supported in part by National Natural Science Foundation of China (Grant Nos. U1536205, 61472084, 61972094 and 62032005), National Key Research and Development Program of China (Grant No. 2017YFB0802000), Shanghai Innovation Action Project under Grant No.16DZ1100200, Shanghai Science and Technology Development Funds under Grant No. 16JC1400801, Shandong Provincial Key Research and Development Program of China (Grant Nos. 2017CXGC0701 and 2018CXGC0701) and the young talent promotion project of Fujian Science and Technology Association.

  • Article
    • | |
  • Metrics
    • |
  • Reference [53]
    • |
  • Related [20]
    • |
  • Cited by
    • | |
  • Comments
    Abstract:

    A verifiable timed signature (VTS) scheme allows one to time-lock a signature on a known message for a given amount of time T such that after performing a sequential computation for time T anyone can extract the signature from the time-lock. Verifiability ensures that anyone can publicly check if a time-lock contains a valid signature on the message without solving it first, and that the signature can be obtained by solving the same for time T. This study first proposes the notion of verifiable attribute-based timed signatures (VABTS) and gives an instantiation VABTS further. The instantiation VABTS scheme can not only simultaneously support identity privacy-preserving, dynamic user revocation, traceability, timing, but also solve the problem of key escrow in attribute-based scheme. In addition, VABTS has many applications. This study lists two application scenarios of VABTS: building a privacy-preserving payment channel network for the permissioned blockchain and realizing a fair privacy-preserving multi-party computing. Finally, it is proved that the instantiation VABTS scheme is secure and efficient via formal security analysis and performance evaluation.

    Reference
    [1] Rivest RL, Shamir A, Wagner DA. Time-lock puzzles and timed-release crypto. Technical Report, MIT/LCS/TR-684, MIT Laboratory for Computer Science, 1996.
    [2] Liu J, Jager T, Kakvi SA, Warinschi B. How to build time-lock encryption. Designs, Codes and Cryptography, 2018, 86(11): 2549–2586. [doi: 10.1007/s10623-018-0461-x]
    [3] Malavolta G, Thyagarajan SAK. Homomorphic time-lock puzzles and applications. In: Proc. of the 39th Annual Int’l Cryptology Conf. Santa Barbara: Springer, 2019. 620–649.
    [4] Katz J, Loss J, Xu JY. On the security of time-lock puzzles and timed commitments. In: Proc. of the 18th Theory of Cryptography Conf. Durham: Springer, 2020. 390–413.
    [5] Boneh D, Naor M. Timed commitments. In: Proc. of the 20th Annual Int’l Cryptology Conf. Santa Barbara: Springer, 2000. 236–254.
    [6] Garay JA, Jakobsson M. Timed release of standard digital signatures. In: Proc. of the 6th Int’l Conf. on Financial Cryptography. Southampton: Springer, 2002. 168–182.
    [7] Self decrypting files. 2021. https://www.gwern.net/Self-decrypting-files
    [8] Katz J, Miller A, Shi E. Pseudonymous secure computation from time-lock puzzles. 2014. https://www.semanticscholar.org/paper/Pseudonymous-Secure-Computation-from-Time-Lock-Katz-Miller
    [9] Lin HJ, Pass R, Soni P. Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles. In: Proc. of the 58th Annual Symp. on Foundations of Computer Science. Berkeley: IEEE, 2017. 576–587.
    [10] Thyagarajan SAK, Bhat A, Malavolta G, Döttling N, Kate A, Schröder D. Verifiable timed signatures made practical. In: Proc. of the 2020 ACM SIGSAC Conf. on Computer and Communications Security. Virtual Event: ACM, 2020. 1733–1750.
    [11] Boneh D, Lynn B, Shacham H. Short signatures from the Weil pairing. In: Proc. of the 7th Int’l Conf. on the Theory and Application of Cryptology and Information Security. Security Gold Coast: Springer, 2001. 514–532.
    [12] Schnorr CP. Efficient identification and signatures for smart cards. In: Proc. of the 1989 Conf. on the Theory and Application of Cryptology. New York: Springer, 1989. 239–252.
    [13] Johnson D, Menezes A, Vanstone S. The elliptic curve digital signature algorithm (ECDSA). International Journal of Information Security, 2001, 1(1): 36–63. [doi: 10.1007/s102070100002]
    [14] Nakamoto S. Bitcoin: A peer-to-peer electronic cash system. 2008. https://bitcoin.org/bitcoin.pdf
    [15] Bitcoin wiki: Payment channels. 2021. https://en.bitcoin.it/wiki/Payment_channels
    [16] Poon J, Dryja T. The Bitcoin lightning network: Scalable off-chain instant payments. 2016. https://scholar.archive.org/work/on4k2pmakbgenbn7loxrmubroi
    [17] Bagaria V, Neu J, Tse D. Boomerang: Redundancy improves latency and throughput in payment-channel networks. In: Proc. of the 24th Int’l Conf. on Financial Cryptography and Data Security. Kota Kinabalu: Springer, 2020. 304–324.
    [18] Eckey L, Faust S, Hostáková K, Roos S. Splitting payments locally while routing inter dimensionally. IACR Cryptology ePrint Archive 2020, 2020: 555.
    [19] Egger C, Moreno-Sanchez P, Maffei M. Atomic multi-channel updates with constant collateral in bitcoin-compatible payment-channel networks. In: Proc. of the 2019 ACM SIGSAC Conf. on Computer and Communications Security. London: ACM, 2019. 801–815.
    [20] Sivaraman V, Venkatakrishnan SB, Ruan K, Negi P, Yang L, Mittal R, Fanti G, Alizadeh M. High throughput cryptocurrency routing in payment channel networks. In: Proc. of the 17th USENIX Symp. on Networked Systems Design and Implementation. Santa Clara: USENIX Association, 2020. 777–796.
    [21] Malavolta G, Moreno-Sanchez P, Kate A, Maffei M, Ravi S. Concurrency and privacy with payment-channel networks. In: Proc. of the 2017 ACM SIGSAC Conf. on Computer and Communications Security. Dallas: ACM, 2017. 455–471.
    [22] Malavolta G, Moreno-Sanchez P, Schneidewind C, Kate A, Maffei M. Anonymous multi-hop locks for blockchain scalability and interoperability. In: Proc. of the 26th Annual Network and Distributed System Security Symp. San Diego: The Internet Society, 2019.
    [23] 刘旭东, 张文芳, 王小敏. 分布式无中心授权的属性基可变门限环签名. 软件学报, 2018, 29(11): 3528–3543. http://www.jos.org.cn/1000-9825/5293.htm
    Liu XD, Zhang WF, Wang XM. Multi-authority attribute-based alterable threshold ring signature without central authority. Ruan Jian Xue Bao/Journal of Software, 2018, 29(11): 3528–3543 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/5293.htm
    [24] 张彦华, 胡予濮, 陈江山. 格上无匿名性撤销的隐藏的属性签名. 计算机学报, 2018, 41(2): 481–492. [doi: 10.11897/SP.J.1016.2018.00481]
    Zhang YH, Hu YP, Chen JS. Hidden attribute-based signatures without anonymity revocation from lattices. Chinese Journal of Computers, 2018, 41(2): 481–492 (in Chinese with English abstract). [doi: 10.11897/SP.J.1016.2018.00481]
    [25] Bentov I, Kumaresan R. How to use Bitcoin to design fair protocols. In: Proc. of the 34th Annual Cryptology Conf. Santa Barbara: Springer, 2014. 421–439.
    [26] Kumaresan R, Bentov I. How to use Bitcoin to incentivize correct computations. In: Proc. of the 2014 ACM SIGSAC Conf. on Computer and Communications Security. Scottsdale: ACM, 2014. 30–41.
    [27] Kumaresan R, Moran T, Bentov I. How to use Bitcoin to play decentralized poker. In: Proc. of the 22nd ACM SIGSAC Conf. on Computer and Communications Security. Denver: ACM, 2015. 195–206.
    [28] Sasson EB, Chiesa A, Garman C, Green M, Miers I, Tromer E, Virza M. Zerocash: Decentralized anonymous payments from Bitcoin. In: Proc. of the 2014 IEEE Symp. on Security and Privacy. Berkeley: IEEE, 2014. 459–474.
    [29] Lai RWF, Ronge V, Ruffing T, Schröder D, Thyagarajan SAK, Wang JF. Omniring: Scaling private payments without trusted setup. In: Proc. of the 2019 ACM SIGSAC Conf. on Computer and Communications Security. London: ACM, 2019. 31–48.
    [30] Cui H, Deng RH, Wang GL. An attribute-based framework for secure communications in vehicular ad hoc networks. IEEE/ACM Transactions on Networking, 2019, 27(2): 721–733. [doi: 10.1109/tnet.2019.2894625]
    [31] Mahmoody M, Moran T, Vadhan S. Time-lock puzzles in the random oracle model. In: Proc. of the 31st Annual Cryptology Conf. Santa Barbara: Springer, 2011. 39–50.
    [32] Bitansky N, Goldwasser S, Jain A, Paneth O, Vaikuntanathan V, Waters B. Time-lock puzzles from randomized encodings. In: Proc. of the 2016 ACM Conf. on Innovations in Theoretical Computer Science. Cambridge: ACM, 2016. 345–356.
    [33] Baum C, David B, Dowsley R, Nielsen JB, Oechsner S. TARDIS: Time and relative delays in simulation. IACR Cryptology ePrint Archive 2020, 2020: 537.
    [34] Ephraim N, Freitag C, Komargodski I, Pass R. Non-malleable time-lock puzzles and applications. IACR Cryptology ePrint Archive 2020, 2020: 779.
    [35] Maji HK, Prabhakaran M, Rosulek M. Attribute-based signatures: Achieving attribute-privacy and collusion-resistance. IACR Cryptology ePrint Archive 2008, 2008: 328.
    [36] Li J, Kim K. Attribute-based ring signatures. IACR Cryptology ePrint Archive 2008, 2008: 394.
    [37] Shahandashti SF, Safavi-Naini R. Threshold attribute-based signatures and their application to anonymous credential systems. In: Proc. of the 2nd Int’l Conf. on Cryptology in Africa. Gammarth: Springer, 2009. 198–216.
    [38] Li J, Au MH, Susilo W, Xie DQ, Ren K. Attribute-based signature and its applications. In: Proc. of the 5th ACM Symp. on Information, Computer and Communications Security. Beijing: ACM, 2010. 60–69.
    [39] 唐飞, 包佳立, 黄永洪, 黄东, 王惠莅. 基于属性的多授权中心身份认证方案. 通信学报, 2021, 42(3): 220–228. [doi: 10.11959/j.issn.1000-436x.2021047]
    Tang F, Bao JL, Huang YH, Huang D, Wang HL. Multi-authority attribute-based identification scheme. Journal on Communications, 2021, 42(3): 220–228. (in Chinese with English abstract) [doi: 10.11959/j.issn.1000-436x.2021047]
    [40] 张应辉, 贺江勇, 郭瑞, 郑东. 工业物联网中服务器辅助且可验证的属性基签名方案. 计算机研究与发展, 2020, 57(10): 2177–2187. [doi: 10.7544/issn1000-1239.2020.20200421]
    Zhang YH, He JY, Guo R, Zheng D. Server-Aided and verifiable attribute-based signature for industrial internet of things. Journal of Computer Research and Development, 2020, 57(10): 2177–2187. (in Chinese with English abstract) [doi: 10.7544/issn1000-1239.2020.20200421]
    [41] Okamoto T, Takashima K. Efficient attribute-based signatures for non-monotone predicates in the standard model. In: Proc. of the 14th Int’l Workshop on Public Key Cryptography. Taormina: Springer, 2011. 35–52.
    [42] Herranz J, Laguillaumie F, Libert B, Ràfols C. Short attribute-based signatures for threshold predicates. In: Proc. of the 2012 Cryptographers’ Track at the RSA Conf. San Francisco: Springer, 2012. 51–67.
    [43] Lian YL, Xu L, Huang XY. Attribute-based signatures with efficient revocation. In: Proc. of the 5th Int’l Conf. on Intelligent Networking and Collaborative Systems. Xi’an: IEEE, 2013. 573–577.
    [44] Seo JH, Emura K. Revocable identity-based encryption revisited: Security model and construction. In: Proc. of the 16th Int’l Conf. on Practice and Theory in Public-key Cryptography. Nara: Springer, 2013. 216–234.
    [45] Wei JH, Huang XY, Hu XX, Liu WF. Revocable threshold attribute-based signature against signing key exposure. In: Proc. of the 11th Int’l Conf. on Information Security Practice and Experience. Beijing: Springer, 2015. 316–330.
    [46] Boldyreva A, Goyal V, Kumar V. Identity-based encryption with efficient revocation. In: Proc. of the 15th ACM Conf. on Computer and Communications Security. Alexandria: ACM, 2008. 417–426.
    [47] Shamir A. How to share a secret. Communications of the ACM, 1979, 22(11): 612–613. [doi: 10.1145/359168.359176]
    [48] Pairing-Based Cryptography (PBC) Library. 2020. https://crypto.stanford.edu/pbc/howto.html
    [49] GMP. The GNU multiple precision arithmetic library. 2020. http://gmplib.org
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

侯慧莹,宁建廷,黄欣沂,赵运磊.可验证的属性基定时签名方案及其应用.软件学报,2023,34(5):2465-2481

Copy
Share
Article Metrics
  • Abstract:1184
  • PDF: 2881
  • HTML: 1611
  • Cited by: 0
History
  • Received:April 14,2021
  • Revised:May 22,2021
  • Online: September 16,2022
  • Published: May 06,2023
Links:Institute of Software, CASChina Computer FederationCASNSFC
You are the first2038078Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063