SLShundong Li

Shundong Li

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Shundong Li has a total of 38 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Decentralized Self-Tallying Verifiable Referendum Based on Blockchain

    by Jingjuan Yu, Shundong Li, Ping Luo, Jiawei Dou

    Elections and referendums play a vital role in a democratic society, which enable individuals to make collective decisions. In the Internet information era, electronic voting has replaced traditional paper voting. However, the centralized architecture of the electronic voting system is vulnerable to attacks and the voting records can be easily changed or even deleted. Blockchain, as a decentralized and trustworthy distributed network, offers new means for electronic voting systems. Current blockchain- based voting systems still face several challenges: they cannot achieve full verifiability in self-tallying, cannot tolerate invalid or abstained ballots, and cannot prevent Sybil attacks either. To address these challenges, we use some cryptographic primitives to construct a blockchain- based decentralized self-tallying verifiable referendum scheme to provide a transparent and secure remote electronic voting system. First, we use range zero-knowledge proofs to verify the ballot content, and for the first time, propose a novel method using bilinear pairing to verify decryption results, which significantly reduces computational burden and gas consumption during verification. Second, we ingeniously combine a threshold decryption system with a blockchain-based deposit mechanism: invalid or abstained ballots are excluded from the tally, and voters casting such ballots are incentivized to publish their partial private keys through the deposit mechanism, ensuring their exit from the decryption process without disrupting the election. We also establish an innovative access mechanism for smart contract that effectively prevents Sybil attacks. Theoretical analysis and experimental results demonstrate that our system is secure, feasible, and efficient.

  • PINQ: Privacy-Preserving Influential Nodes Query Over Encrypted Distributed Networks

    by Jingjuan Yu, Ping Luo, Yong Yu, Jiawei Dou, Shundong Li

    Identifying influential nodes in complex networks is crucial for information dissemination, epidemic control, and supply chain management, etc. As the scale of networks increases, data owners prefer to outsource identifying influential nodes to cloud servers. To protect data privacy, network data needs to be encrypted before being outsourced. So identifying influential nodes on encrypted data is necessary. Furthermore, many sensitive networks are distributed among different data owners. To identify the influential nodes in such networks, it is necessary to first obtain the whole network and then outsource the whole network to supply identify influential nodes service. Currently, there is only one scheme that supports privacy-preserving identification of influential nodes in distributed private networks, but it works on a wrong whole network, it leaks some topological characteristics of the whole network, can only support influential nodes identifying, and cannot support private querying for any influential nodes. To address these issues, we propose PINQ (privacy-preserving any influential node query scheme), the first general scheme that supports any influential node queries in private distributed networks. PINQ can query the top-k most influential nodes, the bottom k influential nodes, or nodes with influence at a specific rank. PINQ uses encryption-selection-rerandomization techniques to correctly generate the privacy whole network within distributed private networks, securely ranking the importance of nodes without leaking any network topology information, and supporting any influential node privacy queries. Additionally, PINQ uses blockchain to achieve fair data query transactions. Theoretical analysis and experimental simulation results show that PINQ is secure, feasible and efficient.

  • PDMSP: Privacy-Preserving Dynamic Multidestination Smart Parking Based on Blockchain

    by Jingjuan Yu, Yuwei Duan, Minghui Wang, Ping Luo, Jiawei Dou, Shundong Li

    Smart parking services improve parking efficiency, reducing drivers’ time and fuel consumption. However, they may expose business secrets and personal information without privacy-preserving, threatening the competitiveness of service providers and user privacy. Although some schemes have attempted to address privacy issues in parking queries, existing schemes may leak query privacy when users query multiple destination information, and are also inefficient. In addition, as parking lot data changes dynamically, most existing parking schemes exhibit inefficiency when handling dynamic data updates, and cannot flexibly respond to frequent status changes. To this end, we propose a blockchain (BC)-based privacy-preserving dynamic multidestination smart parking scheme PDMSP, which can preserve the privacy of parking lots and drivers. It supports efficient one-time multidestination queries, while preserving the query information. Furthermore, it can perform lightweight dynamic updates. Security analysis and experimental results show that our scheme is secure and efficient, and the scheme can be efficiently updated.


  • Verifiable Strong Privacy-Preserving Any-Hop Reachability Query on Blockchain-Assisted Cloud

    by Jingjuan Yu, Yuwei Duan, Ping Luo, Shundong Li

    Any-hop (k-hop) reachability query is one fundamental operation in graph data analysis and its performance affects the efficiency of various tasks in Social Internet of Things. As graph data scale increases, data is often outsourced to cloud servers. To protect the privacy of graph data, it is necessary to encrypt the data before outsourcing. Existing schemes can only support privacy-preserving 2-hop reachability queries. Only one scheme can support privacy-preserving k-hop reachability queries, but it discloses topological information and the query results is not verifiable. Most serious deficiency is that its efficiency is not practical. To address these issues, we propose a verifiable strong privacy-preserving k-hop reachability query on encrypted data. This scheme not only supports efficient privacy-preserving k-hop reachability queries without leaking any network topological information but also uses blockchain to achieve verifiability of query results. The security analysis shows that our scheme is secure. Compared to existing k-hop reachability query scheme, our scheme greatly improves query efficiency (at least $6.4\cdot 10^{5}\times $ faster when the number of nodes $n \geq 100$ ).


  • Privacy-Preserving Any-Hop Cover Shortest Distance Queries on Encrypted Graphs

    by Xueling Zhao, Minghui Wang, Zhuliang Jia, Shundong Li

    Graphs are an essential data representation method and are widely used in many scenarios. Shortest distance query is one of the most fundamental operations on a graph and has thus attracted much research attention. While various graph encryption schemes supporting shortest distance query have been proposed, there remain considerable challenges, such as information leakage, approximate query results, and large computational errors. Furthermore, existing schemes can only address 2-hop cover shortest distance queries on encrypted graphs and do not allow shortest distance queries by others. Therefore, only the graph owner (GO) can query the shortest distance based on encrypted data. To overcome these limitations, we propose a privacy-preserving any-hop cover shortest distance query scheme on encrypted graphs, called AHCSDQ. Matrices are used to compute any-hop cover shortest distance (AHCSD) between any two vertices. Our scheme preprocesses graph data and store the preprocessed results in a server, and query users can retrieve the corresponding encoding value from the appropriate matrix. This scheme enable accurate AHCSD queries while protecting graph data privacy. In addition, the GO only needs to preprocess graph data once, and the preprocessing result can be provided to multiple users for multiple queries. Furthermore, a single shortest distance query only needs the query user one encryption operation, also significantly reduces the computational cost for query users. In this article, we establish the security of our proposed scheme using a widely accepted simulation paradigm and present experimental results to demonstrate the high efficiency of scheme.


  • FPMRQ: Fully Privacy-Preserving Multidimensional Range Queries on Encrypted Data

    by Wenli Wang, Zhuliang Jia, Mengfan Xu, Shundong Li

    Multidimensional range queries are typical database operations used to retrieve data. With the development of cloud computing, outsourcing data storage and queries to a cloud server is an attractive choice for data owners; however, this choice involves well-known privacy issues. To preserve data privacy, data should be encrypted before they are outsourced to the cloud. Therefore, exploring multidimensional range queries on encrypted data has important theoretical and practical significance. Certain privacy-preserving schemes have been proposed to support multidimensional range queries on encrypted data. However, these schemes exhibit either poor privacy performance or poor computational or communication performance. This makes such schemes impractical for resource-constrained scenarios such as Internet of Things (IoT) environments. To improve security and efficiency in making them applicable to IoT environments, we propose lightweight secure vector comparison and secure double-blind protocols as building blocks to construct an efficient scheme, named the Fully Privacy-preserving Multidimensional Range Queries scheme (FPMRQ), and prove that FPMRQ can resist database reconstruction and query-recovery attacks. To improve communication efficiency, we adopt methods to pack multidimensional data into single-dimensional data and aggregate multiple data records into a single record of data. Finally, we conducted numerous experiments on real-world datasets to examine the efficiency of FPMRQ, and the experimental results show that FPMRQ significantly improves the computational efficiency (almost three orders of magnitude faster) and communication efficiency (at least 7.15× faster) in comparison with existing schemes with the same security level. These results demonstrate the practicality of the FPMRQ for resource-restrained environments, such as IoT.


  • SPCS: Strong Privacy-Preserving-Constrained Shortest Distance Queries on Encrypted Graphs

    by Wenli Wang, Zhuliang Jia, Mengfan Xu, Shundong Li

    A constrained shortest distance (CSD) query calculates the shortest distance between two vertices of a graph and places constraints on certain factors so as not to exceed corresponding thresholds. With the development of cloud computing, outsourcing graph data storage and the computation of CSD queries to a cloud platform (CP) are an attractive choice for graph owners; however, this choice is accompanied by well-known privacy issues. Certain privacy-preserving schemes have been proposed to support CSD queries on encrypted graphs, but all such schemes consider only single-CSD queries, even though, in practical applications, users may need to set two or more constraints when executing the shortest distance query. Additionally, existing schemes disclose too much private information to the CP. To address these considerable problems, we propose a strong privacy-preserving CSD query scheme called SPCS, which realizes accurate double-CSD queries without disclosing any critical private information. We prove that SPCS does not reveal any private information to the CP except for the number of vertices and conduct numerous experiments on real-world data sets to test this scheme’s efficiency. The experimental results show that SPCS is practical, especially in its computational efficiency in the graph-encryption phase, which is higher than that of available, state-of-the-art schemes.


  • Open Access

    Secure Scalar Product Protocols

    by Li Shundong, Zhang Mengyu, Xu Wenting

    Secure scalar product computation is a special secure multi-party computation problem. A secure scalar product protocol can be used by two parties to jointly compute the scalar product of their private vectors without revealing any information about the private vector of either party. Secure scalar product protocol is of great significance in privacy-preserving scientific computing, privacy preserving data mining, privacy-preserving cooperative statistical analysis and privacy-preserving geometry computation, etc. Many privacy preserving computing problems can be transformed to secure scalar product computation. At present, existing scalar product protocols cannot be used to privately compute scalar product of private vectors with both positive and negative components. Based on homomorphic encryption scheme, we design three protocols to compute scalar product of three different kinds of private vectors. The components of the first kind vector are arbitrary integers; those of the second kind are positive rational numbers and those of the third kind are arbitrary rational numbers. We use simulation paradigm proving that the protocols are secure in the semi-honest model. Theoretical analysis and experimental results show that the protocols designed in this paper are efficient.


  • Open Access

    Using Transposition Padding to Get CCA2 Security From Any Deterministic Encryption Schemes

    by Linming Gong, Mingming Wang, Xiangjian Zuo, Shundong Li, Daoshun Wang

    We study how to make any deterministic encryption scheme probabilistic and secure against adaptively chosen ciphertext attacks. A new transpositional padding encryption scheme is proposed, with which we construct a universal scheme, namely, a transpositional padding encryption scheme, which has three novel attributes: 1) it can pad a given plaintext into several different values once the randomness is chosen while the previous padding schemes only pad a given plaintext into a fixed value; 2) it introduces the randomness into a ciphertext without employing hash function or random oracle, and; 3) it enables the encrypted message to contain more useful information that may exceed the upper limit of plaintext space. Then, we give this encryption scheme an instantiation of RSA, which is proven to be indistinguishable under adaptively chosen ciphertext attacks without random oracle that assumes a variant of the standard RSA problem. The variant problem is a novel arithmetic problem, and it is weaker than the standard RSA problem.


  • Open Access

    Secure "Ratio" Computation and Efficient Protocol for General Secure Two-Party Comparison

    by Linming Gong, Shundong Li, Chunying Wu, Daoshun Wang

    Many privacy protections in distributed setting are based on secure comparison, according to which two distrusted users try to jointly determine whether a > b, a = b, or a < b. Performing "secure comparison" is fundamental to achieve widespread acceptance of privacy protection for distributed setting users. Surprisingly, however, no attention has been paid to secure comparison on fractions, to the best of our knowledge. In this paper, we first present an efficient system for computing ((ka + k(1))/(kb + k(1))), which implies the potential relationship (a > b, a = b, and a < b) between a and b, where k, k(1), and b belong to the party who doesn't have the secret of the system. Based on this system, two distrusted users in distributed setting can learn whether a > b, a = b, or a < b in one execution, without disclosing a and b to each other. Then, we develop two efficient protocols for secure comparison on integers and secure comparison on fractions, respectively. Our schemes, based on homomorphic encryption, are cryptographically secure. We prove that these protocols are secure using simulation paradigm. Our approaches can be used in many secure multi-party computation protocols that involve fractions, rational numbers, and integers. They can also be more convenient to solve some secure multiparty computational geometry problems that often involve ratio evaluation.