WIKINDX Resources

Duan, J., Zheng, S., Wang, W., Wang, L., Hu, X., & Gu, L. (2024). Concise ringct protocol based on linkable threshold ring signature. IEEE Transactions on Dependable and Secure Computing, (1), 1–15. 
Added by: Jack (2024-02-27 13:40)   Last edited by: Jack (2024-02-27 13:42)
Resource type: Journal Article
BibTeX citation key: Duan2024
View all bibliographic details
Categories: Monero-focused
Creators: Duan, Gu, Hu, Wang, Wang, Zheng
Collection: IEEE Transactions on Dependable and Secure Computing
Views: 128/1054
Attachments   Concise_RingCT_Protocol_Based_on_Linkable_Threshold_Ring_Signature.pdf [38/248] URLs   https://www.comput ... 440486/1UGSjZvNRja
Ring Confidential Transactions (RingCT) is a typical privacy-preserving protocol for blockchain, which is used for the most popular anonymous cryptocurrency Monero in recent years. RingCT provides the user's identity anonymity based on the linkable ring signature. At the cost of that, the transaction size is increased linearly to the involved users. In this article, we aim to overcome this inefficient aspect of RingCT by introducing the linkable threshold ring signature (LTRS). We first propose a construction of threshold ring signatures for homomorphic cryptosystems, and present an efficient instantiation based on the intractability assumption of the discrete logarithm problem. Based on this framework, an efficient LTRS scheme and a novel construction of the RingCT protocol are presented. Our proposed RingCT protocol enables multiple payers to co-construct an anonymous transaction without revealing their secret account keys, and it is more concise under multiple input accounts. For a transaction with a ring size of 100 and the input accounts number of 64, the communication overhead is about 4% of the original RingCT protocol.
WIKINDX 6.5.0 | Total resources: 215 | Username: -- | Bibliography: WIKINDX Master Bibliography | Style: American Psychological Association (APA)