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

4th Italian Conference on Cyber security, ITASEC 2020

作者： Caputo, D. Verderame, L. Merlo, A. Ranieri, A. Caviglione, L. Computer Security Lab Department of Informatics Bioengineering Robotics and Systems Engineering University of Genoa Italy Institute for Applied Mathematics and Information Technologies National Research Council of Italy Italy

Smart speakers and voice-based virtual assistants are core building blocks of modern smart homes. For instance, they are used to retrieve information, interact with other devices, and command a variety of Internet of Things (IoT) nodes. To this aim, smart speakers and voice-based assistants typically take advantage of cloud architectures: vocal commands of the user are sampled, sent through the Internet to be processed and transmitted back for local execution, e.g., to perform an automation task or activate an IoT device. Even if privacy and security is enforced by means of encryption, features of the traffic, such as the throughput, the size of protocol data units or the IP addresses, can leak important information about the habits of the users as well as the number and the type of IoT nodes deployed. In this perspective, the paper showcases risks of machine learning techniques to develop black-box models to automatically classify traffic and implement privacy leaking attacks. We prove that such traffic analysis allows to detect the presence of a person in a house equipped with a Google Home device, even if the same person does not interact with the smart device. Experimental results collected in a realistic scenario are presented and possible countermeasures are discussed. Copyright © 2020 for this paper by its authors.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Privacy-Aware Artificial Intelligence with Homomorphic Encryption using Machine Learning

Privacy-Aware Artificial Intelligence with Homomorphic Encry...

引用

2023 International Conference on Sustainable Computing and Smart Systems, ICSCSS 2023

作者： Srinivasa Rao, B. Chattopadhyay, Saumitra Singh, Prashant Hazela, Bramah Sabarinathan, G. Yamini, Kalva Department of Computer Science and Engineering Bachupally Telangana Hyderabad India Graphic Era Hill University Department of Computer Science and Engineering Dehradun India Amity University Amity School of Engineering and Technology Lucknow Department of Computer Science and Engineering Uttar Pradesh India Psna College of Engineering and Technology Department of Mathematics Tamilnadu Dindigul India Sri Ramachandra Institute of Higher Education and Research Cyber Security in Computer Science and Engineering Tamilnadu Chennai India

ISBN: (纸本)9798350333602

Along with the expansion of machine learning (ML) applications, the amount of data required to create predictions increases. Big-data ML has always been limited by off-chip memory capacity and computational speed. Considerably, privacy is one of the limitations of big data, which can be solved by homomorphic encryption (HE). Due to the combination of HE and ML, the multi-party privacy-protected ML suggested in this research may assist numerous users in doing artificial intelligence (AI) without disclosing private data. The technique may train common models in situations of data abuse, particularly in private data protection. The model trained using the ML technique named Artificial Neural Network (ANN) has a similar impact to the model developed using all data on a single computer, according to experiments using the algorithm. The gradient data is simply transmitted by all parties, and homomorphic procedures in the main computing system combine the gradient data. Besides, the optimal key is selected using the significance of the Lion Algorithm (LA). After homomorphic procedures, the learning model is modified depending on the new gradient data. © 2023 IEEE.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Distributed Secure Storage Scheme Based on Sharding Blockchain

引用

computers, Materials & Continua 2022年第3期70卷 4485-4502页

作者： Jin Wang Chenchen Han Xiaofeng Yu Yongjun Ren R.Simon Sherratt School of Computer Science and Mathematics Fujian University of TechnologyFuzhou350118China School of Computer&Communication Engineering Changsha University of Science&TechnologyChangsha410004China School of Business Nanjing UniversityNanjing210093China School of Computer School of SoftwareSchool of Cyberspace SecurityEngineering Research Center of Digital ForensicsMinistry of EducationNanjing University of Information Science&TechnologyNanjing210044China Department of Biomedical Engineering University of ReadingRG66AYUK

Distributed storage can store data in multiple devices or servers to improve data ***,in today’s explosive growth of network data,traditional distributed storage scheme is faced with some severe challenges such as insufficient performance,data tampering,and data lose.A distributed storage scheme based on blockchain has been proposed to improve security and efficiency of traditional distributed *** this scheme,the following improvements have been made in this *** paper first analyzes the problems faced by distributed *** proposed to build a new distributed storage blockchain scheme with sharding *** proposed scheme realizes the partitioning of the network and nodes by means of blockchain sharding technology,which can improve the efficiency of data verification between *** addition,this paper uses polynomial commitment to construct a new verifiable secret share scheme called *** new scheme is one of the foundations for building our improved distributed storage blockchain *** with the previous scheme,our new scheme does not require a trusted third party and has some new features such as homomorphic and batch *** security of VSS can be further *** comparisons show that the proposed scheme significantly reduces storage and communication costs.

关键词： Blockchain distributed storage verifiable secret share polynomial commitment

来源：评论

学校读者我要写书评

暂无评论

Multicast adaptive logic for Dynamic Adaptive Streaming over HTTP network

Multicast adaptive logic for Dynamic Adaptive Streaming over...

引用

IEEE Conference on computer Communications Workshops, INFOCOM WKSHPS 2015

作者： Dubin, Ran Dvir, Amit Hadar, Ofer Harel, Nissim Barkan, Refael Communication Systems Engineering Ben-Gurion University of the Negev Israel Cyber Security Center Department of Computer Science and Mathematics Ariel University Israel Computer Science Department Holon Institute of Technology Israel Computer Science School College of Management Academic Studies Israel

ISBN: (纸本)9781467371315

Video streaming constitutes the vast majority of Internet traffic and the DASH protocol has become the de-facto standard in the industry of multimedia delivery. The multicast method for information distribution has the potential to dramatically reduce multimedia streaming traffic;however, to date, there is no effective Adaptive Logic (AL) designed to support multicast constraints at the client side. In this paper we present an adaptive logic that is designed specifically for multicast scenarios. A comparison of our Multicast Adaptive Logic (MAL) with leading ALs under multicast conditions demonstrates that MAL provides the best performance under multicast conditions and good performance under unicast conditions. © 2015 IEEE.

关键词： computer circuits

来源：评论

学校读者我要写书评

暂无评论

LDoS Attacks Detection for ICPS NB-IoTs Environment via SE-Based CNN

引用

IEEE Systems Journal 2023年第4期17卷 5280-5291页

作者： Cho, Hsin-Hung Tsai, Min-Yan Zeng, Jiang-Yi Yu, Chia-Mu Chao, Han-Chieh You, Ilsun National Ilan University Department of Computer Science and Information Engineering Yilan26047 Taiwan National Yang Ming Chiao Tung University Department of Information Management and Finance Hsinchu30010 Taiwan National Dong Hwa University Department of Electrical Engineering Hualien97401 Taiwan UCSI University Institute of Computer Science and Innovation Kuala Lumpur56000 Malaysia Kookmin University Department of Information Security Cryptology and Mathematics Seoul02707 Korea Republic of

After Industry 4.0 was proposed, cyber-physical systems (CPS) were also introduced into the industrial environment called the industrial CPS. Internet-of-Things (IoT) services in the industry make intelligent decision-making more effective. In large enterprises, there are often requirements for cross-factory and transnational business. Narrowband IoT (NB-IoT) can provide wider coverage and indoor support, making deployment more flexible. However, NB-IoT is not equipped with powerful computing capabilities, preventing NB-IoT devices from having powerful information security software for defense. Thus, NB-IoT is vulnerable to low-rate denial-of-service attacks. Such attacks hide in normal traffic and are difficult to detect. This study uses a novel search economy to improve the weight combination search of a convolutional neural network to achieve a better detection rate. © 2007-2012 IEEE.

关键词： Denial-of-service attack

来源：评论

学校读者我要写书评

暂无评论

Permutation polynomials x~(2k+1+3)+ax2k+2+bx over F_(22k) and their differential uniformity

引用

Science China(Information Sciences) 2020年第10期63卷 255-257页

作者： Jie PENG Lijing ZHENG Chunsheng WU Haibin KAN Mathematics and Science College Shanghai Normal University School of Mathematics and Physics University of South China Department of Mathematics Lianyungang Normal University Shanghai Key Laboratory of Intelligent Information Processing School of Computer ScienceFudan University Fudan-Zhongan Joint Laboratory of Blockchain and Information Security Shanghai Blockchain Engineering Research Center Shanghai Institute for Advanced Communication and Data Science Shanghai Institute of Intelligent Electronics & Systems

Dear editor,A polynomial f（x）∈Fq[x] is called a permutation polynomial （PP） over the finite field Fq if the associated mapping f:c （?） f（c） from Fq to itself is bijective.A PP f is called a complete permutation polynomial if f（x）+x is a *** over finite fields of even characteristic have wide applications,including cryptography,coding theory,and communication *** many block ciphers with substitution-permutation network structure,the substitution box is usually a PP over F_(22k)for some positive integer *** resist the differential attacks,the differential uniformity of this

关键词： Finite fields Permutation polynomial Binomial Trinomial Differential uniformity

来源：评论

学校读者我要写书评

暂无评论

Proceedings of Fifth International Conference on Computing, Communications, and Cyber-security 1

引用

丛书名： Lecture Notes in Networks and Systems

1000年

作者： Sudeep Tanwar Pradeep Kumar Singh Maria Ganzha Gregory Epiphaniou

来源：评论

学校读者我要写书评

暂无评论

Practical certificateless aggregate signatures from bilinear maps

Practical certificateless aggregate signatures from bilinear...

引用

作者： Gong, Zheng Long, Yu Hong, Xuan Chen, Kefei Distributed and Embedded Security Group Faculty of Electrical Engineering Mathematics and Computer Science University of Twente Enschede 7500 Netherlands Department of Computer Science and Engineering Shanghai Jiaotong University Shanghai 200240 China National Laboratory of Modern Communications Chengdu 610041 China

Aggregate signature is a digital signature with a striking property that anyone can aggregate n individual signatures on n different messages which are signed by n distinct signers, into a single compact signature to reduce computational and storage costs. In this work, two practical certificateless aggregate signature schemes are proposed from bilinear maps. The first scheme CAS-X reduces the costs of communication and signer-side computation but trades off the storage, while CAS-2 minimizes the storage but sacrifices the communication costs. One can choose either of the schemes by consideration of the application requirement. Compare with ID-based schemes, our schemes do not entail public key certificates as well and achieve the trust Level 3, which imply the frauds of the authority are detectable. Both of the schemes are proven secure in the random oracle model by assuming the intractability of the computational Diffie-Hellman problem over the groups with bilinear maps, where the forking lemma technique is avoided.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Certificateless partially blind signatures

Certificateless partially blind signatures

引用

1st International Conference on Information Science and engineering, ICISE2009

作者： Zhang, Lei Zhang, Futai School of Computer Science and Technology Nanjing Normal University China Department of Computer Engineering and Mathematics Universitat Rovira I Virgili E-43007 Tarragona Catalonia Spain Jiangsu Engineering Research Center on Information Security and Privacy Protection Technology Nanjing China

ISBN: (纸本)9780769538877

Partially blind signature is a variant of blind signature. It allows a signer to explicitly include common information in a blind signature under some agreement with a receiver. It provides anonymity of users in applications such as electronic voting and electronic payment systems. While certificateless public key cryptography eliminates the key escrow problem in identity public key cryptography. In this paper, we introduce the concept of partially blind signature into certificateless public key cryptography. The security model of certificateless partially blind signature scheme is defined. A certificateless partially blind signature scheme is presented as well. The scheme is proven existentially unforgeable against adaptive chosen-message attacks under the computational Diffie-Hellman assumption. ©2009 IEEE.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

On an attack on RSA with small CRT-exponents

引用

Science China(Information Sciences) 2010年第8期53卷 1511-1518页

作者： HAN LiDong 1,2 , WANG XiaoYun 3 & XU GuangWu 3,4 1 Key Laboratory of Cryptologic Technology and Information security, Ministry of Education, Shandong University, Jinan 250100, China 2 School of mathematics, Shandong University, Jinan 250100, China 3 Institute for Advanced Study, Tsinghua University, Beijing 100084, China 4 department of Electrical engineering and computer Science, University of Wisconsin-Milwaukee, Milwaukee, WI 53201, USA Key Laboratory of Cryptologic Technology and Information Security Ministry of Education Shandong University Jinan China School of Mathematics Shandong University Jinan China Institute for Advanced Study Tsinghua University Beijing China Department of Electrical Engineering and Computer Science University of Wisconsin-Milwaukee Milwaukee USA

This paper concerns the RSA system with private CRT-exponents. Since Chinese remainder representation provides efficiency in computation, such system is of some practical significance. In this paper, an existing attack to small private CRT-exponents is analyzed. It is indicated that this attack makes nice use of lattice in RSA analysis, but some argument does not hold in general. Several counterexamples are constructed. Refinements and more precise statements of the attack are given.

关键词： RSA CRT cryptanalysis continued fraction lattice reduction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：