- 期刊
Setup-driving Verifiably Committed Signatures within Standard Complexity Model
並列摘要
In this paper, a setup-driving verifiably committed signature based on the strong RSA assumption within the standard complexity model is presented. The idea behind our construction is that given any valid partial signature of a message m, if an arbitrator with its auxiliary input is able to generate variables called the resolution of message m such that the distribution of the resulting variables is indistinguishable from that generated by the primary signer alone from the viewpoints of all verifiers, then from which a committed signature can be derived.
被引用紀錄
Liao, C. H. (2014). 運用蟻群優化演算法於多重擷取多載波通訊系統之資源分配 [master's thesis, National Tsing Hua University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0016-0508201514073501
延伸閱讀
- GOERTZEL, B. (1992). MEASURING STATIC COMPLEXITY. International Journal of Mathematics and Mathematical Sciences, 1992(), 161-174. https://doi.org/10.1155/S0161171292000188
- Lin, H. Y., & Hung, Y. M. (2016). Selectively Secure Lightweight Strong Designated Verifier Signature Scheme from Identity-Based System. 資訊安全通訊, 22(3), 1-9. https://www.airitilibrary.com/Article/Detail?DocID=a0000270-201607-201608090012-201608090012-1-9
- Hwang, S. J., & Chen, J. Y. (2012). An Efficient Strong Designated-Verifier Ring Signature Scheme Providing One-out-of-All Signer Anonymity. 淡江理工學刊, 15(4), 381-390. https://doi.org/10.6180/jase.2012.15.4.08
- Chen, Y. W. (2005). Combining SVMs with Various Feature Selection Strategies [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2005.00479
- Yang, F. Y., & Liao, C. M. (2010). A Provably Secure and Efficient Strong Designated Verifier Signature Scheme. International Journal of Network Security, 10(3), 220-224. https://doi.org/10.6633/IJNS.201005.10(3).07