arXiv subjects

Yuansong Qiao

Publications and source records attributed to Yuansong Qiao.

5 recordsLinked to original sources

arXiv2026

TeeMAF: A TEE-Based Mutual Attestation Framework for On-Chain and Off-Chain Functions in Blockchain DApps

The rapid development of Internet of Things (IoT) technology has led to growing concerns about data security and user privacy in the interactions within distributed systems. Decentralized Applications (DApps) in distributed systems consist of on-chain and off-chain functions, where on-chain functions are smart contracts running in the blockchain network, while off-chain functions operate outside the blockchain. Since smart contracts cannot access off-chain information, they cannot verify whether the off-chain functions, i.e. the software components, they interact with have been tampered or not. As a result, establishing mutual trust between the on-chain smart contracts and the off-chain functions remains a significant challenge. To address the challenge, this paper introduces TeeMAF, a generic framework for mutual attestation between on-chain and off-chain functions, leveraging Trusted Execution Environments (TEE), specifically Intel Software Guard Extensions (SGX), SCONE (a TEE container on top of Intel SGX), and remote attestation technologies. This ensures that the deployed off-chain functions of a DApp execute in a provably secure computing environment and achieve mutual attestation with the interacting on-chain functions. Through a security analysis of TeeMAF, the reliability of deployed DApps can be verified, ensuring their correct execution. Furthermore, based on this framework, this paper proposes a decentralized resource orchestration platform (a specific DApp) for deploying applications over untrusted environments. The system is implemented on Ethereum and benchmarked using Hyperledger Caliper. Performance evaluation focusing on throughput and latency demonstrates that, compared to platforms without a mutual attestation scheme, the performance overhead remains within an acceptable range.

cs.CR↗

arXiv2021

R2P2: Reactive Routing and Payment Protocol for Named Data Network using Blockchain

With the continuous emergence of new mobile devices which support new communication paradigms such as D2D and V2V, Internet users can take advantage of these devices to achieve better Internet connectivity and improve service quality. Meanwhile, packet forwarding brings extra costs to devices (e.g. electricity consumption), that hinders the realisation of successful ad-hoc networks. This paper proposes Reactive Routing and Payment Protocol (R2P2) to incentivise mobile devices to contribute idle networking resources and gain monetary returns. The routing and payment protocol is developed for Named-Data Network (NDN) because its content-centric nature can better support the intermittent and ephemeral communication requirements in ad-hoc networks. Blockchain is used as the settlement platform for transactions between devices because of its neutrality, robustness and trust. R2P2 is still an on-going project. The content of this paper focuses on the design of R2P2.

cs.NI↗

arXiv2020

PPTP: Price-based Path-specified Transport Protocol for Named Data Network using Blockchain

Serving as a potential future Internet architecture, Named Data Network (NDN) offers superior information-centric architectural support for mobile ad-hoc networking. Using NDN as an underlying protocol, end-user devices (e.g. IoT device and smart phone) formulate a multi-hop (mesh) network, in which certain devices play a role of forwarding packets for others and/or act as gateways to access the Internet. Nevertheless, an autonomous (selfish) node in an ad-hoc network has two disincentives for forwarding packets for others: energy expenditure and possible delays for its own data. This paper introduces Price-based Path-specified Transport Protocol (PPT) for NDN, using blockchain as a payment platform to support money transfers between autonomous nodes thus to incentivise packet forwarding. In PPTP, routers advertise their expected prices for packet forwarding and consumers estimate the costs and select the appropriate paths for content downloading. PPTP is still an on-going project therefore this paper will present the design principle and planed functions, and show how PPTP are related to other existing blockchain-based networking solutions.

cs.NI↗

arXiv2018

PTP: Path-specified Transport Protocol for Concurrent Multipath Transmission in Named Data Networks

Named Data Networking (NDN) is a promising Future Internet architecture to support content distribution. Its inherent addressless routing paradigm brings valuable characteristics to improve the transmission robustness and efficiency, e.g. users are enabled to download content from multiple providers concurrently. However, multipath transmission NDN is different from that in Multipath TCP, i.e. the "paths" in NDN are transparent to and uncontrollable by users. To this end, the user controls the traffic on all transmission paths as an entirety, which leads to a noticeable problem of low bandwidth utilization. In particular, the congestion of a certain path will trigger the traffic reduction on the other transmission paths that are underutilized. Some solutions have been proposed by letting routers balance the loads of different paths to avoid congesting a certain path prematurely. However, the complexity of obtaining an optimal load balancing solution (of solving a Multi-Commodity Flow problem) becomes higher with the increasing network size, which limits the universal NDN deployments. This paper introduces a compromising solution - Path-specified Transport Protocol (PTP). PTP supports both the label switching and the addressless routing schemes. Specifically, the label switching scheme facilitates users to precisely control the traffic on each transmission path, and the addressless routing scheme maintains the valuable feature of retrieving content from any provider to guarantee robustness. As the traffic on a transmission path can be explicitly controlled by consumers, load balancing is no longer needed in routers, which reduce the computational burden of routers and consequently increase the system scalability. The experimental results show that PTP significantly increases the users' downloading rates and improved the network throughput.

cs.NI↗

arXiv2018

MVP2P: Layer-Dependency-Aware Live MVC Video Streaming over Peer-to-Peer Networks

Multiview video supports observing a scene from different viewpoints. The Joint Video Team (JVT) developed H.264/MVC to enhance the compression efficiency for multiview video, however, MVC encoded multiview video (MVC video) still requires high bitrates for transmission. This paper investigates live MVC video streaming over Peer-to-Peer (P2P) networks. The goal is to minimize the server bandwidth costs whist ensuring high streaming quality to peers. MVC employs intra-view and inter-view prediction structures, which leads to a complicated layer dependency relationship. As the peers' outbound bandwidth is shared while supplying all the MVC video layers, the bandwidth allocation to one MVC layer affects the available outbound bandwidth of the other layers. To optimise the utilisation of the peers' outbound bandwidth for providing video layers, a maximum flow based model is proposed which considers the MVC video layer dependency and the layer supplying relationship between peers. Based on the model, a layer dependency aware live MVC video streaming method over a BitTorrent-like P2P network is proposed, named MVP2P. The key components of MVP2P include a chunk scheduling strategy and a peer selection strategy for receiving peers, and a bandwidth scheduling algorithm for supplying peers. To evaluate the efficiency of the proposed solution, MVP2P is compared with existing methods considering the constraints of peer bandwidth, peer numbers, view switching rates, and peer churns. The test results show that MVP2P significantly outperforms the existing methods.

cs.MM↗