SYShuang Yao

Shuang Yao

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Shuang Yao has a total of 11 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • EF-CPPA: Escrow-Free Conditional Privacy-Preserving Authentication Scheme for Real-Time Emergency Messages in Smart Grids

    by Junyan Guo, Shuang Yao, Yue Song, Le Zhang, Xu Han, Liyuan Chang

    Timely and secure emergency message delivery is critical to resilient smart-grid operation and rapid disturbance response. However, existing schemes remain inadequate, leaving smart grids vulnerable to security and privacy threats and causing verification bottlenecks, particularly when nonlinear emergency measurements cannot be homomorphically aggregated, which prevents bandwidth-efficient in-network aggregation and scalable batch verification. We propose EF-CPPA, an escrow-free, conditional privacy-preserving authentication scheme for real-time emergency messaging in smart grids. EF-CPPA enables smart meters to deliver authenticated emergency messages to the CC via power gateways verifiable as legitimate relays, while ensuring the confidentiality, integrity, and unlinkability of embedded nonlinear measurements. EF-CPPA further provides conditional anonymity with accountable tracing, as well as origin authentication, intra-domain verification, and scalable batch verification under bursty multi-meter messaging. An ECDLP-based escrow-free key-generation mechanism reduces reliance on the CC and enables efficient node joining and revocation. Security analysis shows that EF-CPPA achieves existential unforgeability under chosen-message attacks (EUF-CMA) and satisfies the stated security and privacy requirements. Performance evaluation demonstrates low computational, communication, energy, and node-management overhead, making EF-CPPA suitable for security-critical, time-sensitive smart-grid emergency messaging.

  • LCE-PPDA: Lightweight Certificateless and Escrow-Free Privacy-Preserving Data Aggregation for UAV-Assisted IoT-Enabled Smart Grids

    by Liyuan Chang, Junyan Guo, Shuang Yao, Haizhen Qi, Le Zhang, Yue Song, Bin Cao

    The convergence of uncrewed aerial vehicles (UAVs) and the Internet of Things (IoT) is expected to enhance sensing coverage, connectivity, and resilience in distributed smart grids, especially in remote or infrastructure-sparse regions. In this UAV-assisted, IoT-enabled paradigm, UAVs act as aerial relays that collect, aggregate, and forward sensing data between ground devices and control centers. However, privacy-preserving data aggregation (PPDA) in such settings still faces key-escrow vulnerabilities, certificate management overhead, incomplete privacy protection, and high computational and energy costs, particularly for signature verification at UAV relays and decryption at control centers. To address these challenges, we propose LCE-PPDA, a lightweight, certificateless, and escrow-free PPDA scheme tailored for UAV-assisted, IoT-enabled smart grids. LCE-PPDA eliminates key escrow through joint key generation, adopts a hierarchical timing structure with macro-interval rekeying and micro-interval reporting, and supports ciphertext-level in-network aggregation with both individual and batch authentication at UAV relays. To ensure privacy with accountability, it integrates certificateless signatures, dynamic pseudonyms, and session-bound key masking, achieving end-to-end confidentiality, conditional anonymity, unlinkability, and accountable traceability. Formal analysis shows that LCE-PPDA achieves correctness and EUF-CMA security in the random-oracle model (ROM) under the ECDLP assumption against both Type-I and Type-II adversaries. Performance evaluation further demonstrates that LCE-PPDA reduces computational, communication, and energy overheads compared with representative schemes, providing a scalable and lightweight foundation for secure PPDA in UAV-assisted, IoT-enabled smart grids.


  • N3PA-STIN: A Novel Three-Party Authentication Protocol for Multiuser Access in Satellite Terrestrial Integrated Networks

    by Junyan Guo, Shuang Yao, Yue Song, Xu Han, Zhi Zheng, Liyuan Chang

    Satellite-terrestrial integrated network (STIN) serves as essential infrastructure for providing seamless global coverage and wireless remote subscription services. However, the inherent heterogeneity, satellite exposure, and the openness of satellite-terrestrial links pose significant security challenges for authentication, such as privacy breaches, eavesdropping, replay attacks, and identity impersonation, as well as scalability issues like dynamic node joining and revocation. Existing authentication protocols suffer from deficiencies in unlinkability, scalability, and resistance to multiple attacks, and often rely on overly optimistic assumptions regarding satellite trustworthiness. Moreover, performance bottlenecks in handling numerous user access authentication requests within short timeframes remain unresolved. To address these challenges, we propose the N3PA-STIN protocol, a novel three-party authentication protocol for multiuser access that ensures mutual trust among users, satellites, and ground stations. The protocol minimizes computational overhead through an efficient batch verification mechanism, and enhances privacy and unlinkability by employing temporary identifiers derived from one-time pseudonyms. Furthermore, the protocol ensures conditional anonymity, enabling accountability while preserving user privacy, and achieves conditional verifiability by restricting the verification of authentication messages exclusively to registered nodes. A domain key update mechanism based on the Chinese remainder theorem (CRT) supports dynamic node management, effectively addressing the scalability challenges in heterogeneous networks. Security and performance analyses demonstrate that the N3PA-STIN protocol meets the security requirements and minimizes both computational and communication overhead, making it a practical and effective solution for STIN.


  • BPRT: A blockchain‐based privacy‐preserving transaction scheme based on an efficient broadcast encryption with personalized messages

    by Shuang Yao, Dawei Zhang

    As blockchain has drawn more and more attention, much research has developed different transaction schemes with privacy preserving specialized in various fields. The nature of blockchain makes the transaction information public, which presents much risk about the leakage of user privacy. It is quite necessary to design a flexible scheme to provide privacy preserving of transaction contents with reliable audit in blockchain that is lacked in the previous works. In this paper, we propose a blockchain‐based privacy‐preserving transaction scheme based on an efficient broadcast encryption with personalized messages called BPRT. First, we propose a fully anonymous broadcast encryption with personalized messages (BEPM). Compared with existing works, it is fully anonymous, and it has lower computation cost without pairing operations. It also avoids the key escrow problem existing in other BEPM schemes. Then, we construct the BPRT based on our BEPM. Our BPRT ensures the privacy preserving of transaction contents in group transmissions, and the encrypted transaction contents avoid exposing user identity information at the same time. It enables auditor to moderately and reliably make audit of transaction contents. Furthermore, we present formal security analysis of the proposed scheme. It has been proved that our scheme satisfies transaction confidentiality, receiver anonymity and audit reliability. Subsequently, experimental results indicate that the proposed BEPM enables fast encryption and decryption, and the computation of our BPRT is in milliseconds.


  • Open Access

    Revocable One-Time Ring Signature from Pairings

    by Xu Han, Dawei Zhang, Zongmin Huang, Shuang Yao, Zuodong Wu

    Ring signature is an anonymous signature that allows a person to sign a message on behalf of a self-formed group while concealing the identification of the signer. However, due to its anonymity and unlinkability, malicious or irresponsible signers can easily attack the signature without any responsibility in some scenarios. In this paper, we propose a novel revocable one-time ring signature (roRS) scheme from bilinear pairings, which introduces linkability and mandatory revocability into ring signature. In particular, linkability can resist the double-signing attack and mandatory revocability guarantees that a revocation authority can identify the actual signer when a suspicious signer appears in any situation. The computational complexity of pairing computations is constant, and the time of the revocation phase is more efficient than previous schemes. Furthermore, our scheme is provable secure in the random oracle model, using DL, CDH, and DBDH assumptions.


  • Open Access

    An Anonymous Verifiable Random Function with Applications in Blockchain

    by Shuang Yao, Dawei Zhang

    Verifiable random function is a powerful function that provides a noninteractively public verifiable proof for its output. Recently, verifiable random function has found essential applications in designing secure consensus protocols in blockchain. How to construct secure and practical verifiable random functions has also attracted more and more attention. In this paper, we propose a practical anonymous verifiable random function. Security proofs show that the proposed anonymous verifiable random function achieves correctness, anonymity, uniqueness, and pseudorandomness. In addition, we show a concrete application of our proposed anonymous verifiable random function in blockchain to improve the consensus mechanism for Hyperledger fabric. Finally, we implement the proposed anonymous verifiable random function and evaluate its performance. Test results show that the proposed anonymous verifiable random function supports faster computing operations and has a smaller proof size.


  • Open Access

    Anonymous Certificate-Based Inner Product Broadcast Encryption

    by Shuang Yao, Dawei Zhang

    Broadcast encryption scheme enables a sender distribute the confidential content to a certain set of intended recipients. It has been applied in cloud computing, TV broadcasts, and many other scenarios. Inner product broadcast encryption takes merits of both broadcast encryption and inner product encryption. However, it is crucial to reduce the computation cost and to take the recipient’s privacy into consideration in the inner product broadcast encryption scheme. In order to address these problems, we focus on constructing a secure and practical inner product broadcast encryption scheme in this paper. First, we build an anonymous certificate-based inner product broadcast encryption scheme. Especially, we give the concrete construction and security analysis. Second, compared with the existing inner product broadcast encryption schemes, the proposed scheme has an advantage of anonymity. Security proofs show that the proposed scheme achieves confidentiality and anonymity against adaptive chosen-ciphertext attacks. Finally, we implement the proposed anonymous inner product broadcast encryption scheme and evaluate its performance. Test results show that the proposed scheme supports faster decryption operations and has higher efficiency.