Secure Computation Research Articles

Intrusion detection and secure data storage in the cloud were recommend by a multiscale deep bidirectional gated recurrent neural network

Data communication security is developing very day with the creation of cloud computing. The imperative for robust data communication security has become increasingly evident with the pervasive adoption of cloud computing. However, challenges persist due to the inherent complexities and limited security measures in cloud environments, particularly in transmitting and storing sensitive information. Previous studies have underscored the intricate nature of intrusion detection systems (IDS) in cloud-based settings. In this research, a Multi scale Deep Bidirectional Gated Recurrent Neural Network and Optimal Encryption Scheme espoused Intrusion Detection and Secure Data Storage in the Cloud (MDBGRNN-ID-SCESOA) is proposed. Leveraging the KDD CUP 99 dataset and DS2OS Dataset, initial data preprocessing involves Domain Transform Filtering (DTF) for tokenization, dimension reduction, and semantic analysis. Subsequently, MDBGRNN is employed to discern intrusion from non-intrusion data. Furthermore, a two-way encryption mechanism, integrating Elliptical Curve Cryptography (ECC) with the Sine Cosine Egret Swarm Optimization Algorithm (ECC-SCESOA), enhances data security while minimizing computational overhead. To safeguard encrypted data at rest in the cloud, a steganography process is devised, effectively concealing sensitive content. Performance evaluation metrics, including accuracy, specificity, sensitivity, encryption/decryption time, execution time, memory usage, and Matthews correlation coefficient (MCC), demonstrate the efficacy of MDBGRNN-ID-SCESOA. Comparative analysis with existing techniques reveals notable enhancements in computational efficiency and data security. This comprehensive approach addresses critical security concerns in cloud computing, offering a promising avenue for safeguarding sensitive data in cloud environments.

Application and evaluation of secure computation technology for the secure use of crop-breeding big data

Application and evaluation of secure computation technology for the secure use of crop-breeding big data

A Decentralized Private Data Marketplace using Blockchain and Secure Multi-Party Computation

Big data has proven to be a very useful tool for companies and users, but companies with larger datasets have ended being more competitive than the others thanks to machine learning or artificial intelligence. Secure multi-party computation (SMPC) allows the smaller companies to jointly train arbitrary models on their private data while assuring privacy, and thus gives data owners the ability to perform what are currently known as federated learning algorithms. Besides, with a blockchain it is possible to coordinate and audit those computations in a decentralized way. In this document, we consider a private data marketplace as a space where researchers and data owners meet to agree the use of private data for statistics or more complex model trainings. This document presents a candidate architecure for a private data marketplace by combining SMPC and a public, general-purpose blockchain. Such a marketplace is proposed as a smart contract deployed in the blockchain, while the privacy preserving computation is held by SMPC.

Unlocking the Future: Privacy-Preserving ML Experimentation

Abstract: Experiments with machine learning (ML) have become a key source of new ideas in many fields. However, growing worries about data privacy have made it clear that we need ML testing methods that protect privacy. There are new technologies in this piece that let you play around with machine learning without putting your data at risk. Differential privacy, secure multiparty computation (SMPC), homomorphic encryption, federated learning, trusted execution environments (TEEs), making fake data, and using temporary and nameless IDs are some of these technologies. By using these privacy-protecting solutions, businesses can utilize the full potential of machine learning experiments while protecting individuals' privacy rights and staying in line with strict rules.

Multi-party semi-quantum secret sharing protocol based on measure-flip and reflect operations

Semi-quantum secret sharing (SQSS) protocols serve as fundamental frameworks in quantum secure multi-party computations, offering the advantage of not requiring all users to possess intricate quantum devices. However, current SQSS protocols mainly cater to bipartite scenarios, with few protocols suitable for multi-party scenarios. Moreover, the multi-party SQSS protocols face limitations such as low qubit efficiency and inability to share deterministic secret information. To address this gap, this paper proposes a multi-party SQSS protocol based on multi-particle GHZ states. In this protocol, the quantum user can distribute the predetermined secret information to multiple classical users with limited quantum capabilities, and only through mutual cooperation among all classical users can the correct secret information be reconstructed. By utilizing measure-flip and reflect operations, the transmitted multi-particle GHZ states can all contribute keys, thereby improving the utilization of transmitted particles. Then, security analysis shows that the protocol’s resilience against prevalent external and internal threats. Additionally, employing IBM Qiskit, we conduct quantum circuit simulations to validate the protocol’s accuracy and feasibility. Finally, compared to similar studies, the proposed protocol has advantages in terms of protocol scalability, qubit efficiency, and shared message types.

A Ciphertext Reduction Scheme for Garbling an S-Box in an AES Circuit with Minimal Online Time

The secure computation of symmetric encryption schemes using Yao’s garbled circuits, such as AES, allows two parties, where one holds a plaintext block m and the other holds a key k, to compute Enc(k,m) without leaking m and k to one another. Due to its wide application prospects, secure AES computation has received much attention. However, the evaluation of AES circuits using Yao’s garbled circuits incurs substantial communication overhead. To further improve its efficiency, this paper, upon observing the special structures of AES circuits and the symmetries of an S-box, proposes a novel ciphertext reduction scheme for garbling an S-box in the last SubBytes step. Unlike the idea of traditional Yao’s garbled circuits, where the circuit generator uses the input wire labels to encrypt the corresponding output wire labels, our garbling scheme uses the input wire labels of an S-box to encrypt the corresponding “flip bit strings”. This approach leads to a significant performance improvement in our garbling scheme, which necessitates only 28 ciphertexts to garble an S-box and a single invocation of a cryptographic primitive for decryption compared to the best result in previous work that requires 8×28 ciphertexts to garble an S-box and multiple invocations of a cryptographic primitive for decryption. Crucially, the proposed scheme provides a new idea to improve the performance of Yao’s garbled circuits. We analyze the security of the proposed scheme in the semi-honest model and experimentally verify its efficiency.

Multichannel highly secure wireless communication system with information camouflage capability.

Information metasurface has shown great potential in wireless communications owing to its ability to flexibly control electromagnetic waves. However, it is still a big challenge to achieve high-security and large-channel capacity wireless communications by a simple system. Here, we propose a space-polarization-division multiplexing secure wireless communication system with information camouflage capability based on the information metasurface, which can realize multichannel encrypted wireless communications with different polarization coding strategies independently and simultaneously. A polarization mask key is introduced to encrypt the target message, and the cipher message is further concealed behind a cover image with steganography and sent to the user by using the polarization modulation strategy. Different polarization mask keys can be adopted in each individual communication by changing the polarization coding strategy to enhance the system security. The proposed scheme integrates computational algorithm encryption and physical layer security together and thus has the advantages of high security, large channel capacity, and strong camouflage ability.

PrivatEyes: Appearance-based Gaze Estimation Using Federated Secure Multi-Party Computation

Latest gaze estimation methods require large-scale training data but their collection and exchange pose significant privacy risks. We propose PrivatEyes - the first privacy-enhancing training approach for appearance-based gaze estimation based on federated learning (FL) and secure multi-party computation (MPC). PrivatEyes enables training gaze estimators on multiple local datasets across different users and server-based secure aggregation of the individual estimators' updates. PrivatEyes guarantees that individual gaze data remains private even if a majority of the aggregating servers is malicious. We also introduce a new data leakage attack DualView that shows that PrivatEyes limits the leakage of private training data more effectively than previous approaches. Evaluations on the MPIIGaze, MPIIFaceGaze, GazeCapture, and NVGaze datasets further show that the improved privacy does not lead to a lower gaze estimation accuracy or substantially higher computational costs - both of which are on par with its non-secure counterparts.

New Tools for Data Harmonization and Their Potential Applications in Organ Transplantation.

In organ transplantation, accurate analysis of clinical outcomes requires large, high-quality data sets. Not only are outcomes influenced by a multitude of factors such as donor, recipient, and transplant characteristics and posttransplant events but they may also change over time. Although large data sets already exist and are continually expanding in transplant registries and health institutions, these data are rarely combined for analysis because of a lack of harmonization. Promoted by the digitalization of the healthcare sector, effective data harmonization tools became available, with potential applications also for organ transplantation. We discuss herein the present problems in the harmonization of organ transplant data and offer solutions to enhance its accuracy through the use of emerging new tools. To overcome the problem of inadequate representation of transplantation-specific terms, ontologies and common data models particular to this field could be created and supported by a consortium of related stakeholders to ensure their broad acceptance. Adopting clear data-sharing policies can diminish administrative barriers that impede collaboration between organizations. Secure multiparty computation frameworks and the artificial intelligence (AI) approach federated learning can facilitate decentralized and harmonized analysis of data sets, without sharing sensitive data and compromising patient privacy. A common image data model built upon a standardized format would be beneficial to AI-based analysis of pathology images. Implementation of these promising new tools and measures, ideally with the involvement and support of transplant societies, is expected to produce improved integration and harmonization of transplant data and greater accuracy in clinical decision-making, enabling improved patient outcomes.

Multi-key and Multi-input Predicate Encryption (for Conjunctions) from Learning with Errors

We put forward two natural generalizations of predicate encryption (PE), dubbed multi-key and multi-input PE. More in details, our contributions are threefold.Definitions. We formalize security of multi-key PE and multi-input PE following the standard indistinguishability paradigm, and modeling security both against malicious senders (i.e., corruption of encryption keys) and malicious receivers (i.e., collusions).Constructions. We construct adaptively secure multi-key and multi-input PE supporting the conjunction of poly-many arbitrary single-input predicates, assuming the sub-exponential hardness of the learning with errors (LWE) problem.Applications. We show that multi-key and multi-input PE for expressive enough predicates suffices for interesting cryptographic applications, including non-interactive multi-party computation (NI-MPC) and matchmaking encryption (ME). In particular, plugging in our constructions of multi-key and multi-input PE, under the sub-exponential LWE assumption, we obtain the first ME supporting arbitrary policies with unbounded collusions, as well as robust (resp. non-robust) NI-MPC for so-called all-or-nothing functions satisfying a non-trivial notion of reusability and supporting a constant (resp. polynomial) number of parties. Prior to our work, both of these applications required much heavier tools such as indistinguishability obfuscation or compact functional encryption.

Data Security and Privacy in Genomics Research: A Comparative Analysis to Protect Confidentiality

The quick progress of genomics examination has driven a surge in the creation of significantly fragile genomic data, making ensuring its security essential. This data contains sensitive information roughly an individual's prosperity, family history, and defencelessness to ailments. Unauthorized access or mishandling can lead to isolation, stigmatization, and mystery breaches. The potential threats to genomic data affirmation are multifaceted, checking the chance of re-identification and extended defense lessness to data breaches, hacking events, and unauthorized get to by harmful actors. To address these challenges, a multifaceted approach is required, tallying solid privacy-preserving methods, securing data capacity, and transmission sharpens, and getting to controls. Encryption techniques, differential security methods, and secure multiparty computation offer promising streets for securing genomic data while progressing collaborative ask approximately. Establishing clear authority frameworks and rules for data management, capacity, and sharing is essential to reduce security threats in genomics research. Collaboration between researchers, policymakers, industry partners, and support groups is essential for developing comprehensive methods to protect genomic data security. By prioritizing security concerns and executing effective safeguards, the community can uphold individuals' rights, maintain open acceptance, and drive advancements in genomics research for the betterment of society.

Private-preserving language model inference based on secure multi-party computation

With the exponential expansion of Internet information, technology that combines big data and artificial intelligence has gradually developed. Pre-trained large-scale language models with the transformer architecture as the core have begun to be used in daily life, resulting in the huge market of MLaaS. leading to the significant market of Machine Learning as a Service (MLaaS). Although MLaaS brings huge benefits to users, it requires receiving users’ data for processing, which includes many sensitive data. While MLaaS offers considerable benefits, it necessitates processing users’ data, which includes much sensitive data.Therefore, the problem of privacy data leakage has also been exposed. In this article paper, we propose a novel language model secure inference scheme based on secure multi-party computation (MPC) technology. This solution involves three non-colluding parties: the data provider, the model provider, and the computing power provider. Compared with direct inference on pre-trained large models, the proposed security inference framework improves the inference speed by 1.55–6.25 times. Our findings demonstrate that, when compared to conventional inference methods on pre-trained large-scale models, our approach significantly enhances inference efficiency, achieving speed improvements ranging from 1.55 to 6.25 times.

Confidentially Compare Rational Numbers under the Malicious Model

<p>Secure multi-party computation is a hotspot in the cryptography field, and it is also a significant means to realize privacy computation. The Millionaires’ problem is the most fundamental problem among them, which is the basic module of secure multi-party computation protocols. Although there are many solutions to this problem, there are few anti-malicious adversarial protocols besides protocols based on Yao’s garbled circuit. Only a few solutions have low efficiency, and there is no protocol for rational numbers comparison under the malicious model, which restricts the solution of many secure multi-party computation problems. In this paper, the possible malicious behaviors are analyzed in the existing Millionaires’ problem protocols. These behaviors are discovered and taken precautions against through the triangle area formula, zero-knowledge proof, and cut-and-choose method, so the protocol of comparing confidentially rational numbers is proposed under the malicious model. And this paper adopts the real/ideal model paradigm to prove the security of the malicious model protocol. Efficiency analysis indicates that the proposed protocol is more effective than existing protocols. The protocol of rational numbers comparison under the malicious model is more suitable for the practical applications of secure multi-party computation, which has important theoretical and practical significance.</p> <p> </p>

PrivData Network: A Privacy-Preserving On-Chain Data Factory and Trading Market

Privacy concerns often raise when sensitive data are collected, traded, and processed. The data owner typically loses her ultimate control of the data after data-outsourcing. In this work, we present the PrivData Network – a community-controlled privacy-preserving data factory and trading market. It can be viewed as a standalone data ecosystem that enables privacy-preserving data-driven workflows in a controlled environment for orchestrating and automating data movement and data transformation. In particular, we design a data encapsulation mechanism with privacy assurance, which can guarantee data privacy, usage policy compliance and metadata validity. We also design a privacy policy language and utilize a static analysis library that transfers the program to the defined policy language. To ensure the correctness of data processing, we propose a publicly verifiable secure multiparty computation protocol for mixed circuits, which guarantees the output correctness even if all parties are corrupted. Its online efficiency is comparable to conventional semi-honest secret-sharing-based MPC schemes. Finally, we implemented a prototype of our system in C++ and benchmark it on various tasks, such as biometric matching, logistic regression, and decision trees, etc.

Confidential Computing or Cryptographic Computing?

Secure computation via MPC/homomorphic encryption versus hardware enclaves presents tradeoffs involving deployment, security, and performance. Regarding performance, it matters a lot which workload you have in mind. For simple workloads such as simple summations, low-degree polynomials, or simple machine-learning tasks, both approaches can be ready to use in practice, but for rich computations such as complex SQL analytics or training large machine-learning models, only the hardware enclave approach is at this moment practical enough for many real-world deployment scenarios.

Scalable Cloud Architectures for Deploying AI Applications

The integration of Artificial Intelligence (AI) into cloud computing represents a pivotal shift in the technological landscape, offering unprecedented opportunities for innovation across industries. Deploying AI applications at scale on the cloud poses unique challenges, necessitating the development of scalable cloud architectures tailored to meet the computational demands and data processing needs inherent to AI. This article explores the foundational aspects of cloud computing architectures, emphasizing the principles of scalability essential for AI applications. It delves into the core challenges faced when deploying AI on the cloud, such as computational requirements, data management, network constraints, and security concerns. Further, it presents various architectural models that facilitate scalability, including containerization, serverless computing, and cloud-native AI services, drawing from realworld case studies to illustrate effective strategies and best practices. Additionally, the article examines performance optimization techniques, security considerations, and the future directions of cloud-based AI deployments, highlighting the role of emerging technologies such as quantum computing and edge AI. By providing a comprehensive overview of scalable cloud architectures for AI applications, this article aims to guide researchers, practitioners, and organizations in leveraging cloud computing to its full potential, thereby enabling more efficient, secure, and scalable AI solutions.

Privacy-Preserving Data Sharing Platform

In today's data-driven healthcare landscape, the secure sharing of sensitive medical information is essential for improving patient care, facilitating medical research, and advancing healthcare outcomes. However, ensuring the integrity, confidentiality, and privacy of patient data poses significant challenges, particularly in the context of big data environments. This presents a comprehensive framework for privacy-preserving data sharing in healthcare, leveraging a combination of cryptographic techniques, encryption, and secure computation protocols. The framework encompasses various privacy-preserving mechanisms, including Differential Privacy with Data Perturbation, Secure Multi-Party Computation (SMPC), and Homomorphic Encryption, to protect sensitive healthcare data from unauthorized access and disclosure. By implementing state-of-the-art privacy-preserving techniques, the framework aims to enable secure data sharing among multiple parties while complying with regulatory requirements such as HIPAA and GDPR. Additionally, the paper discusses the project scope, which includes cryptography, encryption, decryption, integrity, confidentiality, privacy, policies, procedures, security, and secure data sharing infrastructure. The proposed framework provides a practical solution for healthcare organizations and research institutions to collaborate on data-driven initiatives while safeguarding patient privacy and maintaining trust. Evaluation of the framework's effectiveness and performance metrics is conducted to validate its feasibility and efficacy in real-world healthcare settings. Keywords: Privacy-preserving data sharing, Differential Privacy, Data Perturbation, Secure Multi-Party Computation (SMPC)

Taypsi: Static Enforcement of Privacy Policies for Policy-Agnostic Oblivious Computation

Secure multiparty computation (MPC) techniques enable multiple parties to compute joint functions over their private data without sharing that data with other parties, typically by employing powerful cryptographic protocols to protect individual's data. One challenge when writing such functions is that most MPC languages force users to intermix programmatic and privacy concerns in a single application, making it difficult to change or audit a program's underlying privacy policy. Prior policy-agnostic MPC languages relied on dynamic enforcement to decouple privacy requirements from program logic. Unfortunately, the resulting overhead makes it difficult to scale MPC applications that manipulate structured data. This work proposes to eliminate this overhead by instead transforming programs into semantically equivalent versions that statically enforce user-provided privacy policies. We have implemented this approach in a new MPC language, called Taypsi; our experimental evaluation demonstrates that the resulting system features considerable performance improvements on a variety of MPC applications involving structured data and complex privacy policies.

Survey: federated learning data security and privacy-preserving in edge-Internet of Things

AbstractThe amount of data generated owing to the rapid development of the Smart Internet of Things is increasing exponentially. Traditional machine learning can no longer meet the requirements for training complex models with large amounts of data. Federated learning, as a new paradigm for training statistical models in distributed edge networks, alleviates integration and training problems in the context of massive and heterogeneous data and security protection for private data. Edge computing processes data at the edge layers of data sources to ensure low-data-delay processing; it provides high-bandwidth communication and a stable network environment, and relieves the pressure of processing massive data using a single node in the cloud center. A combination of edge computing and federated learning can further optimize computing, communication, and data security for the edge-Internet of Things. This review investigated the development status of federated learning and expounded on its basic principles. Then, in view of the security attacks and privacy leakage problems of federated learning in the edge Internet of things, relevant work was investigated from cryptographic technologies (such as secure multi-party computation, homomorphic encryption and secret sharing), perturbation schemes (such as differential privacy), adversarial training and other privacy security protection measures. Finally, challenges and future research directions for the integration of edge computing and federated learning are discussed.

Enhancing Privacy and Security in IoT Environments through Secure Multiparty Computation

Enhancing Privacy and Security in IoT Environments through Secure Multiparty Computation