Yunqing Sun
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Yunqing Sun has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Xiao Wang
Northwestern University, Evanston, USA
3 shared publications - Ben Niu
Institute of Information Engineering, Chinese Academy of Sciences
2 shared publications - Hanlin Liu
Northwestern University
2 shared publications - Jin Cao
Xidian University
2 shared publications - Ang Li
Department of Electrical and Computer Engineering, Duke University, Durham, NC, USA
1 shared publication - Binghui Wang
Illinois Institute of Technology, Chicago, IL, USA
1 shared publication
Latest Publications
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 2731-2744
Communication-Efficient Private Join and Compute over Distributed Input Sets
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 2731-2744
Open AccessCommunication-Efficient Private Join and Compute over Distributed Input Sets
- Open Access
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 3635-3648
Committed Vector Oblivious Linear Evaluation and Its Applications
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 3635-3648
Open AccessCommitted Vector Oblivious Linear Evaluation and Its Applications
- Open Access
- 2 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 1478-1492
Actively Secure Private Set Intersection in the Client-Server Setting
Private set intersection (PSI) allows two parties to compute the intersection of their sets without revealing anything else. In some applications of PSI, a server holds a large set and runs a PSI protocol with multiple clients, each with its own smaller set. In this setting, existing protocols fall short: they either achieve only semi-honest security, or else require the server to run the protocol from scratch for each execution. We design an efficient protocol for this setting with simulation-based security against malicious adversaries. In our protocol, the server publishes a one-time, linear-size encoding of its set. Then, multiple clients can independently execute a PSI protocol with the server, with complexity linear in the size of each client's set. To learn the intersection, a client can download the server's encoding, which can be accelerated via content-distribution or peer-to-peer networks since the same encoding is used by all clients; alternatively, clients can fetch only the relevant parts of the encoding using verifiable private information retrieval. A key ingredient of our protocol is an efficient instantiation of an oblivious verifiable unpredictable function, which may be of independent interest. Our implementation shows that our protocol is highly efficient. For a server holding 108 elements and each client holding 103 elements, the size of the server's encoding is 800MB; an execution of the protocol uses 60MB of communication, runs in under 5s in a WAN network with 120 Mbps bandwidth, and costs only 0.017 USD when utilizing network-caching infrastructures, a 5× saving compared to a state-of-the-art PSI protocol.
- 2 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 1478-1492
Open AccessActively Secure Private Set Intersection in the Client-Server Setting
Private set intersection (PSI) allows two parties to compute the intersection of their sets without revealing anything else. In some applications of PSI, a server holds a large set and runs a PSI protocol with multiple clients, each with its own smaller set. In this setting, existing protocols fall short: they either achieve only semi-honest security, or else require the server to run the protocol from scratch for each execution. We design an efficient protocol for this setting with simulation-based security against malicious adversaries. In our protocol, the server publishes a one-time, linear-size encoding of its set. Then, multiple clients can independently execute a PSI protocol with the server, with complexity linear in the size of each client's set. To learn the intersection, a client can download the server's encoding, which can be accelerated via content-distribution or peer-to-peer networks since the same encoding is used by all clients; alternatively, clients can fetch only the relevant parts of the encoding using verifiable private information retrieval. A key ingredient of our protocol is an efficient instantiation of an oblivious verifiable unpredictable function, which may be of independent interest. Our implementation shows that our protocol is highly efficient. For a server holding 108 elements and each client holding 103 elements, the size of the server's encoding is 800MB; an execution of the protocol uses 60MB of communication, runs in under 5s in a WAN network with 120 Mbps bandwidth, and costs only 0.017 USD when utilizing network-caching infrastructures, a 5× saving compared to a state-of-the-art PSI protocol.
- 19 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 22 (3) , 2352-2366
Recipient-Aware Photo Automatic Deletion Control Policy Recommendation Scheme in Online Social Networks
Content sharing, whether in Online Social Networks (OSNs) or even in the Internet of Things (IoT), serves as a pivotal link in the flow of data. To better protect the privacy of shared content, current OSNs allow sharers to manually set policies for uploaded content. However, this method of policy setting is not suitable for scenarios where IoT is deeply integrated with OSNs, as IoT devices often share content frequently and automatically. To address this issue, we propose the design, implementation, and evaluation of SmartCircles, a personalized photo-sharing and automatic deletion scheme. SmartCircles can function as a plugin within existing OSNs, supporting operations on various smart devices. It encompasses the following steps: a) Before sharing a photo, calculate the intimacy level depicted in the photo and the sharer's willingness to share. b) Before the recipient views the photo, calculate the intimacy between the sharer and the recipient, and evaluate feedback from the recipient. c) Based on the results computed above and a trade-off between profit and loss, recommend a recipient-aware automatic deletion control policy for the photo. We implement a prototype of SmartCircles, and the evaluation results demonstrate its effectiveness with an accuracy rate of policy recommendations reaching approximately 92%
- 19 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 22 (3) , 2352-2366
Recipient-Aware Photo Automatic Deletion Control Policy Recommendation Scheme in Online Social Networks
Content sharing, whether in Online Social Networks (OSNs) or even in the Internet of Things (IoT), serves as a pivotal link in the flow of data. To better protect the privacy of shared content, current OSNs allow sharers to manually set policies for uploaded content. However, this method of policy setting is not suitable for scenarios where IoT is deeply integrated with OSNs, as IoT devices often share content frequently and automatically. To address this issue, we propose the design, implementation, and evaluation of SmartCircles, a personalized photo-sharing and automatic deletion scheme. SmartCircles can function as a plugin within existing OSNs, supporting operations on various smart devices. It encompasses the following steps: a) Before sharing a photo, calculate the intimacy level depicted in the photo and the sharer's willingness to share. b) Before the recipient views the photo, calculate the intimacy between the sharer and the recipient, and evaluate feedback from the recipient. c) Based on the results computed above and a trade-off between profit and loss, recommend a recipient-aware automatic deletion control policy for the photo. We implement a prototype of SmartCircles, and the evaluation results demonstrate its effectiveness with an accuracy rate of policy recommendations reaching approximately 92%
- 24 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Network
- Vol. 39 (1) , 157-164
When Web 3.0 Meets Reality: A Hyperdimensional Fractal Polytope P2P Ecosystem
Web 3.0 introduces the concept of crypto-network entities, which are independently defined by public key pairs and connected to Web 3.0 cyberspace. In this paper, we present a spacetime coordinate system that is based on fractal polytopes in any dimension, utilizing blockchain technology for discrete time and consensus. Furthermore, we define novel network entities and functions that utilize hyperdimensional deterministic switching and routing protocols, as well as blockchain-enabled mutual authentication. In addition to our spacetime network architecture, we devise a multi-tier identity scheme that extends the native Web 3.0 crypto-network-entity to the outer cyber and physical world, including internet infrastructure and future generations of mobile networks, such as 6G. This provides legal compliance with anonymity and linkability to all derived identifiers of entities. By integrating crypto-network entities and novel hyperdimensional space-time networks, we establish a unified, holistic Web 3.0 network that is persistent in both spacetimes and extended to our cyber and physical world.
- 24 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Network
- Vol. 39 (1) , 157-164
When Web 3.0 Meets Reality: A Hyperdimensional Fractal Polytope P2P Ecosystem
Web 3.0 introduces the concept of crypto-network entities, which are independently defined by public key pairs and connected to Web 3.0 cyberspace. In this paper, we present a spacetime coordinate system that is based on fractal polytopes in any dimension, utilizing blockchain technology for discrete time and consensus. Furthermore, we define novel network entities and functions that utilize hyperdimensional deterministic switching and routing protocols, as well as blockchain-enabled mutual authentication. In addition to our spacetime network architecture, we devise a multi-tier identity scheme that extends the native Web 3.0 crypto-network-entity to the outer cyber and physical world, including internet infrastructure and future generations of mobile networks, such as 6G. This provides legal compliance with anonymity and linkability to all derived identifiers of entities. By integrating crypto-network entities and novel hyperdimensional space-time networks, we establish a unified, holistic Web 3.0 network that is persistent in both spacetimes and extended to our cyber and physical world.
- 19 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (8) , 9733-9748
An Anonymous and Secure Data Transmission Mechanism With Trajectory Tracking for D2D Relay Communication in 3GPP 5G Networks
Device-to-device (D2D) communication, as a traffic offloading technology in the fifth-generation (5G) network, can be widely used in several scenarios to provide 5G characteristics of higher speed, lower latency, and larger capacity. D2D data transmission over wireless channels among mobile devices is vulnerable to security threats and privacy violations from third parties and relay nodes. However, academia and industry have yet to propose relevant schemes or standards for D2D relay data transmission scenarios. We first propose a generic construction for D2D relay communication in this paper. Then, a concrete anonymous and secure D2D data transmission scheme with trajectory tracking is presented based on Chebyshev polynomials, hash-based message authentication code, and symmetric encryption. We employ a formal verification tool -Tamarin, modal logic analysis -BAN logic, and informal security analysis to demonstrate the security features of the proposed scheme. The performance evaluation shows that the proposed scheme can achieve desirable efficiency compared with other related schemes. Finally, we developed an APP‘, D2DWatchmen’, to simulate the whole protocol and test its robustness and real execution time, where the result shows good availability and effectiveness.
- 19 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (8) , 9733-9748
An Anonymous and Secure Data Transmission Mechanism With Trajectory Tracking for D2D Relay Communication in 3GPP 5G Networks
Device-to-device (D2D) communication, as a traffic offloading technology in the fifth-generation (5G) network, can be widely used in several scenarios to provide 5G characteristics of higher speed, lower latency, and larger capacity. D2D data transmission over wireless channels among mobile devices is vulnerable to security threats and privacy violations from third parties and relay nodes. However, academia and industry have yet to propose relevant schemes or standards for D2D relay data transmission scenarios. We first propose a generic construction for D2D relay communication in this paper. Then, a concrete anonymous and secure D2D data transmission scheme with trajectory tracking is presented based on Chebyshev polynomials, hash-based message authentication code, and symmetric encryption. We employ a formal verification tool -Tamarin, modal logic analysis -BAN logic, and informal security analysis to demonstrate the security features of the proposed scheme. The performance evaluation shows that the proposed scheme can achieve desirable efficiency compared with other related schemes. Finally, we developed an APP‘, D2DWatchmen’, to simulate the whole protocol and test its robustness and real execution time, where the result shows good availability and effectiveness.