Achieving Privacy-Preserving and Verifiable Support Vector Machine Training in the Cloud

Hu, Chenfei; Zhang, Chuan; Lei, Dian; Wu, Tong; Liu, Ximeng; Zhu, Liehuang

doi:10.1109/tifs.2023.3283104

Cited by 48 publications

(19 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An ORE scheme over a well-ordered domain D is correct if for sk ← ORE.Setup(1 λ ) and all messages m1, m2 ∈ D [29][30][31]:…”

Section: Model Of a Time-varying Network Querymentioning

confidence: 99%

A Swell Neural Network Algorithm for Solving Time-Varying Path Query Problems with Privacy Protection

Zhao

2024

Electronics

View full text Add to dashboard Cite

In this paper, a swell neural network (SNN) algorithm was proposed for solving time-varying path query (TVPQ) problems with privacy protection with the following goals: (i) querying the K-nearest paths with time limitations in a time-varying scenario, and (ii) protecting private information from neighborhood attacks. The proposed SNN is a network in which the optimal paths can be calculated at the same time with no need for training. For TVPQ, a node is considered a neuron, and time-varying means that an edge has different costs in different time windows. For SNN, the query paths are swell sets from the start to the target within an upper limit. An encrypted index is designed for privacy protection. The evaluation of the efficiency and accuracy of the SNN was carried out based on New York road instances.

show abstract

“…An ORE scheme over a well-ordered domain D is correct if for sk ← ORE.Setup(1 λ ) and all messages m1, m2 ∈ D [29][30][31]:…”

Section: Model Of a Time-varying Network Querymentioning

confidence: 99%

A Swell Neural Network Algorithm for Solving Time-Varying Path Query Problems with Privacy Protection

Zhao

2024

Electronics

View full text Add to dashboard Cite

show abstract

“…When energy consumers actively participate in microgrid electricity transactions, the opportunities lie in enhancing energy independence and promoting sustainable development. However, this also brings about regulatory complexities 9 , interoperability requirements 10 , data privacy concerns 11 , 12 , and challenges related to supply-demand balance 13 .…”

Section: Introductionmentioning

confidence: 99%

A secure and highly efficient blockchain PBFT consensus algorithm for microgrid power trading

Yao,

Fang,

Pan

et al. 2024

Sci Rep

View full text Add to dashboard Cite

There are a series of challenges in microgrid transactions, and blockchain technology holds the promise of addressing these challenges. However, with the increasing number of users in microgrid transactions, existing blockchain systems may struggle to meet the growing demands for transactions. Therefore, this paper proposes an efficient and secure blockchain consensus algorithm designed to meet the demands of large-scale microgrid electricity transactions. The algorithm begins by utilizing a Spectral clustering algorithm to partition the blockchain network into different lower-level consensus set based on the transaction characteristics of nodes. Subsequently, a dual-layer consensus process is employed to enhance the efficiency of consensus. Additionally, we have designed a secure consensus set leader election strategy to promptly identify leaders with excellent performance. Finally, we have introduced an authentication method that combines zero-knowledge proofs and key sharing to further mitigate the risk of malicious nodes participating in the consensus. Theoretical analysis indicates that our proposed consensus algorithm, incorporating multiple layers of security measures, effectively withstands blockchain attacks such as denial of service. Simulation experiment results demonstrate that our algorithm outperforms similar blockchain algorithms significantly in terms of communication overhead, consensus latency, and throughput.

show abstract

“…However, in existing fine-grained redactable blockchains, users’ policies are public to all users, making them unsuitable for some policy-sensitive IoT systems, such as IoT-based smart healthcare and smart transportation [ 20 ]. In these IoT systems, users’ policies contain sensitive private information, e.g., users’ health conditions and geographical locations [ 21 ]. For instance, in an IoT-based smart healthcare application, users use their IoT devices (e.g., smartwatches) to record their health data and utilize blockchain-based IoT systems to manage the data.…”

Section: Introductionmentioning

confidence: 99%

Decentralized Policy-Hidden Fine-Grained Redaction in Blockchain-Based IoT Systems

Guo

Xing

Zhao

et al. 2023

Sensors

Self Cite

View full text Add to dashboard Cite

Currently, decentralized redactable blockchains have been widely applied in IoT systems for secure and controllable data management. Unfortunately, existing works ignore policy privacy (i.e., the content of users’ redaction policies), causing severe privacy leakage threats to users since users’ policies usually contain large amounts of private information (e.g., health conditions and geographical locations) and limiting the applications in IoT systems. To bridge this research gap, we propose PFRB, a policy-hidden fine-grained redactable blockchain in decentralized blockchain-based IoT systems. PFRB follows the decentralized settings and fine-grained chameleon hash-based redaction in existing redactable blockchains. In addition, PFRB hides users’ policies during policy matching such that apart from successful policy matching, users’ policy contents cannot be inferred and valid redactions cannot be executed. Some main technical challenges include determining how to hide policy contents and support policy matching. Inspired by Newton’s interpolation formula-based secret sharing, PFRB converts policy contents into polynomial parameters and utilizes multi-authority attribute-based encryption to further hide these parameters. Theoretical analysis proves the correctness and security against the chosen-plaintext attack. Extensive experiments on the FISCO blockchain platform and IoT devices show that PFRB achieves competitive efficiency over current redactable blockchains.

show abstract

Achieving Privacy-Preserving and Verifiable Support Vector Machine Training in the Cloud

Cited by 48 publications

References 36 publications

A Swell Neural Network Algorithm for Solving Time-Varying Path Query Problems with Privacy Protection

A Swell Neural Network Algorithm for Solving Time-Varying Path Query Problems with Privacy Protection

A secure and highly efficient blockchain PBFT consensus algorithm for microgrid power trading

Decentralized Policy-Hidden Fine-Grained Redaction in Blockchain-Based IoT Systems

Contact Info

Product

Resources

About