EG-STC: An Efficient Secure Two-Party Computation Scheme Based on Embedded GPU for Artificial Intelligence Systems

This paper presents a comprehensive exploration into the integration of Internet of Things(IoT),big data analysis,cloud computing,and Artificial Intelligence(AI),which has led to an unprecedented era of connectivity.We delve into the emerging trend of machine learning on embedded devices,enabling tasks in resource-limited environ-ments.However,the widespread adoption of machine learning raises significant privacy concerns,necessitating the development of privacy-preserving techniques.One such technique,secure multi-party computation(MPC),allows collaborative computations without exposing private inputs.Despite its potential,complex protocols and communication interactions hinder performance,especially on resource-constrained devices.Efforts to enhance efficiency have been made,but scalability remains a challenge.Given the success of GPUs in deep learning,lever-aging embedded GPUs,such as those offered by NVIDIA,emerges as a promising solution.Therefore,we propose an Embedded GPU-based Secure Two-party Computation(EG-STC)framework for Artificial Intelligence(AI)systems.To the best of our knowledge,this work represents the first endeavor to fully implement machine learning model training based on secure two-party computing on the Embedded GPU platform.Our experimental results demonstrate the effectiveness of EG-STC.On an embedded GPU with a power draw of 5 W,our implementation achieved a secure two-party matrix multiplication throughput of 5881.5 kilo-operations per millisecond(kops/ms),with an energy efficiency ratio of 1176.3 kops/ms/W.Furthermore,leveraging our EG-STC framework,we achieved an overall time acceleration ratio of 5–6 times compared to solutions running on server-grade CPUs.Our solution also exhibited a reduced runtime,requiring only 60%to 70%of the runtime of previously best-known methods on the same platform.In summary,our research contributes to the advancement of secure and efficient machine learning implementations on resource-constrained embedded devices,paving the way for broader adoption of AI technologies in various applications.

SLEACH: Secure Low-Energy Adaptive Clustering Hierarchy Protocol for Wireless Sensor Networks

LEACH (Low-Encrgy Adaptive Clustering Hi-erarchy) protocol is a basic clustering-based routing protocol of sensor networks. In this paper, we present the design of SLEACH, asecure extension for the LEACH protocol. We divide SLEACH into four phases and fit inexpensivecryplp-graphic operations to each part of the protocol functionality to create an efficient,practical protocol. Then we give security analyses of SLEACH. Our security analyses show that ourschemeis robust against any external attacker or compromised nodes in the sensor network.

Secure Signature Protocol

This paper studies how to take advantage of other's computing ability to sign a message with one's private key without disclosing the private key. A protocol to this problem is presented, and it is proven, by well known simulation paradigm, that this protocol is private.

An Effective Security Comparison Protocol in Cloud Computing

With the development of cloud computing technology,more and more data owners upload their local data to the public cloud server for storage and calculation.While this can save customers’operating costs,it also poses privacy and security challenges.Such challenges can be solved using secure multi-party computation(SMPC),but this still exposes more security issues.In cloud computing using SMPC,clients need to process their data and submit the processed data to the cloud server,which then performs the calculation and returns the results to each client.Each client and server must be honest.If there is cooperation or dishonest behavior between clients,some clients may profit from it or even disclose the private data of other clients.This paper proposes the SMPC based on a Partially-Homomorphic Encryption(PHE)scheme in which an addition homomorphic encryption algorithm with a lower computational cost is used to ensure data comparability and Zero-Knowledge Proof(ZKP)is used to limit the client’s malicious behavior.In addition,the introduction of Oblivious Transfer(OT)technology also ensures that the semi-honest cloud server knows nothing about private data,so that the cloud server of this scheme can calculate the correct data in the case of malicious participant models and safely return the calculation results to each client.Finally,the security analysis shows that the scheme not only ensures the privacy of participants,but also ensures the fairness of the comparison protocol data.

A Secure Communication Protocol for Unmanned Aerial Vehicles

Mavlink is a lightweight and most widely used open-source communication protocol used for Unmanned Aerial Vehicles.Multiple UAVs and autopilot systems support it,and it provides bi-directional communication between the UAV and Ground Control Station.The communications contain critical information about the UAV status and basic control commands sent from GCS to UAV and UAV to GCS.In order to increase the transfer speed and efficiency,the Mavlink does not encrypt the messages.As a result,the protocol is vulnerable to various security attacks such as Eavesdropping,GPS Spoofing,and DDoS.In this study,we tackle the problem and secure the Mavlink communication protocol.By leveraging the Mavlink packet’s vulnerabilities,this research work introduces an experiment in which,first,the Mavlink packets are compromised in terms of security requirements based on our threat model.The results show that the protocol is insecure and the attacks carried out are successful.To overcomeMavlink security,an additional security layer is added to encrypt and secure the protocol.An encryption technique is proposed that makes the communication between the UAV and GCS secure.The results show that the Mavlink packets are encrypted using our technique without affecting the performance and efficiency.The results are validated in terms of transfer speed,performance,and efficiency compared to the literature solutions such as MAVSec and benchmarked with the original Mavlink protocol.Our achieved results have significant improvement over the literature and Mavlink in terms of security.

A Secure Short Message Communication Protocol

According to the security requirement of the short message service （SMS） industry application, a secure short message communication protocol is proposed. This is an application level protocol constructed on the standard SMS communication protocol using public key authentication and key agreement without the need of wireless public key infrastructure （WPKI）. Secure short message transmission and dynamic key agreement between mobile terminals and the accessing gateway axe realized. The security of the proposed protocol is validated through the BAN logic. Compared with the standard SMS protocol, the effective payload rate of our protocol can reach 91.4%, and subscriber identity module （SIM） tool kit （STK） applications based on our protocol suit well for all kinds of mobile terminals in practical application.

Research on a Secure Communication Protocol Based on National Secret SM2 Algorithm

Most of the public key algorithms used in the exchange of information for power data transmission protocols are RSA. The core of the key part of this kind of algorithm system has not been announced. For the domestic sensitive information data field, there are threats such as preset backdoors and security vulnerabilities. In response to the above problems, the article introduces a secure communication protocol based on the optimized Secret SM2 algorithm, which uses socket programming to achieve two-way encrypted communication between clients and services, and is able to complete the security protection of data encryption transmission, authentication, data tampering, etc., and proves through experiments that the security protocol is more secure than traditional methods, can effectively identify each other, carry out stable and controllable data encryption transmission, and has good applicability.

A secure key agreement protocol based on chaotic maps

To guarantee the security of communication in the public channel, many key agreement protocols have been proposed. Recently, Gong et al. proposed a key agreement protocol based on chaotic maps with password sharing. In this paper, Gong et al.＇s protocol is analyzed, and we find that this protocol exhibits key management issues and potential security problems. Furthermore, the paper presents a new key agreement protocol based on enhanced Chebyshev polynomials to overcome these problems. Through our analysis, our key agreement protocol not only provides mutual authentication and the ability to resist a variety of conarnon attacks, but also solve the problems of key management and security issues existing in Gong et al.＇ s protocol.

A Quantitative Security Metric Model for Security Controls:Secure Virtual Machine Migration Protocol as Target of Assessment

Quantitative security metrics are desirable for measuring the performance of information security controls. Security metrics help to make functional and business decisions for improving the performance and cost of the security controls. However, defining enterprise-level security metrics has already been listed as one of the hard problems in the Info Sec Research Council's hard problems list. Almost all the efforts in defining absolute security metrics for the enterprise security have not been proved fruitful. At the same time, with the maturity of the security industry, there has been a continuous emphasis from the regulatory bodies on establishing measurable security metrics. This paper addresses this need and proposes a relative security metric model that derives three quantitative security metrics named Attack Resiliency Measure(ARM), Performance Improvement Factor(PIF), and Cost/Benefit Measure(CBM) for measuring the performance of the security controls. For the effectiveness evaluation of the proposed security metrics, we took the secure virtual machine(VM) migration protocol as the target of assessment. The virtual-ization technologies are rapidly changing the landscape of the computing world. Devising security metrics for virtualized environment is even more challenging. As secure virtual machine migration is an evolving area and no standard protocol is available specifically for secure VM migration. This paper took the secure virtual machine migration protocol as the target of assessment and applied the proposed relative security metric model for measuring the Attack Resiliency Measure, Performance Improvement Factor, and Cost/Benefit Measure of the secure VM migration protocol.

Efficient and Secure Authenticated Quantum Dialogue Protocols over Collective-Noise Channels

Based on the deterministic secure quantum communication, we present a novel quantum dialogue protocol with- out information leakage over the collective noise channel. The logical qubits and four-qubit decoherence-free states are introduced for resisting against collective-dephasing noise, collective-rotation noise and all kinds of unitary collective noise, respectively. Compared with the existing similar protocols, the analyses on security and information-theoretical emciency show that the proposed protocol is more secure and emeient.

Secure planar convex hull protocol for large-scaled point sets in semi-honest model

Efficiency and scalability are still the bottleneck for secure multi-party computation geometry(SMCG).In this work a secure planar convex hull(SPCH) protocol for large-scaled point sets in semi-honest model has been proposed efficiendy to solve the above problems.Firstly,a novel privacy-preserving point-inclusion(PPPI) protocol is designed based on the classic homomorphic encryption and secure cross product protocol,and it is demonstrated that the complexity of PPPI protocol is independent of the vertex size of the input convex hull.And then on the basis of the novel PPPI protocol,an effective SPCH protocol is presented.Analysis shows that this SPCH protocol has a good performance for large-scaled point sets compared with previous solutions.Moreover,analysis finds that the complexity of our SPCH protocol relies on the size of the points on the outermost layer of the input point sets only.

SET协议和3-D Secure协议的比较与分析

简要介绍了用于在线交易的卡支付规范SET协议和3-D Secure协议。主要在安全性方面对这两个协议进行了比较与分析。分析结果表明,由于3-D Secure协议精简了SET协议中复杂的加密技术,导致安全性减弱,针对这一点提出了一个安全性加强方案。

基于改进的3-D Secure协议的移动支付安全解决方案

借鉴国外已有的移动交易支付模式,结合我国金融系统的特点及安全要求,提出了一种基于改进的3-D Secure协议的移动支付安全方案,该方案采用AES(Advanced Encryption Standard)算法对通信报文加密,通过一套支持多信道报文安全传输控制的安全认证体系,来保证在移动支付业务中的客户、商户和资金信息的安全。分析并测试验证了该方案在支付业务中的可行性和安全性。

基于SPIN的Andrew Secure RPC协议并行攻击模型检测

Andrew Secure RPC协议具有身份认证和秘钥交换功能,其因简洁明了而被广泛应用于对称密钥加密体系中。模型检测技术具有高度自动化的优点,在协议安全性验证领域得到广泛应用,但模型检测方法只能检测到一轮协议会话中存在的攻击,难以检测到多轮并行会话中存在的并行攻击。针对Andrew Secure RPC协议运行环境中存在的并行性与可能出现的安全隐患,提出了组合身份建模方法。该方法运用著名的SPIN模型检测工具,对Andrew Secure RPC协议进行模型检测,从而得到攻击序列图,成功发现并行反射攻击和类缺陷攻击。上述组合身份建模方法为复杂环境下协议的模型检测提供了新的方向。

基于3-D Secure的手机支付系统的实现

针对移动支付业务的特点和需求,基于3-D安全支付协议,构建一个安全的手机支付系统。从商家服务器、发卡行服务器、手机终端三方分别讨论了支付系统的具体实现,并通过加解密、数字签名等密码技术保证了支付的安全性。

Andrew Secure RPC协议的一种组合分析方法

逻辑方法和模型检验方法是安全协议的两种重要分析方法。逻辑方法简单、直观,但其最大问题是不够完备,模型检验方法自动化程度高且能生成不满足所需求性质的反例。先用BAN逻辑对Andrew Secure RPC协议进行分析,并在此基础上组合模型检验方法进行分析,结果表明逻辑方法组合模型检验方法分析协议比只用逻辑方法分析得到的结果更全面且更具体。

电子商务支付发展趋势——3D-Secure技术

从协议模型、工作机制及优势等方面对3D-Secure技术进行了分析和探讨。

国外两种常用安全支付模式分析——3-D Secure与SecureCode

信用卡是电子支付中最常用的支付方式,为此世界两大信用卡组织Visa和MasterCard相继开发出3-DSecure与SecureCode技术,用来保证信用卡网上支付的安全性。文中在对这两种技术的功能及流程进行简要介绍的基础上,从功能结构、使用流程等方面对比分析了这两种安全支付模式的区别,并对其各自的优缺点加以论述。

Model Checking Electronic CommerceSecurity Protocols Based on CTL

We present a model based on Computational Temporal Logic (CTL) methods forverifying security requirements of electronic commerce, protocols. The model describes formally theauthentication, confidentiality integrity, non-repudiation) denial of serviee and access control ofthe e-lectronic commerce protocols. We illustrate as case study a variant of the Lu-Smolka protocolproposed by Lu-Smolka Moreover, we have discovered two attacks that allow a dishonest user topurchase a good debiting the amountto another user. And also, we compared our work with relativeresearch works and found lhat the formal way of this paper is more general to specify securityprotocols for E-Commerce.