Searcharxiv⌕ Search

arXiv subjects

Yuhong Liu

Publications and source records attributed to Yuhong Liu.

At least 73 records · Page 4Linked to original sources

TencentLLMEval: A Hierarchical Evaluation of Real-World Capabilities for Human-Aligned LLMs

Large language models (LLMs) have shown impressive capabilities across various natural language tasks. However, evaluating their alignment with human preferences remains a challenge. To this end, we propose a comprehensive human evaluation framework to assess LLMs' proficiency in following instructions on diverse real-world tasks. We construct a hierarchical task tree encompassing 7 major areas covering over 200 categories and over 800 tasks, which covers diverse capabilities such as question answering, reasoning, multiturn dialogue, and text generation, to evaluate LLMs in a comprehensive and in-depth manner. We also design detailed evaluation standards and processes to facilitate consistent, unbiased judgments from human evaluators. A test set of over 3,000 instances is released, spanning different difficulty levels and knowledge domains. Our work provides a standardized methodology to evaluate human alignment in LLMs for both English and Chinese. We also analyze the feasibility of automating parts of evaluation with a strong LLM (GPT-4). Our framework supports a thorough assessment of LLMs as they are integrated into real-world applications. We have made publicly available the task tree, TencentLLMEval dataset, and evaluation methodology which have been demonstrated as effective in assessing the performance of Tencent Hunyuan LLMs. By doing so, we aim to facilitate the benchmarking of advances in the development of safe and human-aligned LLMs.

cs.CL↗

VDKMS: Vehicular Decentralized Key Management System for Cellular Vehicular-to-Everything Networks, A Blockchain-Based Approach

The rapid development of intelligent transportation systems and connected vehicles has highlighted the need for secure and efficient key management systems (KMS). In this paper, we introduce VDKMS (Vehicular Decentralized Key Management System), a novel Decentralized Key Management System designed specifically as an infrastructure for Cellular Vehicular-to-Everything (V2X) networks, utilizing a blockchain-based approach. The proposed VDKMS addresses the challenges of secure communication, privacy preservation, and efficient key management in V2X scenarios. It integrates blockchain technology, Self-Sovereign Identity (SSI) principles, and Decentralized Identifiers (DIDs) to enable secure and trustworthy V2X applications among vehicles, infrastructures, and networks. We first provide a comprehensive overview of the system architecture, components, protocols, and workflows, covering aspects such as provisioning, registration, verification, and authorization. We then present a detailed performance evaluation, discussing the security properties and compatibility of the proposed solution, as well as a security analysis. Finally, we present potential applications in the vehicular ecosystem that can leverage the advantages of our approach.

cs.DC↗

Data-Driven Modeling of Landau Damping by Fourier Neural Operator

The development of machine learning techniques enables us to construct surrogate models from data of direct numerical simulations, which has important implications for modeling complex physical systems. In this paper, based on the output from 1D Vlasov-Ampere simulations, we adopt the Fourier Neural Operator (FNO) to build surrogate models of Landau fluid closure for multi-moment fluid equations from kinetic simulation data. The trained FNO is able to obtain the heat flux using electron density as input, in agreement with the true value from kinetic simulations. We compare the physical quantities obtained using the FNO and Multilayer Perceptron (MLP) architectures, and found that the results of FNO are significantly better than that of MLP.

physics.plasm-ph↗

Proxy Re-encryption based Fair Trade Protocol for Digital Goods Transactions via Smart Contracts

With the massive amount of digital data generated everyday, transactions of digital goods become a trend. One of the essential requirements for such transactions is fairness, which is defined as that both of the seller and the buyer get what they want, or neither. Current fair trade protocols generally involve a trusted third-party (TTP), which achieves fairness by heavily relying on the TTP's behaviors and the two parties' trust in the TTP. With the emergence of Blockchain, its decentralization and transparency make it a very good candidate to replace the TTP. In this work, we attempt to design a secure and fair protocol for digital goods transactions through smart contracts on Blockchain. To ensure security of the digital goods, we propose an advanced passive proxy re-encryption (PRE) scheme, which enables smart contracts to transfer the decryption right to a buyer after receiving his/her payment. Furthermore, based on smart contracts and the proposed passive PRE scheme, a fair trade protocol for digital goods transactions is proposed, whose fairness is guaranteed by the arbitration protocol. The proposed protocol supports Ciphertext publicity and repeatable sale, while involving less number of interactions. Comprehensive experiment results validate the feasibility and effectiveness of the proposed protocol.

cs.CR↗

Achieving Maximum Efficiency in Schnorr-based Multi-signature and Applications in Blockchain

Multi-signature aggregates signatures from multiple users on the same message into a joint signature, which is widely applied in blockchain to reduce the percentage of signatures in blocks and improve the throughput of transactions. The $k$-sum attacks are one of the major challenges to design secure multi-signature schemes. In this work, we address $k$-sum attacks from a novel angle by defining a Public Third Party (PTP), which is an automatic process that can be verifiable by the public and restricts the signing phase from continuing until receiving commitments from all signers. Further, a two-round multi-signature scheme MEMS with PTP is proposed, which is secure based on discrete logarithm assumption in the random oracle model. As each signer communicates directly with the PTP instead of other co-signers, the total amount of communications is significantly reduced. In addition, as PTP participates in the computation of the aggregation and signing algorithms, the computation cost left for each signer and verifier remains the same as the basis Schnorr signature. To the best of our knowledge, this is the maximum efficiency that a Schnorr-based multi-signature scheme can achieve. Further, MEMS is applied in blockchain platform, e.g., Fabric, to improve the transaction efficiency.

cs.CR↗

Secure and Efficient Multi-Signature Schemes for Fabric: An Enterprise Blockchain Platform

Digital signature is a major component of transactions on Blockchain platforms, especially in enterprise Blockchain platforms, where multiple signatures from a set of peers need to be produced to endorse a transaction. However, such process is often complex and time-consuming. Multi-signature, which can improve transaction efficiency by having a set of signers cooperate to produce a joint signature, has attracted extensive attentions. In this work, we propose two multi-signature schemes, GMS and AGMS, which are proved to be more secure and efficient than state-of-the-art multi-signature schemes. Besides, we implement the proposed schemes in a real Enterprise Blockchain platform, Fabric. Experiment results show that the proposed AGMS scheme helps achieve the goal of high transaction efficiency, low storage complexity, as well as high robustness against rogue-key attacks and k-sum problem attacks.

cs.CR↗

Interference-Limited Ultra-Reliable and Low-Latency Communications: Graph Neural Networks or Stochastic Geometry?

In this paper, we aim to improve the Quality-of-Service (QoS) of Ultra-Reliability and Low-Latency Communications (URLLC) in interference-limited wireless networks. To obtain time diversity within the channel coherence time, we first put forward a random repetition scheme that randomizes the interference power. Then, we optimize the number of reserved slots and the number of repetitions for each packet to minimize the QoS violation probability, defined as the percentage of users that cannot achieve URLLC. We build a cascaded Random Edge Graph Neural Network (REGNN) to represent the repetition scheme and develop a model-free unsupervised learning method to train it. We analyze the QoS violation probability using stochastic geometry in a symmetric scenario and apply a model-based Exhaustive Search (ES) method to find the optimal solution. Simulation results show that in the symmetric scenario, the QoS violation probabilities achieved by the model-free learning method and the model-based ES method are nearly the same. In more general scenarios, the cascaded REGNN generalizes very well in wireless networks with different scales, network topologies, cell densities, and frequency reuse factors. It outperforms the model-based ES method in the presence of the model mismatch.

eess.SP↗

Defending against Co-residence Attack in Energy-Efficient Cloud: An Optimization based Real-time Secure VM Allocation Strategy

Resource sharing among users serves as the foundation of cloud computing, which, however, may also cause vulnerabilities to diverse co-residence attacks launched by malicious virtual machines (VM) residing in the same physical server with the victim VMs. In this paper, we aim to defend against such co-residence attacks through a secure, workload-balanced, and energy-efficient VM allocation strategy. Specifically, we model the problem as an optimization problem by quantifying and minimizing three key factors: (1) the security risks, (2) the power consumption and (3) the unbalanced workloads among different physical servers. Furthermore, this work considers a realistic environmental setting by assuming a random number of VMs from different users arriving at random timings, which requires the optimization solution to be continuously evolving. As the optimization problem is NP-hard, we propose to first cluster VMs in time windows, and further adopt the Ant Colony Optimization (ACO) algorithm to identify the optimal allocation strategy for each time window. Comprehensive experimental results based on real world cloud traces validates the effectiveness of the proposed scheme.

cs.DC↗

Secure IoT Routing: Selective Forwarding Attacks and Trust-based Defenses in RPL Network

IPv6 Routing Protocol for Low Power and Lossy Networks (RPL) is an essential routing protocol to enable communications for IoT networks with low power devices. RPL uses an objective function and routing constraints to find an optimized routing path for each node in the network. However, recent research has shown that topological attacks, such as selective forwarding attacks, pose great challenges to the secure routing of IoT networks. Many conventional secure routing solutions, on the other hand, are computationally heavy to be directly applied in resource-constrained IoT networks. There is an urgent need to develop lightweight secure routing solutions for IoT networks. In this paper, we first design and implement a series of advanced selective forwarding attacks from the attack perspective, which can flexibly select the type and percentage of forwarding packets in an energy efficient way, and even bad-mouth other innocent nodes in the network. Experiment results show that the proposed attacks can maximize the attack consequences (i.e. number of dropped packets) while maintaining undetected. Moreover, we propose a lightweight trust-based defense solution to detect and eliminate malicious selective forwarding nodes from the network. The results show that the proposed defense solution can achieve high detection accuracy with very limited extra energy usage (i.e. 3.4%).

cs.NI↗

An Efficient SDN Architecture for Smart Home Security Accelerated by FPGA

With the rise in Internet of Things (IoT) devices, home network management and security are becoming complex. There is an urgent requirement to make smart home network management efficient. This work proposes an SDN-based architecture to secure smart home networks through K-Nearest Neighbor (KNN) based device classifications and malicious traffic detection. The efficiency is further enhanced by offloading the computation-intensive KNN model to Field Programmable Gate Arrays (FPGA), which offers parallel processing power of GPU platforms at lower costs and higher efficiencies, and can be used to accelerate time-sensitive tasks. The proposed parallelization and implementation of KNN on FPGA are achieved by using the Vivado Design Suite from Xilinx and High-Level Synthesis (HLS). When optimized with 10-fold cross-validation, the proposed solution for KNN consistently exhibits the best performances on FPGA when compared with four alternative KNN instances (i.e., 78% faster than the parallel bubble sort-based implementation and 99\% faster than the other three sorting algorithms). Moreover, with 36,225 training samples, the proposed KNN solution classifies a test query with 95% accuracy in approximately 4 milliseconds on FPGA compared to 57 seconds on a CPU platform.

cs.CR↗

Securing Smart Homes via Software-Defined Networking and Low-Cost Traffic Classification

IoT devices have become popular targets for various network attacks due to their lack of industry-wide security standards. In this work, we focus on smart home IoT device identification and defending them against Distributed Denial of Service (DDoS) attacks. The proposed framework protects smart homes by using VLAN-based network isolation. This architecture has two VLANs: one with non-verified devices and the other with verified devices, both of which are managed by the SDN controller. Lightweight stateless flow-based features, including ICMP, TCP, and UDP protocol percentage, packet count and size, and IP diversity ratio, are proposed for efficient feature collections. Further analysis is performed to minimize training data to run on resource-constrained edge devices in smart home networks. Three popular machine learning algorithms, including K-Nearest-Neighbors, Random Forest, and Support Vector Machines, are used to classify IoT devices and detect different types of DDoS attacks, including TCP-SYN, UDP, and ICMP. The system's effectiveness and efficiency are evaluated by emulating a network consisting of an Open vSwitch, Faucet SDN controller, and several IoT device traces from two different testbeds.

cs.CR↗

The Impact of DoS Attacks onResource-constrained IoT Devices:A Study on the Mirai Attack

Mirai is a type of malware that creates a botnet of internet-connected devices, which can later be used to infect other devices or servers. This paper aims to analyze and explain the Mirai code and create a low-cost simulation environment to aid in the dynamic analysis of Mirai. Further, we perform controlled Denial-of-Service attacks while measuring resource consumption on resource-constrained compromised and victim Internet-of-Things (IoT) devices, such as energy consumption, CPU utilization, memory utilization, Ethernet input/output performance, and Secure Digital card usage. The experimental setup shows that when a compromised device sends a User Datagram Protocol (UDP) flood, it consumes 38.44% more energy than its regular usage. In the case of Secure Digital usage, the victim, when flooded with Transmission Control Protocol (TCP) messages, uses 64.6% more storage for reading and 55.45% more for writing. The significant extra resource consumption caused by Mirai attacks on resource-constrained IoT devices can severely threaten such devices' wide adoption and raises great challenges for the security designs in the resource-constrained IoT environment.

cs.CR↗

Quantum state engineering by nonlinear quantum interference

Multi-photon quantum interference is the underlying principle for optical quantum information processing protocols. Indistinguishability is the key to quantum interference. Therefore, the success of many protocols in optical quantum information processing relies on the availability of photon states with a well-defined spatial and temporal mode. Photons in single spatial mode can be obtained from nonlinear processes in single-mode waveguides. For the temporal mode, the common approach is to engineer the nonlinear processes. But it is complicated because the spectral properties and the nonlinear interaction are often intertwined through phase matching condition. In this paper, we study a different approach which is based on an SU(1,1) nonlinear interferometer with a pulsed pump and a controllable linear spectral phase shift for precise engineering. We systematically analyze the important figures of merit such as modal purity and heralding efficiency to investigate the feasibility of this approach. Specifically, we analyze in detail the requirement on the spectral phase engineering to optimize the figures of merit and apply numerical simulations to a fiber system. Both modal purity and efficiency are improved simultaneously. Furthermore, a novel multi-stage nonlinear interferometer is proposed and shown to achieve more precise state engineering for near-ideal single-mode operation and near-unity efficiency. We also extend the study to the case of high gain in the four-wave mixing process for the spectral engineering of quantum entanglement in continuous variables. Our investigation provides a new approach for precisely tailoring the spectral property of quantum light sources, especially, photon pairs can be engineered to simultaneously possess the features of high purity, high collection efficiency, high brightness, and high flexibility in wavelength and bandwidth selection.

quant-ph↗

Direct temporal mode measurement for the characterization of temporally multiplexed high dimensional quantum entanglement in continuous variables

Field-orthogonal temporal mode analysis of optical fields is recently developed for a new framework of quantum information science. But so far, the exact profiles of the temporal modes are not known, which makes it difficult to achieve mode selection and de-multiplexing. Here, we report a novel method that measures directly the exact form of the temporal modes. This in turn enables us to make mode-orthogonal homodyne detection with mode-matched local oscillators. We apply the method to a pulse-pumped, specially engineered fiber parametric amplifier and demonstrate temporally multiplexed multi-dimensional quantum entanglement of continuous variables in telecom wavelength. The temporal mode characterization technique can be generalized to other pulse-excited systems to find their eigen modes for multiplexing in temporal domain.

quant-ph↗

Accessible precisions for estimating two conjugate parameters using Gaussian probes

We analyse the precision limits for simultaneous estimation of a pair of conjugate parameters in a displacement channel using Gaussian probes. Having a set of squeezed states as an initial resource, we compute the Holevo Cramér-Rao bound to investigate the best achievable estimation precisions if only passive linear operations are allowed to be performed on the resource prior to probing the channel. The analysis reveals the optimal measurement scheme and allows us to quantify the best precision for one parameter when the precision of the second conjugate parameter is fixed. To estimate the conjugate parameter pair with equal precision, our analysis shows that the optimal probe is obtained by combining two squeezed states with orthogonal squeezing quadratures on a 50:50 beam splitter. If different importance are attached to each parameter, then the optimal mixing ratio is no longer 50:50. Instead it follows a simple function of the available squeezing and the relative importance between the two parameters.

quant-ph↗

Measuring the continuous variable quantum entanglement with a parametric amplifier assisted homodyne detection

Traditional method for measuring continuous-variable quantum entanglement relies on balanced homodyne detections, which are sensitive to vacuum quantum noise coupled in through losses resulted from many factors such as detector's quantum efficiency and mode mismatching between detected field and local oscillator. In this paper, we propose and analyze a new measurement method, which is realized by assisting the balanced homodyne detections with a high gain phase sensitive parametric amplifier. The employment of the high gain parametric amplifier helps to tackle the vacuum quantum noise originated from detection losses. Moreover, because the high gain parametric amplifier can couple two fields of different types in a phase sensitive manner, the proposed scheme can be used to reveal quantum entanglement between two fields of different types by using only one balanced homodyne detection. Furthermore, detailed analysis shows that in the multi-mode case, the proposed scheme is also advantageous over the traditional method. Such a new measurement method should find wide applications in quantum information and quantum metrology involving measurement of continuous variables.

quant-ph↗

GraphSE$^2$: An Encrypted Graph Database for Privacy-Preserving Social Search

In this paper, we propose GraphSE$^2$, an encrypted graph database for online social network services to address massive data breaches. GraphSE$^2$ preserves the functionality of social search, a key enabler for quality social network services, where social search queries are conducted on a large-scale social graph and meanwhile perform set and computational operations on user-generated contents. To enable efficient privacy-preserving social search, GraphSE$^2$ provides an encrypted structural data model to facilitate parallel and encrypted graph data access. It is also designed to decompose complex social search queries into atomic operations and realise them via interchangeable protocols in a fast and scalable manner. We build GraphSE$^2$ with various queries supported in the Facebook graph search engine and implement a full-fledged prototype. Extensive evaluations on Azure Cloud demonstrate that GraphSE$^2$ is practical for querying a social graph with a million of users.

cs.CR↗

Thinkey: A Scalable Blockchain Architecture

This paper presents Thinkey, an efficient, secure, infinitely scalable and decentralized blockchain architecture. It ensures system correctness and liveness by a multi-layer structure. In particular, the system is based on a double-chain architecture and uses a multi-layer consensus protocol to guarantee consistency. Thinkey also uses a novel account model which is based on Actor Model to support the complex logic in the multi-chain structure. Experiment results show that the proposed Thinkey architecture can achieve higher throughput as the number of nodes increases.

cs.CR↗