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

12th International Conference on Information security and cryptology, INSCRYPT 2016

作者： Qin, Baodong Han, Shuai Chen, Yu Liu, Shengli Wei, Zhuo School of Computer Science and Technology Southwest University of Science and Technology Mianyang621010 China State Key Laboratory of Cryptology P.O. Box 5159 Beijing100878 China Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai200240 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China Huawei Singapore Research Center Singapore Singapore

ISBN: (纸本)9783319547046

Related-key attacks allow an adversary to change the key stored in the memory of a physical device via tampering or other means, and subsequently observe the outcomes of the cryptosystem under these modified keys. Cramer and Shoup (CRYPTO 1998) proposed the first practical public-key encryption scheme proven to be secure against adaptive chosen-ciphertext attacks in the standard model. The scheme (CSPKE for short) has great influence since it embodies the paradigm of hash proof system. However, Wee (PKC 2012) showed that the CS-PKE scheme is not secure in the scenario of related-key attacks when the related-key derivation functions include linear functions. A fascinating problem left open is how to protect the classical CS-PKE scheme secure against linear related-key attacks. In this paper, we propose a simple method to make the Cramer-Shoup scheme secure against linear relatedkey attacks. The idea is to recompute the public key in the decryption algorithm from the secret key, so that any (dangerous) modification to the secret key could be detected during the decryption phase. The new scheme has the same efficiency as the original one, except for involving six exponentiations to fixed bases in the decryption algorithm. Fortunately, the computing time for one fixed-base exponentiation with precomputations is at least 5 times faster than that of one regular exponentiation. © Springer International Publishing AG 2017.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

Low-resolution face recognition in the wild via selective knowledge distillation

arXiv

引用

arXiv 2018年

作者： Ge, Shiming Zhao, Shengwei Li, Chenyu Li, Jia Institute of Information Engineering Chinese Academy of Sciences Beijing100095 China Institute of Information Engineering Chinese Academy of Sciences School of Cyber Security at University of Chinese Academy of Sciences China State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beihang University Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100191 China

Typically, the deployment of face recognition models in the wild needs to identify low-resolution faces with extremely low computational cost. To address this problem, a feasible solution is compressing a complex face model to achieve higher speed and lower memory at the cost of minimal performance drop. Inspired by that, this paper proposes a learning approach to recognize low-resolution faces via selective knowledge distillation. In this approach, a two-stream convolutional neural network (CNN) is first initialized to recognize high-resolution faces and resolution-degraded faces with a teacher stream and a student stream, respectively. The teacher stream is represented by a complex CNN for high-accuracy recognition, and the student stream is represented by a much simpler CNN for low-complexity recognition. To avoid significant performance drop at the student stream, we then selectively distil the most informative facial features from the teacher stream by solving a sparse graph optimization problem, which are then used to regularize the fine-tuning process of the student stream. In this way, the student stream is actually trained by simultaneously handling two tasks with limited computational resources: approximating the most informative facial cues via feature regression, and recovering the missing facial cues via low-resolution face classification. Experimental results show that the student stream performs impressively in recognizing low-resolution faces and costs only 0.15MB memory and runs at 418 faces per second on CPU and 9, 433 faces per second on GPU. Copyright © 2018, The Authors. All rights reserved.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

V-Chain: A Blockchain-Based Car Lease Platform

V-Chain: A Blockchain-Based Car Lease Platform

引用

IEEE/ACM Int'l Conference on & Int'l Conference on cyber, Physical and Social Computing (CPSCom) Green Computing and Communications (GreenCom)

作者： Kwame O.-B Obour Agyekum Qi Xia Emmanuel Boateng Sifah Sandro Amofa Kingsley Nketia Acheampong Jianbin Gao Ruidong Chen Hu Xia James C. Gee Xiaojiang Du Mohsen Guizani School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China Center for Cyber Security University of Electronic Science and Technology of China Chengdu China School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu China School of Resource and Environment University of Electronic Science and Technology of China Chengdu China Mr. Ray Co. Ltd. Chengdu and with Youe Data Co. Ltd. Beijing China School of Computer Science and Engineering Chengdu and Youe Data Co. Ltd. Beijing China Department of Radiology University of Pennsylvania Chengdu Philadelphia PA China Department of Computer and Information Sciences Temple University Philadelphia PA USA Electrical and Computer Engineering Department University of Idaho Moscow USA

Significant improvements have been made in the way several businesses are conducted due to the influx of blockchain technology, which is a paradigm shift in research these days. Because of the several benefits this technology brings, including scalability, immutability, and the ability to secure data exchange among parties, data transfer becomes easier and simpler between entities. Automobile renting is a major business nowadays. Renting an auto summons numerous frameworks over a chain of procedures - including confirming the lessee's financial status, driving qualifications, accessible vehicle stock and car features. Leasing companies and financiers, however, need to recognize what is happening to the vehicles after the rent is agreed upon. There is also the problem of time consumption, as the traditional car lease process passes through a lot of stages before completion. The blockchain innovation can keep things up to speed with smart contracts. In this paper, we develop a car lease platform that is solely based on blockchain technology. The underlying principle utilized in this system is the smart contract, which is a programmable script that enforces decisions on all transactions made on the system, and also applies penalties to perpetrators. We evaluate the efficiency of our system by measuring the latency and throughput, and make comparisons with other related systems. Results indicate our system outperforms the others.

关键词： Blockchain Automobiles Smart contracts Companies Consumer electronics

来源：评论

学校读者我要写书评

暂无评论

Concolic Execution on Small-Size Binaries: Challenges and Empirical Study

Concolic Execution on Small-Size Binaries: Challenges and Em...

引用

International Conference on Dependable Systems and Networks (DSN)

作者： Hui Xu Yangfan Zhou Yu Kang Michael R. Lyu Dept. of Computer Science The Chinese University of Hong Kong School of Computer Science Fudan University Engineering Research Center of Cyber Security Auditing and Monitoring Ministry of Education China

ISBN: (纸本)9781538605431

Concolic execution has achieved great success in many binary analysis tasks. However, it is still not a primary option for industrial usage. A well-known reason is that concolic execution cannot scale up to large-size programs. Many research efforts have focused on improving its scalability. Nonetheless, we find that, even when processing small-size programs, concolic execution suffers a great deal from the accuracy and scalability issues. This paper systematically investigates the challenges that can be introduced even by small-size programs, such as symbolic array and symbolic jump. We further verify that the proposed challenges are non-trivial via real-world experiments with three most popular concolic execution tools: BAP, Triton, and Angr. Among a set of 22 logic bombs we designed, Angr can solve only four cases correctly, while BAP and Triton perform much worse. The results imply that current tools are still primitive for practical industrial usage. We summarize the reasons and release the bombs as open source to facilitate further study.

关键词： Tools Concrete Cognition Scalability Testing Data models Arrays

来源：评论

学校读者我要写书评

暂无评论

Information Leakage in Encrypted Deduplication via Frequency Analysis

Information Leakage in Encrypted Deduplication via Frequency...

引用

International Conference on Dependable Systems and Networks (DSN)

作者： Jingwei Li Chuan Qin Patrick P. C. Lee Xiaosong Zhang University of Electronic Science and Technology of China Chengdu CN Department of Computer Science and Engineering The Chinese University of Hong Kong Center for Cyber Security University of Electronic Science and Technology of China

ISBN: (纸本)9781538605431

Encrypted deduplication seamlessly combines encryption and deduplication to simultaneously achieve both data security and storage efficiency. State-of-the-art encrypted deduplication systems mostly adopt a deterministic encryption approach that encrypts each plaintext chunk with a key derived from the content of the chunk itself, so that identical plaintext chunks are always encrypted into identical ciphertext chunks for deduplication. However, such deterministic encryption inherently reveals the underlying frequency distribution of the original plaintext chunks. This allows an adversary to launch frequency analysis against the resulting ciphertext chunks, and ultimately infer the content of the original plaintext chunks. In this paper, we study how frequency analysis practically affects information leakage in encrypted deduplication storage, from both attack and defense perspectives. We first propose a new inference attack that exploits chunk locality to increase the coverage of inferred chunks. We conduct trace-driven evaluation on both real-world and synthetic datasets, and show that the new inference attack can infer a significant fraction of plaintext chunks under backup workloads. To protect against frequency analysis, we borrow the idea of existing performance-driven deduplication approaches and consider an encryption scheme called MinHash encryption, which disturbs the frequency rank of ciphertext chunks by encrypting some identical plaintext chunks into multiple distinct ciphertext chunks. Our trace-driven evaluation shows that MinHash encryption effectively mitigates the inference attack, while maintaining high storage efficiency.

关键词： Encryption Maximum likelihood estimation Time-frequency analysis Data models computer security

来源：评论

学校读者我要写书评

暂无评论

Three Layer Game Theoretic Decision Framework for cyber-Investment and cyber-Insurance 8th

Three Layer Game Theoretic Decision Framework for Cyber-Inve...

引用

8th International Conference on Decision and Game Theory for security, GameSec 2017

作者： Tosh, Deepak K. Vakilinia, Iman Shetty, Sachin Sengupta, Shamik Kamhoua, Charles A. Njilla, Laurent Kwiat, Kevin Department of Computer Science Norfolk State University NorfolkVA United States Department of Computer Science and Engineering University of Nevada RenoNV United States Virginia Modeling Analysis and Simulation Center Old Dominion University NorfolkVA United States Network Security Branch Army Research Laboratory AdelphiMD United States Cyber Assurance Branch Air Force Research Laboratory RomeNY United States

ISBN: (纸本)9783319687100

cyber-threat landscape has become highly complex, due to which isolated attempts to understand, detect, and resolve cybersecurity issues are not feasible in making a time constrained decisions. Introduction of cyber-threat information (CTI) sharing has potential to handle this issue to some extent, where knowledge about security incidents is gathered, exchanged across organizations for deriving useful information regarding the threat actors and vulnerabilities. Although, sharing security information could allow organizations to make informed decision, it may not completely eliminate the risks. Therefore, organizations are also inclined toward considering cyber-insurance for transferring risks to the insurers. Also, in networked environment, adversaries may exploit the information sharing to successfully breach the participating organizations. In this paper, we consider these players, i.e. organizations, adversary, and insure, to model a three layer game, where players play sequentially to find out their optimal strategies. Organizations determine their optimal self-defense investment to make while participating in CTI sharing and cyber-insurance. The adversary looks for an optimal attack rate while the insurer targets to maximize its profit by offering suitable coverage level to the organizations. Using backward induction approach, we conduct subgame perfect equilibrium analysis to find optimal strategies for the involved players. We observe that when cyber-insurance is not considered, attacker prefers to increase its rate of attack. This motivates the organizations to consider cyber-insurance option for transferring the risks on their critical assets. © 2017, Springer International Publishing AG.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

On the design of a secure user authentication and key agreement scheme for wireless sensor networks

On the design of a secure user authentication and key agreem...

引用

作者： Kumari, Saru Das, Ashok Kumar Wazid, Mohammad Li, Xiong Wu, Fan Choo, Kim-Kwang Raymond Khan, Muhammad Khurram Department of Mathematics Chaudhary Charan Singh University MeerutUttar Pradesh250 005 India Center for Security Theory and Algorithmic Research International Institute of Information Technology Hyderabad500 032 India School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan411 201 China Nanjing University of Information Science and Technology Nanjing210044 China Department of Computer Science and Engineering Xiamen Institute of Technology Xiamen361021 China Department of Information Systems and Cyber Security The University of Texas at San Antonio San AntonioTX78249 United States School of Computer Science China University of Geosciences Wuhan China School of Information Technology & Mathematical Sciences University of South Australia AdelaideSA Australia Center of Excellence in Information Assurance King Saud University Riyadh Saudi Arabia

A wireless sensor network (WSN) typically consists of a large number of resource-constrained sensor nodes and several control or gateway nodes. Ensuring the security of the asymmetric nature of WSN is challenging, and designing secure and efficient user authentication and key agreement schemes for WSNs is an active research area. For example, in 2016, Farash et al. proposed a user authentication and key agreement scheme for WSNs. However, we reveal previously unpublished vulnerabilities in their scheme, which allow an attacker to carry out sensor node spoofing, password guessing, user/sensor node anonymity, and user impersonation attacks. We then present a scheme, which does not suffer from the identified vulnerabilities. To demonstrate the practicality of the scheme, we evaluate the scheme using NS-2 simulator. We then prove the scheme secure using Burrows–Abadi–Needham logic. Copyright © 2016 John Wiley & Sons, Ltd. Copyright © 2016 John Wiley & Sons, Ltd.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Infection tracing in smart hospitals 12

Infection tracing in smart hospitals

引用

12th IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob 2016

作者： Qathrady, Mimonah Al Helmy, Ahmed Almuzaini, Khalid Computer and Information Science and Engineering Department University of Florida GainesvilleFL United States National Center for Cyber Security Technology King Abdulaziz City for Science and Technology Riyadh Saudi Arabia

ISBN: (纸本)9781509007240

Many disease infection cases are acquired and spread in hospital settings. Early detection of such infection cases is necessary to identify population at risk accurately and effectively. This paper introduces a systematic infection detection framework utilizing mobile communication technologies including mobile networking and encounter statistics during infection breakouts. Our target environment is smart connected hospitals using Internet of things. First, the disease infection trace-back problem is defined. Then a detailed practical framework is devised using wireless encounters to facilitate the trace-back to the infection source and identify the population at risk;the nodes that are likely infected. Trace back and filtering methods are then proposed using probabilistic forward and backward search techniques. We use extensive WLAN campus traces of six buildings with different mobility characteristics and over 34K users to drive our simulations. Metrics of true positive, true negative, accuracy and coverage are measured and presented. Our results thus far show promise, where in most cases the accuracy of correctly selecting the infected nodes that have been in the area during the epidemic period were found to reach 70-80% with population selection coverage close to the infection percentage of nodes. © 2016 IEEE.

关键词： Hospitals

来源：评论

学校读者我要写书评

暂无评论

Bandwidth-aware delayed repair in distributed storage systems 24

Bandwidth-aware delayed repair in distributed storage system...

引用

24th IEEE/ACM International Symposium on Quality of Service, IWQoS 2016

作者： Shen, Jiajie Gu, Jiazhen Zhou, Yangfan Wang, Xin School of Computer Science Fudan University Shanghai China The State Key Laboratory of Integrated Services Networks Xidian University Xi'an China Engineering Research Center of Cyber Security Auditing and Monitoring Ministry of Education China

ISBN: (纸本)9781509026340

In data storage systems, data are typically stored in redundant storage nodes to ensure storage reliability. When storage nodes fail, with the help of the redundant nodes, the lost data can be restored in new storage nodes. Such a regeneration process may be aborted, since storage nodes may fail during the process. Therefore, reducing the time of regeneration process is a well-known challenge to improve the reliability of storage systems. Delayed repair is a typical repair scheme in real-world storage systems. It reduces the overhead of the regeneration process by recovering multiple node failures simultaneously. How to reduce the regeneration time of delayed repair is yet to be well addressed. Since available bandwidth is flowing in storage systems and the regeneration time is seriously affected by the available bandwidth, we find the key to solve this problem is determining the start time of the regeneration process. Via modeling this problem with Lyaponuv optimization framework, we propose an OMFR scheme to reduce the regeneration time. The experimental results show that OMFR scheme can reduce cumulative regeneration time by up to 78% compared with traditional delayed repair schemes. © 2016 IEEE.

关键词： Repair

来源：评论

学校读者我要写书评

暂无评论

Study on Demand Response of Residential Power Customer

Study on Demand Response of Residential Power Customer

引用

Workshop 7 2016

作者： Xiu Cao Haiyong Jiang Lei Huang Xueping Wang Xuqi Zhang School of Computer Science Fudan University Engineering Research Center of Cyber Security Auditing and Monitoring Ministry of Education

In order to optimize the ladder-pricing scheme in Shanghai, we present a multi-objective optimization model(MOOM). To build this model, first we use price elasticity theory;divide the ladder pricing into peak electricity bill and valley electricity bill in the time dimension to model the single-user demand response. Second based on the single-user demand response model, combined with the overall users' electricity distribution density function, we build an all-users demand response model. The proposed model has two objectives: minimize energy consumption and maximize residents' satisfaction. Simulation results confirm that the proposed model can optimize the ladder-pricing scheme.

关键词： Demand Response Ladder Pricing Price Elasticity Ladder Pricing Optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：