期刊文献+
共找到131篇文章
< 1 2 7 >
每页显示 20 50 100
Fusion of Feature Ranking Methods for an Effective Intrusion Detection System
1
作者 Seshu Bhavani Mallampati Seetha Hari 《Computers, Materials & Continua》 SCIE EI 2023年第8期1721-1744,共24页
Expanding internet-connected services has increased cyberattacks,many of which have grave and disastrous repercussions.An Intrusion Detection System(IDS)plays an essential role in network security since it helps to pr... Expanding internet-connected services has increased cyberattacks,many of which have grave and disastrous repercussions.An Intrusion Detection System(IDS)plays an essential role in network security since it helps to protect the network from vulnerabilities and attacks.Although extensive research was reported in IDS,detecting novel intrusions with optimal features and reducing false alarm rates are still challenging.Therefore,we developed a novel fusion-based feature importance method to reduce the high dimensional feature space,which helps to identify attacks accurately with less false alarm rate.Initially,to improve training data quality,various preprocessing techniques are utilized.The Adaptive Synthetic oversampling technique generates synthetic samples for minority classes.In the proposed fusion-based feature importance,we use different approaches from the filter,wrapper,and embedded methods like mutual information,random forest importance,permutation importance,Shapley Additive exPlanations(SHAP)-based feature importance,and statistical feature importance methods like the difference of mean and median and standard deviation to rank each feature according to its rank.Then by simple plurality voting,the most optimal features are retrieved.Then the optimal features are fed to various models like Extra Tree(ET),Logistic Regression(LR),Support vector Machine(SVM),Decision Tree(DT),and Extreme Gradient Boosting Machine(XGBM).Then the hyperparameters of classification models are tuned with Halving Random Search cross-validation to enhance the performance.The experiments were carried out on the original imbalanced data and balanced data.The outcomes demonstrate that the balanced data scenario knocked out the imbalanced data.Finally,the experimental analysis proved that our proposed fusionbased feature importance performed well with XGBM giving an accuracy of 99.86%,99.68%,and 92.4%,with 9,7 and 8 features by training time of 1.5,4.5 and 5.5 s on Network Security Laboratory-Knowledge Discovery in Databases(NSL-KDD),Canadian Institute for Cybersecurity(CIC-IDS 2017),and UNSW-NB15,datasets respectively.In addition,the suggested technique has been examined and contrasted with the state of art methods on three datasets. 展开更多
关键词 Cyber security feature ranking IMBALANCE PREPROCESSING IDS SHAP
下载PDF
A Secure Microgrid Data Storage Strategy with Directed Acyclic Graph Consensus Mechanism
2
作者 Jian Shang Runmin Guan Wei Wang 《Intelligent Automation & Soft Computing》 SCIE 2023年第9期2609-2626,共18页
The wide application of intelligent terminals in microgrids has fueled the surge of data amount in recent years.In real-world scenarios,microgrids must store large amounts of data efficiently while also being able to ... The wide application of intelligent terminals in microgrids has fueled the surge of data amount in recent years.In real-world scenarios,microgrids must store large amounts of data efficiently while also being able to withstand malicious cyberattacks.To meet the high hardware resource requirements,address the vulnerability to network attacks and poor reliability in the tradi-tional centralized data storage schemes,this paper proposes a secure storage management method for microgrid data that considers node trust and directed acyclic graph(DAG)consensus mechanism.Firstly,the microgrid data storage model is designed based on the edge computing technology.The blockchain,deployed on the edge computing server and combined with cloud storage,ensures reliable data storage in the microgrid.Secondly,a blockchain consen-sus algorithm based on directed acyclic graph data structure is then proposed to effectively improve the data storage timeliness and avoid disadvantages in traditional blockchain topology such as long chain construction time and low consensus efficiency.Finally,considering the tolerance differences among the candidate chain-building nodes to network attacks,a hash value update mechanism of blockchain header with node trust identification to ensure data storage security is proposed.Experimental results from the microgrid data storage platform show that the proposed method can achieve a private key update time of less than 5 milliseconds.When the number of blockchain nodes is less than 25,the blockchain construction takes no more than 80 mins,and the data throughput is close to 300 kbps.Compared with the traditional chain-topology-based consensus methods that do not consider node trust,the proposed method has higher efficiency in data storage and better resistance to network attacks. 展开更多
关键词 MICROGRID data security storage node trust degree directed acyclic graph data structure consensus mechanism secure multi-party computing blockchain
下载PDF
3-Multi ranked encryption with enhanced security in cloud computing
3
作者 YeEun Kim Junggab Son +2 位作者 Reza M.Parizi Gautam Srivastava Heekuck Oh 《Digital Communications and Networks》 SCIE CSCD 2023年第2期313-326,共14页
Searchable Encryption(SE)enables data owners to search remotely stored ciphertexts selectively.A practical model that is closest to real life should be able to handle search queries with multiple keywords and multiple... Searchable Encryption(SE)enables data owners to search remotely stored ciphertexts selectively.A practical model that is closest to real life should be able to handle search queries with multiple keywords and multiple data owners/users,and even return the top-k most relevant search results when requested.We refer to a model that satisfies all of the conditions a 3-multi ranked search model.However,SE schemes that have been proposed to date use fully trusted trapdoor generation centers,and several methods assume a secure connection between the data users and a trapdoor generation center.That is,they assume the trapdoor generation center is the only entity that can learn the information regarding queried keywords,but it will never attempt to use it in any other manner than that requested,which is impractical in real life.In this study,to enhance the security,we propose a new 3-multi ranked SE scheme that satisfies all conditions without these security assumptions.The proposed scheme uses randomized keywords to protect the interested keywords of users from both outside adversaries and the honest-but-curious trapdoor generation center,thereby preventing attackers from determining whether two different queries include the same keyword.Moreover,we develop a method for managing multiple encrypted keywords from every data owner,each encrypted with a different key.Our evaluation demonstrates that,despite the trade-off overhead that results from the weaker security assumption,the proposed scheme achieves reasonable performance compared to extant schemes,which implies that our scheme is practical and closest to real life. 展开更多
关键词 Searchable encryption Multi-keyword search Multiple data owners/users ranked search Enhanced security
下载PDF
Secure Multi-keyword Search Supporting Dynamic Update and Ranked Retrieval
4
作者 Jingbo Yan Yuqing Zhang Xuefeng Liu 《China Communications》 SCIE CSCD 2016年第10期209-221,共13页
As cloud computing is becoming prevalent, data owners are motivated to delegate complex data managements to the commercial cloud for economic savings. Sensitive data is usually encrypted before being uploaded to the c... As cloud computing is becoming prevalent, data owners are motivated to delegate complex data managements to the commercial cloud for economic savings. Sensitive data is usually encrypted before being uploaded to the cloud, which unfortunately makes the frequently-used search function a challenging problem. In this paper, we present a new multi-keyword dynamic search scheme with result ranking to make search over encrypted data more secure and practical. In the scheme, we employ a powerful function-hiding inner product encryption to enhance the security by preventing the leakage of search pattern. For the concern of efficiency, we adopt a tree-based index structure to facilitate the searching process and updating operations. A comprehensive security analysis is provided and experiments over the real world data show that our scheme is efficient. 展开更多
关键词 secure search ranked search dynamic update cloud computing
下载PDF
Secure Multi-party Comparison Protocol and Application
5
作者 Jing Zhang Shoushan Luo Yixian Yang 《国际计算机前沿大会会议论文集》 2017年第1期72-74,共3页
The problem of information comparison is always an important field of SMC.In order to effectively solve the fully equal problem of multi-data for all information,a secure two-party multi-data comparison protocol for e... The problem of information comparison is always an important field of SMC.In order to effectively solve the fully equal problem of multi-data for all information,a secure two-party multi-data comparison protocol for equality(STMC)is proposed with the aid of the NTRU encryption.The protocol converts multi-data comparison problem for equality to polynomials comparison for equality.Analysis shows that the protocol is correct and security in semi-honest model.Being STMC as basic building block,a secure multi-party multi-data comparison protocol for equality(SMMC)is proposed.SMMC provides a solution which n participants hope to determine the equality of their private input sets,on the condition of no information leaked.This protocol is proved to be collusion-resistance security.The last,computational complexity and communication complexity of the two protocols are analyzed.It is shown that new protocols have low complexity.We also give applications in the secure multi-party information comparison problem and secure multi-party polynomial comparison problem. 展开更多
关键词 SMC secure multi-party COMPARISON problem NTRU ENCRYPTION
下载PDF
Verifiable Diversity Ranking Search Over Encrypted Outsourced Data 被引量:3
6
作者 Yuling Liu Hua Peng Jie Wang 《Computers, Materials & Continua》 SCIE EI 2018年第4期37-57,共21页
Data outsourcing has become an important application of cloud computing.Driven by the growing security demands of data outsourcing applications,sensitive data have to be encrypted before outsourcing.Therefore,how to p... Data outsourcing has become an important application of cloud computing.Driven by the growing security demands of data outsourcing applications,sensitive data have to be encrypted before outsourcing.Therefore,how to properly encrypt data in a way that the encrypted and remotely stored data can still be queried has become a challenging issue.Searchable encryption scheme is proposed to allow users to search over encrypted data.However,most searchable encryption schemes do not consider search result diversification,resulting in information redundancy.In this paper,a verifiable diversity ranking search scheme over encrypted outsourced data is proposed while preserving privacy in cloud computing,which also supports search results verification.The goal is that the ranked documents concerning diversification instead of reading relevant documents that only deliver redundant information.Extensive experiments on real-world dataset validate our analysis and show that our proposed solution is effective for the diversification of documents and verification. 展开更多
关键词 Cloud security diversity ranking RELEVANCE searchable encryption verifiable search
下载PDF
Secure planar convex hull protocol for large-scaled point sets in semi-honest model
7
作者 孙茂华 Zhu Hongliang Li Qi 《High Technology Letters》 EI CAS 2015年第4期471-478,共8页
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... 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 efficiently to solve the above problems. Firstly, a novel priva- cy-preserving point-inclusion (PPPI) protocol is designed based on the classic homomorphic encryp- tion 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 pro- tocol, 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. 展开更多
关键词 secure multi-party computation secure multi-party computational geometry (SMCG) secure planar convex hull protocol (SPCH) privacy-preserving point-inclusion protocol (PPPI) semi-honest model
下载PDF
Nonhomogeneous Risk Rank Analysis Method for Security Network System
8
作者 Pubudu Kalpani Hitigala Kaluarachchilage Chris P. Tsokos Sasith M. Rajasooriya 《International Journal of Communications, Network and System Sciences》 2019年第1期1-10,共10页
Security measures for a computer network system can be enhanced with better understanding the vulnerabilities and their behavior over the time. It is observed that the effects of vulnerabilities vary with the time ove... Security measures for a computer network system can be enhanced with better understanding the vulnerabilities and their behavior over the time. It is observed that the effects of vulnerabilities vary with the time over their life cycle. In the present study, we have presented a new methodology to assess the magnitude of the risk of a vulnerability as a “Risk Rank”. To derive this new methodology well known Markovian approach with a transition probability matrix is used including relevant risk factors for discovered and recorded vulnerabilities. However, in addition to observing the risk factor for each vulnerability individually we have introduced the concept of ranking vulnerabilities at a particular time taking a similar approach to Google Page Rank Algorithm. New methodology is exemplified using a simple model of computer network with three recorded vulnerabilities with their CVSS scores. 展开更多
关键词 MARKOV Chain VULNERABILITY Non HOMOGENEOUS Risk Analysis Network securITY Google PAGE rank
下载PDF
基于低秩逼近代理模型的N-1安全约束经济调度快速计算方法
9
作者 陈熠 王晗 +5 位作者 曾丹 严正 薛必克 赵乐 熊雪君 冯煜尧 《上海交通大学学报》 EI CAS CSCD 北大核心 2024年第10期1524-1533,共10页
随着新能源并网比例不断提高,为保障电力系统可靠运行,安全约束经济调度(SCED)需要考虑海量的N-1安全约束,对模型求解造成极大的计算负担.N-1安全约束中只有少量约束在计算过程中起作用,剔除大量冗余约束有助于提高SCED模型的求解效率.... 随着新能源并网比例不断提高,为保障电力系统可靠运行,安全约束经济调度(SCED)需要考虑海量的N-1安全约束,对模型求解造成极大的计算负担.N-1安全约束中只有少量约束在计算过程中起作用,剔除大量冗余约束有助于提高SCED模型的求解效率.提出基于低秩逼近(LRA)代理模型的SCED模型快速计算方法,首先构建考虑风力发电、光伏的SCED模型,并根据SCED模型的历史运行信息建立LRA代理模型;其次基于LRA代理模型的估计结果辨识关键约束和构建积极约束集,并提出基于LRA的SCED模型迭代求解流程;最后在IEEE 39节点系统下进行算例仿真.仿真结果表明,LRA代理模型与SCED模型的求解结果误差小于10%,约束辨识准确率高,所提求解流程的平均迭代求解时间降低了50%以上,显著提高了SCED模型的求解效率. 展开更多
关键词 安全约束经济调度 低秩逼近 约束辨识 积极约束集
下载PDF
Patch-Locator:一种基于排序学习的开源软件漏洞补丁定位方法
10
作者 杨云帆 薄莉莉 +2 位作者 魏颖 吴潇雪 孙小兵 《小型微型计算机系统》 CSCD 北大核心 2024年第10期2551-2560,共10页
日益增多的开源软件漏洞对软件安全带来了巨大的风险,补丁在应对这一风险的过程中扮演了非常重要的角色.不幸的是,尽管大部分漏洞的补丁在被披露前就已经开发完毕,但仅有部分补丁会随漏洞同步公开.现有的研究发现了漏洞与其补丁之间存... 日益增多的开源软件漏洞对软件安全带来了巨大的风险,补丁在应对这一风险的过程中扮演了非常重要的角色.不幸的是,尽管大部分漏洞的补丁在被披露前就已经开发完毕,但仅有部分补丁会随漏洞同步公开.现有的研究发现了漏洞与其补丁之间存在一定的相关性,并基于这些相关性特征对提交进行了排序,以定位漏洞的补丁,但仍旧存在漏洞数据部分缺失、定位准确率不佳等问题.本文提出了Patch-Locator,一种新的基于排序学习的补丁定位方法,通过扩展漏洞数据源对漏洞数据进行补充,并根据漏洞与补丁文本的相似性、漏洞产生的原因和导致的结果等更能反映漏洞与补丁间关联的因素提取了更具有针对性的相关性特征,并使用LambdaMart排序学习模型对提交基于其具有的相关性特征进行排序以定位安全补丁.本文用来自10个开源软件项目的1669个漏洞来评估Patch-Locator.实验结果表明,Patch-Locator的Recall@1指标为92.22%,Recall@5指标为95.51%,Manual Effort@5指标为1.2455,均优于现有方法. 展开更多
关键词 开源软件 安全补丁 排序学习 补丁定位
下载PDF
Secure blockchain bidding auction protocol against malicious adversaries
11
作者 Xiaobing Dai Jiajing Liu +2 位作者 Xin Liu Xiaofen Tu Ruexue Wang 《High-Confidence Computing》 EI 2024年第3期58-63,共6页
In recent years,with the development of blockchain,electronic bidding auction has received more and more attention.Aiming at the possible problems of privacy leakage in the current electronic bidding and auction,this ... In recent years,with the development of blockchain,electronic bidding auction has received more and more attention.Aiming at the possible problems of privacy leakage in the current electronic bidding and auction,this paper proposes an electronic bidding auction system based on blockchain against malicious adversaries,which uses the secure multi-party computation to realize secure bidding auction protocol without any trusted third party.The protocol proposed in this paper is an electronic bidding auction scheme based on the threshold elliptic curve cryptography.It can be implemented without any third party to complete the bidding auction for some malicious behaviors of the participants,which can solve the problem of resisting malicious adversary attacks.The security of the protocol is proved by the real/ideal model paradigm,and the efficiency of the protocol is analyzed.The efficiency of the protocol is verified by simulating experiments,and the protocol has practical value. 展开更多
关键词 Blockchain secure multi-party computation Electronic bidding auction Malicious model Real/ideal model paradigm
原文传递
基于字典分级和属性加权的密文排序检索方案
12
作者 王娟 努尔买买提·黑力力 《新疆大学学报(自然科学版中英文)》 CAS 2024年第2期246-256,共11页
可搜索加密支持用户在不解密原始数据的前提下对加密数据执行检索操作.现有的多关键词排序可搜索加密方案,其索引和陷门构建的时间成本通常依赖于由全局关键词字典张成的向量空间.为了减少用户端的计算开销和通信成本,进一步提升数据使... 可搜索加密支持用户在不解密原始数据的前提下对加密数据执行检索操作.现有的多关键词排序可搜索加密方案,其索引和陷门构建的时间成本通常依赖于由全局关键词字典张成的向量空间.为了减少用户端的计算开销和通信成本,进一步提升数据使用者对检索结果的满意度,提出了一种支持细粒度访问控制的多关键词密文排序检索方案.该方案首先设计基于互信息的字典剥离机制差异化全局字典中的关键词,得到两个信息量不同的附属子字典,进一步在低维子字典空间上生成索引和陷门;其次,引入文档访问策略中属性的权重,将其作为排序标准之一,使数据使用者获得更为相关的结果;最后,检索时利用筛选向量对数据进行初次过滤并借助属性匹配完成二次剔除,从而避免检索过程中不必要的计算. 展开更多
关键词 可搜索加密 多关键词排序检索 安全K-近邻算法 字典分级 属性加权
下载PDF
Robust peer-to-peer learning via secure multi-party computation 被引量:1
13
作者 Yongkang Luo Wenjian Luo +2 位作者 Ruizhuo Zhang Hongwei Zhang Yuhui Shi 《Journal of Information and Intelligence》 2023年第4期341-351,共11页
To solve the data island problem,federated learning(FL)provides a solution paradigm where each client sends the model parameters but not the data to a server for model aggregation.Peer-to-peer(P2P)federated learning f... To solve the data island problem,federated learning(FL)provides a solution paradigm where each client sends the model parameters but not the data to a server for model aggregation.Peer-to-peer(P2P)federated learning further improves the robustness of the system,in which there is no server and each client communicates directly with the other.For secure aggregation,secure multi-party computing(SMPC)protocols have been utilized in peer-to-peer manner.However,the ideal SMPC protocols could fail when some clients drop out.In this paper,we propose a robust peer-to-peer learning(RP2PL)algorithm via SMPC to resist clients dropping out.We improve the segmentbased SMPC protocol by adding a check and designing the generation method of random segments.In RP2PL,each client aggregates their models by the improved robust secure multi-part computation protocol when finishes the local training.Experimental results demonstrate that the RP2PL paradigm can mitigate clients dropping out with no significant degradation in performance. 展开更多
关键词 Federated learning Swarm learning secure multi-party computation Peer-to-peer learning
原文传递
人口老龄化背景下某市医疗机构建筑无障碍水平调查研究
14
作者 连鸿凯 侯战旗 +1 位作者 王建明 周钰棨 《现代医院》 2024年第2期211-214,共4页
目的为当前老龄化时代和改善老年人的无障碍就医环境提供科学参考。方法2022年12月—2023年2月期间采用随机抽样法,抽取某市10家医疗机构的375名人员作为调查对象,发放自制的《医疗机构患者就医感受综合评分表(无障碍设施类)》调查问卷... 目的为当前老龄化时代和改善老年人的无障碍就医环境提供科学参考。方法2022年12月—2023年2月期间采用随机抽样法,抽取某市10家医疗机构的375名人员作为调查对象,发放自制的《医疗机构患者就医感受综合评分表(无障碍设施类)》调查问卷375份,获得有效问卷356份并进行了信效度检验。问卷设定6个无障碍水平调查指标,每个指标设1至10分,对建筑无障碍水平进行问卷调查,收集的资料采用数据秩和比法和四分图模型进行统计分析。结果某市医疗机构的建筑无障碍平均得分为35.86分,多个指标处于中等水平,提示无障碍水平有待进一步提高。同时,不同医疗机构的经济运营状况对无障碍建设有一定影响,无障碍建设还与当地政府建设规划、工作人员的无障碍建筑意识等因素有关。结论为了应对老龄化挑战,提高老年人就医质量,降低社保成本,某市医疗机构可采取停车位、厕所等方面的无障碍改造,提升无障碍AI技术应用,打造智慧化就医场景等措施;政府需加快完善配套政策法规,加大无障碍设施改造方面的支持力度;高等院校、科研院所等可与医疗机构协同创新,产、学、研、用一体化发展,促进成果转化。 展开更多
关键词 老年人 抽样调查 无障碍建筑 数据秩和比 四分图模型 社保成本
下载PDF
A Phase Estimation Algorithm for Quantum Speed-Up Multi-Party Computing
15
作者 Wenbin Yu Hao Feng +3 位作者 Yinsong Xu Na Yin Yadang Chen Zhi-Xin Yang 《Computers, Materials & Continua》 SCIE EI 2021年第4期241-252,共12页
Security and privacy issues have attracted the attention of researchers in the field of IoT as the information processing scale grows in sensor networks.Quantum computing,theoretically known as an absolutely secure wa... Security and privacy issues have attracted the attention of researchers in the field of IoT as the information processing scale grows in sensor networks.Quantum computing,theoretically known as an absolutely secure way to store and transmit information as well as a speed-up way to accelerate local or distributed classical algorithms that are hard to solve with polynomial complexity in computation or communication.In this paper,we focus on the phase estimation method that is crucial to the realization of a general multi-party computing model,which is able to be accelerated by quantum algorithms.A novel multi-party phase estimation algorithm and the related quantum circuit are proposed by using a distributed Oracle operator with iterations.The proved theoretical communication complexity of this algorithm shows it can give the phase estimation before applying multi-party computing efficiently without increasing any additional complexity.Moreover,a practical problem of multi-party dating investigated shows it can make a successful estimation of the number of solution in advance with zero communication complexity by utilizing its special statistic feature.Sufficient simulations present the correctness,validity and efficiency of the proposed estimation method. 展开更多
关键词 Edge computing security multi-party computing quantum algorithm phase estimation communication complexity
下载PDF
Security Model for Preserving Privacy over Encrypted Cloud Computing
16
作者 Jassim R. Mlgheit Essam H. Houssein Hala H. Zayed 《Journal of Computer and Communications》 2017年第6期149-165,共17页
In our today’s life, it is obvious that cloud computing is one of the new and most important innovations in the field of information technology which constitutes the ground for speeding up the development in great si... In our today’s life, it is obvious that cloud computing is one of the new and most important innovations in the field of information technology which constitutes the ground for speeding up the development in great size storage of data as well as the processing and distribution of data on the largest scale. In other words, the most important interests of any data owner nowadays are related to all of the security as well as the privacy of data, especially in the case of outsourcing private data on a cloud server publicly which has not been one of the well-trusted and reliable domains. With the aim of avoiding any leakage or disclosure of information, we will encrypt any information important or confidential prior to being uploaded to the server and this may lead to an obstacle which encounters any attempt to support any efficient keyword query to be and ranked with matching results on such encrypted data. Recent researches conducted in this area have focused on a single keyword query with no proper ranking scheme in hand. In this paper, we will propose a new model called Secure Model for Preserving Privacy Over Encrypted Cloud Computing (SPEC) to improve the performance of cloud computing and to safeguard privacy of data in comparison to the results of previous researches in regard to accuracy, privacy, security, key generation, storage capacity as well as trapdoor, index generation, index encryption, index update, and finally files retrieval depending on access frequency. 展开更多
关键词 CLOUD Computing Multi-Keyword QUERY ranked QUERY TRAPDOOR PRIVACY PRESERVING Encrypted CLOUD Data Top-K QUERY CLOUD security
下载PDF
Preserving Privacy of Software-Defined Networking Policies by Secure Multi-Party Computation 被引量:1
17
作者 Maryam Zarezadeh Hamid Mala Homa Khajeh 《Journal of Computer Science & Technology》 SCIE EI CSCD 2020年第4期863-874,共12页
In software-defined networking(SDN),controllers are sinks of information such as network topology collected from switches.Organizations often like to protect their internal network topology and keep their network poli... In software-defined networking(SDN),controllers are sinks of information such as network topology collected from switches.Organizations often like to protect their internal network topology and keep their network policies private.We borrow techniques from secure multi-party computation(SMC)to preserve the privacy of policies of SDN controllers about status of routers.On the other hand,the number of controllers is one of the most important concerns in scalability of SMC application in SDNs.To address this issue,we formulate an optimization problem to minimize the number of SDN controllers while considering their reliability in SMC operations.We use Non-Dominated Sorting Genetic Algorithm II(NSGA-II)to determine the optimal number of controllers,and simulate SMC for typical SDNs with this number of controllers.Simulation results show that applying the SMC technique to preserve the privacy of organization policies causes only a little delay in SDNs,which is completely justifiable by the privacy obtained. 展开更多
关键词 software-defined NETWORKING (SDN) PRIVACY secure multi-party computation (SMC) structure function MULTI-OBJECTIVE optimization
原文传递
Concretely ecient secure multi-party computation protocols:survey and mor 被引量:1
18
作者 Dengguo Feng Kang Yang 《Security and Safety》 2022年第1期47-89,共43页
Secure multi-party computation(MPC)allows a set of parties to jointly compute a function on their private inputs,and reveals nothing but the output of the function.In the last decade,MPC has rapidly moved from a purel... Secure multi-party computation(MPC)allows a set of parties to jointly compute a function on their private inputs,and reveals nothing but the output of the function.In the last decade,MPC has rapidly moved from a purely theoretical study to an object of practical interest,with a growing interest in practical applications such as privacy-preserving machine learning(PPML).In this paper,we comprehensively survey existing work on concretely ecient MPC protocols with both semi-honest and malicious security,in both dishonest-majority and honest-majority settings.We focus on considering the notion of security with abort,meaning that corrupted parties could prevent honest parties from receiving output after they receive output.We present high-level ideas of the basic and key approaches for designing di erent styles of MPC protocols and the crucial building blocks of MPC.For MPC applications,we compare the known PPML protocols built on MPC,and describe the eciency of private inference and training for the state-of-the-art PPML protocols.Further-more,we summarize several challenges and open problems to break though the eciency of MPC protocols as well as some interesting future work that is worth being addressed.This survey aims to provide the recent development and key approaches of MPC to researchers,who are interested in knowing,improving,and applying concretely ecient MPC protocols. 展开更多
关键词 secure multi-party computation Privacy-preserving machine learning Secret sharings Garbled circuits Oblivious transfer and its arithmetic generalization
原文传递
Nearly universal and efficient quantum secure multi-party computation protocol
19
作者 Han Yushan Che Bichen +2 位作者 Liu Jiali Dou Zhao Di Junyu 《The Journal of China Universities of Posts and Telecommunications》 EI CSCD 2022年第4期51-68,88,共19页
Universality is an important property in software and hardware design.This paper concentrates on the universality of quantum secure multi-party computation(SMC)protocol.First of all,an in-depth study of universality h... Universality is an important property in software and hardware design.This paper concentrates on the universality of quantum secure multi-party computation(SMC)protocol.First of all,an in-depth study of universality has been conducted,and then a nearly universal protocol is proposed by using the Greenberger-Horne-Zeilinger(GHZ)-like state and stabilizer formalism.The protocol can resolve the quantum SMC problem which can be deduced as modulo subtraction,and the steps are simple and effective.Secondly,three quantum SMC protocols based on the proposed universal protocol:Quantum private comparison(QPC)protocol,quantum millionaire(QM)protocol,and quantum multi-party summation(QMS)protocol are presented.These protocols are given as examples to explain universality.Thirdly,analyses of the example protocols are shown.Concretely,the correctness,fairness,and efficiency are confirmed.And the proposed universal protocol meets security from the perspective of preventing inside attacks and outside attacks.Finally,the experimental results of the example protocols on the International Business Machines(IBM)quantum platform are consistent with the theoretical results.Our research indicates that our protocol is universal to a certain degree and easy to perform. 展开更多
关键词 UNIVERSALITY quantum secure multi-party computation security Greenberger-Horne-Zeilinger-like state simple operation
原文传递
Batch Secret Sharing for Secure Multi-party Computation in Asynchronous Network
20
作者 黄征 龚征 李强 《Journal of Shanghai Jiaotong university(Science)》 EI 2009年第1期112-116,共5页
This paper proposes an efficient batch secret sharing protocol among n players resilient to t 〈 n/4 players in asynchronous network. The construction of our protocol is along the line of Hirt's protocol which works ... This paper proposes an efficient batch secret sharing protocol among n players resilient to t 〈 n/4 players in asynchronous network. The construction of our protocol is along the line of Hirt's protocol which works in synchronous model. Compared with the method of using secret share protocol m times to share m secrets, our protocol is quite efficient. The protocol can be used to improve the efficiency of secure multi-party computation (MPC) greatly in asynchronous network. 展开更多
关键词 secret share secure multi-party computation asynchronous network
原文传递
上一页 1 2 7 下一页 到第
使用帮助 返回顶部