E-commerce platforms incorporate reputation systems that allow buyers to rate sellers after transactions. However, existing reputation systems face challenges such as privacy leakage, linkability, and multiple rating attacks. The feedback data can inadvertently expose user information privacy because they reveal the buyers’ identities and preferences, which deters a significant number of users from providing their ratings. Moreover, malicious actors can exploit data analysis and machine learning techniques to mine user privacy from the rating data, posing serious threats to user security and trust. This study introduces ARS-Chain, a pioneering and secure blockchain-driven anonymous reputation-sharing framework tailored for e-commerce platforms. The core of ARS-Chain is a dynamic ring addition mechanism with linkable ring signatures (LRS), where the number of LRS rings is dynamically added in alignment with the evolving purchase list, and LRS link tags are constructed with the LRS rings and item identifiers. Further, a consortium blockchain is introduced to store these anonymous ratings on e-commerce platforms. As a result, ARS-Chain ensures full anonymity while achieving cross-platform reputation sharing, making rating records unlinkable, and effectively countering multiple rating attacks. The experimental results confirm that ARS-Chain significantly enhances user information privacy protection while maintaining system performance, having an important impact on the construction of trust mechanisms for e-commerce platforms.
Multilink operation (MLO) is considered a key candidate technique in 802.11be, which allows devices to transmit and receive data using multiple links concurrently, thereby contributing to improving throughput and reducing latency. However, the performance of the MLO scheme will gradually degrade as the channel environment deteriorates. To tackle this problem, in this paper, we propose a synchronous multilink media access control (MAC) protocol with Automatic Repeat Request (called SML-ARQ). With SML-ARQ, in the contention process, MLDs are allowed to perform channel access procedures over multiple links concurrently; in the transmission process, MLDs partition a link packet into multiple blocks and then transmit these blocks using multiple links. Any failed division of a link packet is copied and retransmitted once using multiple channels concurrently; as a consequence, SML-ARQ can mitigate the adverse impact of transmission failure on system performance. A theoretical model is being developed to analyze the performance of the proposed SML-ARQ. Extensive simulations verify the efficiency of SML-ARQ and the accuracy of our theoretical model.
With the rapid development of Internet of Vehicles technology, ensuring the privacy and security of vehicle communications becomes a critical challenge. This paper proposes a novel anonymous communication scheme based on group signatures to address privacy protection and secure authentication issues in vehicular ad-hoc networks. Our approach ensures the privacy of vehicle identities while achieving efficient message authentication and traceability. Through theoretical analysis and experimental simulations, we demonstrate the superiority of our scheme in terms of computational efficiency, communication overhead, and storage requirements, all while maintaining strong resistance against various potential attacks. The evaluation results indicate that the proposed scheme provides an effective solution for secure, anonymous communication within VANET, laying a foundation for the future development of intelligent transportation systems.
Large language models produce fluent but factually unreliable statements, and the mainstream routes to factuality—retrieval augmentation and alignment fine-tuning—presuppose that authoritative external knowledge is obtainable. When that assumption fails, a distinct family applies: adversarial interaction, in which a model cross-examines another model’s claims, several agents debate an answer, or a skeptical prompt interrogates its own reasoning. This review surveys representative adversarial factuality mechanisms published from 2022 to 2026 and organizes them into a two-level taxonomy, partitioned by evidential basis and adversarial structure. Two findings stand out. First, the surveyed mechanisms populate the design space unevenly, no structure is uniformly superior, and a single failure mode recurs across structures: false consensus—premature convergence on a shared but incorrect answer. Second, the field’s diagnosis of false consensus is mature while its countermeasures remain almost entirely unverified, and evaluation is biased against internal-consistency methods because established benchmarks presuppose external ground truth. The review closes with concrete directions: standard evaluation protocols, a verification convention for countermeasures, conformity-aware mechanism design, cost reporting, and a game-theoretic formalization of adversarial examination.