检索结果-内蒙古大学图书馆

Privacy-Preserving and Distributed algorithms for Modular Exponentiation in IoT With Edge Computing Assistance

IEEE INTERNET OF THINGS JOURNAL 2020年第9期7卷 8769-8779页

作者： Li, Hongjun Yu, Jia Zhang, Hanlin Yang, Ming Wang, Huaqun Qingdao Univ Coll Comp Sci & Technol Qingdao 266071 Peoples R China Qilu Univ Technol Shandong Acad Sci Jinan 250353 Peoples R China Natl Supercomp Ctr Jinan Shandong Comp Sci Ctr Jinan 250014 Peoples R China Shandong Prov Key Lab Comp Networks Jinan 250014 Peoples R China Nanjing Univ Posts & Telecommun Jiangsu Key Lab Big Data Secur & Intelligent Proc Nanjing 210023 Peoples R China

With the development of Internet of Things (IoT) and 5G, edge computing, as a new computing paradigm, has been widely popularized in academia and industry. Due to the distributed architecture and being close to the user, edge computing can faster respond to the IoT device's request and provide a better quality of service for IoT applications. An important application of edge computing is to outsource the complicated computation task to the nearby edge nodes. Modular exponentiation is widely considered as one of the most common and expensive operations in cryptographic protocols. As far as we know, all secure outsourcing algorithms of modular exponentiation are based on the centralized cloud server, but not based on multiple edge nodes. In this article, we propose the first secure and distributed outsourcing algorithm for modular exponentiation (fixed base and variable exponent) under the multiple noncolluding edge node model. In our algorithm, the exponent is divided into a certain number of parts. In addition, we propose another secure and distributed outsourcing algorithm of modular exponentiation (variable base and variable exponent). The user can protect the privacy in the process of outsourcing and detect the invalid results from edge nodes with high probability. Finally, we provide the experimental evaluation to support that our proposed algorithms are efficient on both the user side and the edge node side.

关键词： Outsourcing Edge computing Task analysis Servers Internet of Things Cloud computing Image edge detection Edge computing Internet of Things (IoT) modular exponentiation outsource-secure algorithms privacy preserving

来源：评论

学校读者我要写书评

暂无评论

Blockchain-based system for secure outsourcing of bilinear pairings

引用

INFORMATION SCIENCES 2020年 527卷 590-601页

作者： Lin, Chao He, Debiao Huang, Xinyi Xie, Xiang Choo, Kim-Kwang Raymond Wuhan Univ Sch Cyber Sci & Engn Key Lab Aerosp Informat Secur & Trusted Comp Minist Educ Wuhan Peoples R China Nanjing Univ Posts & Telecommun Jiangsu Key Lab Big Data Secur & Intelligent Proc Nanjing Peoples R China Fujian Normal Univ Coll Math & Informat Fujian Prov Key Lab Network Secur & Cryptol Fuzhou Peoples R China Juzix Technol Co Ltd Shenzhen Peoples R China Univ Texas San Antonio Dept Informat Syst & Cyber Secur San Antonio TX USA Univ Texas San Antonio Dept Elect & Comp Engn San Antonio TX USA

secure computation outsourcing in Internet of Things (IoT) system is an ongoing research challenge, partly due to the resource-constrained nature of most (inexpensive) IoT devices. In this paper, we focus on the secure outsourcing of bilinear pairings (SOBP) (the most computationally expensive operation in pairing-based cryptographic protocols / algorithms). First, we analyze the limitations in existing SOBP-based schemes, such as the one malicious model (Strong Assumption), a secure channel (Insufficiency), and a trusted server (Centralization). Then, we propose a novel blockchain-based system for SOBP based on a permissioned version (i.e., a blockchain ledger maintained by some permissioned nodes), designed to efficiently address the limitations. Finally, we prove the security of our proposed approach in the one untrusted program model and implement it on Ethereum (an open-source blockchain system) to show its utility. (C) 2018 Elsevier Inc. All rights reserved.

关键词： Internet of Things Blockchain Smart contract outsource-secure algorithms Bilinear pairings

来源：评论

学校读者我要写书评

暂无评论

How to securely outsource the inversion modulo a large composite number

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2017年 129卷 26-34页

作者： Su, Qianqian Yu, Jia Tian, Chengliang Zhang, Hanlin Hao, Rong Qingdao Univ Coll Comp Sci & Technol Qingdao 266071 Peoples R China Nanjing Univ Informat Sci & Technol Sch Comp & Software Nanjing 210044 Jiangsu Peoples R China

Modular inversion is one of the most basic computations in algorithmic number theory. When it comes to cryptosystems, this computation is very time-consuming since the modulus is generally a large number. It is unrealistic for some devices with limited computation capability (e.g. mobile devices and IC cards) to conduct such a time-consuming computation. In this paper, we investigate how to securely outsource the inversion modulo a large composite number. Based on the Chinese Remainder Theorem (CRT), we design a secure outsourcing algorithm for inversion modulo a large composite number with two known prime factors for the client. Besides the privacy of the number and its modular inversion, our algorithm also protects the privacy of the modulus. We can verify the correctness of the result with probability 1. Traditionally, the complexity of modular inversion for a l-bit modulus is 0(l(3)). By leveraging the cloud, our algorithm reduces the complexity to 0(l(2)) on the client side. Also, we prove the security of our algorithm based on the one-malicious version of two untrusted program model (one-malicious model). We conduct several experiments to demonstrate the validity and the practicality of our proposed algorithm. In appendix, we show that our proposed algorithm can be extended and applied in the secret key generation of RSA algorithm on the resource-constrained devices. (C) 2017 Elsevier Inc. All rights reserved.

关键词： Cloud computing outsource-secure algorithms Modular inversion Chinese remainder theorem

来源：评论

学校读者我要写书评

暂无评论

secure Outsourcing of Large-scale Linear Programming

Secure Outsourcing of Large-scale Linear Programming

引用

2017 2nd International Conference on Wireless Communication and Network Engineering(WCNE 2017)

作者： Zhi-kuan WANG Yang LIU Nanjing University of Aeronautics and Astronautics

Linear programming(LP) is often used in reality production and life, such as the use of resources, human resource management, production arrangement. The client should pay out huge amounts of overhead to dispose huge data sets with its resource-constraint devices. Fortunately, Cloud computing can finish off this deficiency. The client outsources the computation to cloud servers. Then the servers accomplish the task and return the result to the client. But in the process, the correctness, verifiability and privacy should be emphasized. In our paper, based on the studies and analysis of previous protocols for secure outsourcing of linear programming in cloud computing, we find the obvious deficiencies in efficiency and safety. On the basis of the existing protocols, we propose a new protocol that combines the advantages of existing protocols and improves the shortcomings of existing protocols. We also analyze the security and efficiency of the new protocol and design a suitable simulation to verify the efficiency of this protocol.

关键词： Cloud computing outsource-secure algorithms Linear programming Data security

来源：评论

学校读者我要写书评

暂无评论

Efficient algorithms for secure outsourcing of bilinear pairings

引用

THEORETICAL COMPUTER SCIENCE 2015年第C期562卷 112-121页

作者： Chen, Xiaofeng Susilo, Willy Li, Jin Wong, Duncan S. Ma, Jianfeng Tang, Shaohua Tang, Qiang Xidian Univ State Key Lab Integrated Serv Networks ISN Xian Peoples R China Univ Wollongong Sch Comp Sci & Software Engn Ctr Comp & Informat Secur Res Wollongong NSW 2522 Australia Guangzhou Univ Sch Comp Sci & Educ Software Guangzhou Guangdong Peoples R China City Univ Hong Kong Dept Comp Sci Hong Kong Hong Kong Peoples R China S China Univ Technol Sch Comp Sci & Engn Guangzhou Guangdong Peoples R China Univ Luxembourg APSIA Grp SnT L-1359 Luxembourg Luxembourg

The computation of bilinear pairings has been considered the most expensive operation in pairing-based cryptographic protocols. In this paper, we first propose an efficient and secure outsourcing algorithm for bilinear pairings in the two untrusted program model. Compared with the state-of-the-art algorithm, a distinguishing property of our proposed algorithm is that the (resource-constrained) outsourcer is not required to perform any expensive operations, such as point multiplications or exponentiations. Furthermore, we utilize this algorithm as a subroutine to achieve outsource-secure identity-based encryptions and signatures. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Cloud computing outsource-secure algorithms Bilinear pairings Untrusted program model

来源：评论

学校读者我要写书评

暂无评论

New algorithms for secure Outsourcing of Large-Scale Systems of Linear Equations

引用

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 2015年第1期10卷 69-78页

作者： Chen, Xiaofeng Huang, Xinyi Li, Jin Ma, Jianfeng Lou, Wenjing Wong, Duncan S. Xidian Univ State Key Lab Integrated Serv Networks Xian 710065 Peoples R China Fujian Normal Univ Sch Math & Comp Sci Fujian Prov Key Lab Network Secur & Cryptol Fuzhou 350007 Peoples R China Guangzhou Univ Sch Comp Sci Guangzhou 510006 Guangdong Peoples R China Xidian Univ Sch Comp Sci & Technol Xian 710065 Peoples R China Virginia Polytech Inst & State Univ Dept Comp Sci Blacksburg VA 24061 USA City Univ Hong Kong Dept Comp Sci Hong Kong Hong Kong Peoples R China

With the rapid development in availability of cloud services, the techniques for securely outsourcing the prohibitively expensive computations to untrusted servers are getting more and more attentions in the scientific community. In this paper, we investigate secure outsourcing for large-scale systems of linear equations, which are the most popular problems in various engineering disciplines. For the first time, we utilize the sparse matrix to propose a new secure outsourcing algorithm of large-scale linear equations in the fully malicious model. Compared with the state-of-the-art algorithm, the proposed algorithm only requires (optimal) one round communication (while the algorithm requires L rounds of interactions between the client and cloud server, where L denotes the number of iteration in iterative methods). Furthermore, the client in our algorithm can detect the misbehavior of cloud server with the (optimal) probability 1. Therefore, our proposed algorithm is superior in both efficiency and checkability. We also provide the experimental evaluation that demonstrates the efficiency and effectiveness of our algorithm.

关键词： Cloud computing outsource-secure algorithms system of linear equations

来源：评论

学校读者我要写书评

暂无评论

secure Outsourcing of Multiple Modular Exponentiations 29

Secure Outsourcing of Multiple Modular Exponentiations

引用

IEEE 29th International Conference on Advanced Information Networking and Applications (IEEE AINA)

作者： Li, Jinyang Ye, Jun Xidian Univ State Key Lab Integrated Serv Networks ISN Xian Peoples R China Sichuan Univ Sci & Engn Sch Sci Zigogn Peoples R China

ISBN: (纸本)9781479979042

Modular exponentiation with a large modulus, which is usually accomplished by repeated modular multiplications, has been widely used in public key cryptosystems for secure data communications. Hohenberger and Lysyanskaya [14] proposed the first algorithm for secure outsourcing of modular exponentiations, and then Chen et al. [16] improved the algorithm, which can implement simultaneous modular exponentiations of u(a)(1)u(b)(2). In this paper, we present a secure algorithm for resource-constrained customers, who outsource simulataneous modular exponentiations operation, a task of intensive computation workload, to untrusted servers in the model with one malicious adversary. Based on Chen's algorithm, our algorithm achieves n simultaneous modular exponentiations in outsourcing computation. Compared with [14] and [16], our algorithm is more efficiency.

关键词： cloud computing outsource-secure algorithms multiple modular exponentiations

来源：评论

学校读者我要写书评

暂无评论

New algorithms for secure Outsourcing of Modular Exponentiations

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2014年第9期25卷 2386-2396页

作者： Chen, Xiaofeng Li, Jin Ma, Jianfeng Tang, Qiang Lou, Wenjing Xidian Univ State Key Lab Integrated Serv Networks ISN Xian Peoples R China Guangzhou Univ Sch Comp Sci & Educ Software Guangzhou Guangdong Peoples R China Xidian Univ Sch Comp Sci & Technol Xian Peoples R China Univ Luxembourg SnT Walferdange Luxembourg Virginia Polytech Inst & State Univ Dept Comp Sci Blacksburg VA 24061 USA

With the rapid development of cloud services, the techniques for securely outsourcing the prohibitively expensive computations to untrusted servers are getting more and more attention in the scientific community. Exponentiations modulo a large prime have been considered the most expensive operations in discrete-logarithm-based cryptographic protocols, and they may be burdensome for the resource-limited devices such as RFID tags or smartcards. Therefore, it is important to present an efficient method to securely outsource such operations to (untrusted) cloud servers. In this paper, we propose a new secure outsourcing algorithm for (variable-exponent, variable-base) exponentiation modulo a prime in the two untrusted program model. Compared with the state-of-the-art algorithm, the proposed algorithm is superior in both efficiency and checkability. Based on this algorithm, we show how to achieve outsource-secure Cramer-Shoup encryptions and Schnorr signatures. We then propose the first efficient outsource-secure algorithm for simultaneous modular exponentiations. Finally, we provide the experimental evaluation that demonstrates the efficiency and effectiveness of the proposed outsourcing algorithms and schemes.

关键词： Cloud computing outsource-secure algorithms modular exponentiation

来源：评论

学校读者我要写书评

暂无评论

Efficient and Verifiable Algorithm for secure Outsourcing of Large-scale Linear Programming

Efficient and Verifiable Algorithm for Secure Outsourcing of...

引用

28th IEEE International Conference on Advanced Information Networking and Applications Workshops (IEEE WAINA)

作者： Nie, Haixin Chen, Xiaofeng Li, Jin Liu, Josolph Lou, Wenjing Xidian Univ Sch Math & Stat Xian Peoples R China Xidian Univ State Key Lab Integrated Serv Networks ISN Xian Peoples R China Guangzhou Univ Sch Comp Sci & Educ Software Guangzhou Guangdong Peoples R China I2R Infocomm Secur Dept Singapore Singapore Virginia Polytech Inst & State Univ Dept Comp Sci Blacksburg VA 24061 USA

ISBN: (纸本)9781479936298

Linear programming (LP) has been well studied in the scientific community for various engineering applications such as network flow problems, packet routing, portfolio optimization, and financial data management, etc. In this paper, we first utilize the sparse matrix to investigate secure outsourcing for large-scale LP systems, which is considered as a prohibitively expensive computation for the clients with resource-constraint devices. Besides, we propose a secure and practical scheme which is suitable for any LP problem (feasible, infeasible or unbounded) even in the fully malicious model. Compared with the state-of-the-art algorithm [30], our proposed algorithm only requires O(n(2)) computational overhead instead of O(n(rho)) for 2 < rho <= 3. Furthermore, the client C can detect the misbehavior of cloud server S with the (optimal) probability 1 under the computational complexity of O(n).

关键词： Cloud computing outsource-secure algorithms Linear programming Data secrecy

来源：评论

学校读者我要写书评

暂无评论

Efficient and Verifiable Algorithm for secure Outsourcing of Large-scale Linear Programming

Efficient and Verifiable Algorithm for Secure Outsourcing of...

引用

IEEE International Conference on Advanced Information Networking and Applications

作者： Haixin Nie Xiaofeng Chen Jin Li Josolph Liu Wenjing Lou School of Mathematics and Statistics Xidian University P.R. China State Key Laboratory of Integrated Service Networks (ISN) Xidian University P.R. China School of Computer Science and Educational Software Guangzhou University P.R. China Infocomm Security Department Institute for Infocomm Research (I2R) Singapore Department of Computer Science Virginia Polytechnic Institute and State University USA

ISBN: (纸本)9781479936311

Linear programming (LP) has been well studied in the scientific community for various engineering applications such as network flow problems, packet routing, portfolio optimization, and financial data management, etc. In this paper, we first utilize the sparse matrix to investigate secure outsourcing for large-scale LP systems, which is considered as a prohibitively expensive computation for the clients with resource-constraint devices. Besides, we propose a secure and practical scheme which is suitable for any LP problem (feasible, infeasible or unbounded) even in the fully malicious model. Compared with the state-of-the-art algorithm [30], our proposed algorithm only requires O(n~2) computational overhead instead of O(n~ρ) for 2 < ρ ≤ 3. Furthermore, the client C can detect the misbehavior of cloud server S with the (optimal) probability 1 under the computational complexity of O(n).

关键词： Cloud computing outsource-secure algorithms Linear programming Data secrecy

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：