Cross-chain transaction technologies have greatly promoted the scalability of cryptocurrencies, which then facilitates the development of Metaverse applications. However, existing solutions rely heavily on centralized middleware (notary) or smart contracts. These schemes lack privacy considerations, and users’ cross-chain transactions are easy to master by other parties. Some signature-based payment schemes have good privacy but do not support multi-party cross-chain protocols or rely heavily on some time assumptions. The uncertainty of user behavior makes it difficult to design a secure multi-party cross-chain protocol. To solve these problems, we investigate how to design a secure multi-party cross-chain transaction protocol with offline tolerance. We propose a new signature algorithm called the pre-adaptor signature scheme, an extension of the adaptor signature scheme. The pre-adaptor signature scheme combines the multi-signature and adaptor signature schemes, which can realize the secret transmission channel between multiple parties. To provide offline tolerance, we encode our protocol into the P2SH script. Our protocol provides better privacy due to no dependence on smart contracts. The performance evaluation was conducted with ten participants. For each participant of our cross-chain protocol, the initialization and execution process can be performed in 3 milliseconds and with 6 k bytes of communication overhead at most. The cost increases linearly with the increase in the number of participants.
MIMO-OFDM is a promising technique for the broadband wireless communication system. In this paper, we propose a novel scheme that integrates multiple description coding (MDC), error resilient video coding, and unequal error protection strategy with various space time coding codes for robust video transmission over MIMO-OFDM system. The proposed MDC coder generates multiple bitstreams of equal importance which are very suitable for multiple antennas system. Furthermore, according to the contribution to the reconstructed video quality, we apply unequal error protection strategy using BLAST and STBC space time codes for each video bitstream. Experimental results have demonstrated that the proposed scheme can achieve desired tradeoff between the reconstructed video quality and the transmission efficiency
27 March 2023 in Journal of Ambient Intelligence and Humanized Computing
Asynchronous common subset (ACS) is an essential building block for Byzantine fault-tolerance and multi-party computation. The classic ACS framework is due to Ben-Or, Kemler, and Rabin (BKR), consisting of n reliable broadcast (RBC) instances and n asynchronous binary agreement (ABA) instances (where n is the total number of replicas). Despite recent progresses of practical BKR-ACS, the state-of-the-art designs are still trapped by a validity-latency tradeoff. In this paper, we propose Sweeper, a new ACS protocol that breaks the tradeoff, achieving optimal validity and latency. Moreover, Sweeper maintains other benefits including optimal resilience, signature-free, and information-theoretic settings. Sweeper is built on RBC and composable biased reproposable ABA (CBiased RABA). Different from the conventional RABA, CBiased RABA allows replicas to be more biased towards specific RABA instances. We provide generic strategies to transform existing ABA/RABA protocols and a new RABA protocol that we introduce, to CBiased RABA. Furthermore, Sweeper can achieve up to 2× the throughput of PACE-ACS (CCS 2022), the state-of-the-art ACS protocol that follows the BKR-ACS framework.