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

IEEE Symposium on security and Privacy

作者： Adam Waksman Simha Sethumadhavan Computer Architecture and Security Technology Laboratory Department of Computer Science Columbia University New York USA

Hardware components can contain hidden backdoors, which can be enabled with catastrophic effects or for ill-gotten profit. These backdoors can be inserted by a malicious insider on the design team or a third-party IP provider. In this paper, we propose techniques that allow us to build trustworthy hardware systems from components designed by untrusted designers or procured from untrusted third-party IP providers. We present the first solution for disabling digital, design-level hardware backdoors. The principle is that rather than try to discover the malicious logic in the design -- an extremely hard problem -- we make the backdoor design problem itself intractable to the attacker. The key idea is to scramble inputs that are supplied to the hardware units at runtime, making it infeasible for malicious components to acquire the information they need to perform malicious actions. We show that the proposed techniques cover the attack space of deterministic, digital HDL backdoors, provide probabilistic security guarantees, and can be applied to a wide variety of hardware components. Our evaluation with the SPEC 2006 benchmarks shows negligible performance loss (less than 1% on average) and that our techniques can be integrated into contemporary microprocessor designs.

关键词： Hardware security Hardware design languages Testing Nonvolatile memory System-on-a-chip Microprocessors

来源：评论

学校读者我要写书评

暂无评论

On the nonlinearity of some T-functions

引用

Journal of Information and Computational Science 2011年第11期8卷 2231-2237页

作者： Wang, Yan Hu, Yupu Li, Shunbo Key Laboratory of Computer Networks and Information Security Ministry of Education Xidian University Xi'an 710071 China Department of Mathematics Xi'an University of Architecture and Technology Xi'an 710055 China

Single cycle T-functions are newly proposed components in stream cipher. In order to verify if such function is suitable for cipher design, the cryptographic properties of single cycle T-function are discussed. Nonlinearity of the kth coordinate function of single cycle T-functions are studied according to the properties of single cycle T-function and the Walsh transform. Lower bounds and upper bounds are given at different situations. The results show that a single cycle T-function itself have 0 nonlinearity, but the most significant coordinate function can get high nonlinearity. © 2011 Binary Information Press.

关键词： Walsh transforms

来源：评论

学校读者我要写书评

暂无评论

Cryptanalysis of dragon scheme

引用

The Journal of China Universities of Posts and Telecommunications 2010年第4期17卷 80-87页

作者： YUAN Feng HU Yu-pu WANG Yan OU Hai-wen Key Laboratory of Computer Networks and Information Security Ministry of Education Xidian University Xi'an 710071 China School of Science Xi'an University of Architecture and Technology Xi'an 710055 China Key Laboratory of Information Security Beijing Electronic Science and Technology Institute Beijing 100070 China

Patarin proposed the dragon scheme, pointed out the insecurity of the dragon algorithm with one hidden monomial and suggested a candidate dragon signature algorithm with a complicated function. This paper presents an algebraic method to attack the candidate dragon signature algorithm. The attack borrows the basic idea of the attack due to Kipnis and Shamir, and utilizes the underlying algebraic structure of the candidate dragon signature algorithm over the extension field to derive a way to enable the variable Y be viewed as a fixed value. The attack recovers the private keys efficiently when the parameters are n≤2s and D=[logq^d]≤3.

关键词： cryptography public key cryptography polynomials mapping multivariate dragon scheme algebraic method cryptanalysis

来源：评论

学校读者我要写书评

暂无评论

security analysis of projected C*- scheme

Security analysis of projected C*- scheme

引用

International Conference on Multimedia Information Networking and security

作者： Yuan, Feng Hu, Yupu Wang, Yan Key Laboratory of Computer Networks and Information Security Xidian University Xi'an China School of Science Xi'an University of Architecture and Technology Xi'an China

ISBN: (纸本)9780769542584

This paper investigates the security of the projected C*- cryptographic scheme, and presents a method to attack the scheme. The basic idea of the attack is to utilize the affine part of the private keys and the weakness caused by the structure of the private key to find a number of linear equations. The attack can recover the private keys efficiently when the parameters are q ≤ 23, n ≤ 10 and s=1. © 2010 IEEE.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

security Analysis of Projected C*- Scheme

Security Analysis of Projected C*- Scheme

引用

International Conference on Multimedia Information Networking and security (MINES)

作者： Feng Yuan Yupu Hu Yan Wang Key Laboratory of Computer Networks and Information Security Xidian University Xi'an China School of Science Xi'an University of Architecture and Technology Xi'an China

This paper investigates the security of the projected C* - cryptographic scheme, and presents a method to attack the scheme. The basic idea of the attack is to utilize the affine part of the private keys and the weakness caused by the structure of the private key to find a number of linear equations. The attack can recover the private keys efficiently when the parameters are q ≤ 2 3 , n≤10 and s=1.

关键词： Mathematical model Polynomials Public key cryptography Symmetric matrices

来源：评论

学校读者我要写书评

暂无评论

Improved meet-in-the-middle attacks on 7-round AES-192 and 8-round AES-256

引用

Tongxin Xuebao/Journal on Communications 2010年第9 A期31卷 197-201页

作者： Dong, Xiao-Li Hu, Yu-Pu Chen, Jie Li, Shun-Bo Yang, Yang Key Laboratory of Computer Networks and Information Security of Ministry of Education Xidian University Xi'an 710071 China State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences Beijing 100049 China School of Science Xi'an University of Architecture and Technology Xi'an 710055 China

A new variant of 5-round distinguisher of meet-in-the-middle attack on AES was constructed by exploiting the properties of the round transform of AES. Based on the variant of distinguisher, meet-in-the-middle attacks on 7-round AES-192 and 8-round AES-256 were presented by using the time-memory tradeoff approach. It is shown that the new results are better than the cryptanalytic results presented at FSE2008 on reduced AES in terms of the time complexity and the memory complexity.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Editorial: Dependability and security

引用

IEEE Transactions on Dependable and Secure Computing 2008年第1期5卷 1-3页

作者： Iyer, Ravishankar K. Gligor, Virgil D. Kalbarczyk, Zbigniew T. Kanoun, Karama Katzenbeisser, Stefan Mukherjee, Shubu Shieh, Shiuhpyng Zorian, Yervant Department of Electrical and Computer Engineering Carnegie Mellon University Microsoft's Trusted Computing Academic Advisory Board Center for Reliable and High-Performance Computing Coordinated Science Laboratory University of Illinois Urbana-Champaign United States IEEE IEEE Computer Society LAAS CNRS IFIP Working Group 10.4 on Dependable Computing and Fault Tolerance Special Interest Group on Dependability Benchmarking IFIP Working Group 10.4 French SEE Technical Committee on Trustworthy Computer Systems SEE Working Group Design and Validation for Dependability Technical University Munich Germany Darmstadt University of Technology ACM IACR Intel's SER Tech Council Intel's Architecture Patent Committee Taiwan Information Security Center NCTU IEEE Reliability Society Taipei and Tainan IACR United States Virage Logic Corp. AT and T Bell Laboratories Logic Vision Inc. University of British Columbia IEEE Test Technology Technical Council

来源：评论

学校读者我要写书评

暂无评论

Design and analysis of password-based key derivation functions

Design and analysis of password-based key derivation functio...

引用

RSA Conference 2005

作者： Yao, Frances F. Yin, Yiqun Lisa Department of Computer Science City University of Hong Kong Kowloon Hong Kong Princeton Architecture Laboratory for Multimedia and Security Princeton University Princeton NJ 08544 United States

A password-based key derivation function (KDF) - a function that derives cryptographic keys from a password - is necessary in many security applications. Like any password-based schemes, such KDFs are subject to key search attacks (often called dictionary attacks). Salt and iteration count are used in practice to significantly increase the workload of such attacks. These techniques have also been specified in widely adopted industry standards such as PKCS and IETF. Despite the importance and wide-spread usage, there has been no formal security analysis on existing constructions. In this paper, we propose a general security framework for password-based KDFs and introduce two security definitions each capturing a different attacking scenario. We study the most commonly used construction H(c)(p||s) and prove that the iteration count c, when fixed, does have an effect of stretching the password p by log2 c bits. We then analyze the two standardized KDFs in PKCS#5. We show that both are secure if the adversary cannot influence the parameters but subject to attacks otherwise. Finally, we propose a new password-based KDF that is provably secure even when the adversary has full control of the parameters. © Springer-Verlag Berlin Heidelberg 2005.

关键词： security of data

来源：评论

学校读者我要写书评

暂无评论

Failure handling in a reliable multicast protocol for improving buffer utilization and accommodating heterogeneous receivers

Failure handling in a reliable multicast protocol for improv...

引用

Pacific Rim International Symposium on Dependable Computing

作者： Gunjan Khanna Saurabh Bagchi J. Rogers Dependable Computing Systems Laboratory School of Electrical & Computer Engineering Purdue University West Lafayette IN USA Architecture Standards & Security EngineeringInformation Security Bank of America Corporation Charlotte NC USA

Reliable multicast protocols are an important class of protocols for reliably disseminating information from a sender to multiple receivers in the face of node and link failures. A tree-based reliable multicast protocol (TRAM) provides scalable reliable multicast by grouping receivers in hierarchical repair groups and using a selective acknowledgment mechanism. We present an improvement to TRAM to minimize the resource utilization at intermediate hosts and to localize the effect of slow or malicious receivers on normal receivers. We present an evaluation of TRAM and TRAM++ on a campus-wide WAN without errors and with message errors. The evaluation brings out that, given a constraint on the buffer availability at intermediate hosts, TRAM++ can tolerate the constraint at the expense of increasing the end-to-end latency for the normal receivers by only 3.2% compared to TRAM in error-free cases. When slow or faulty receivers are present, TRAM++ is able to provide the same uninterrupted quality of service to the normal nodes while localizing the effect of the faulty ones without incurring any additional memory overhead.

关键词： Multicast protocols Delay Resource management Wide area networks Information security Streaming media Measurement Buffer storage Reliability engineering computer architecture

来源：评论

学校读者我要写书评

暂无评论

computer-SYSTEM architecture CONCEPTS FOR FUTURE COMBAT SYSTEMS

引用

NAVAL ENGINEERS JOURNAL 1990年第3期102卷 43-62页

作者： ZITZMAN, LH FALATKO, SM PAPACH, JL Dr. Lewis H. Zitzman:is the group supervisor of the Advanced Systems Design Group Fleet Systems Department The Johns Hopkins University Applied Physics Laboratory (JHU/APL). He has been employed at JHU/APL since 1972 performing applied research in computer science and in investigating and applying advanced computer technologies to Navy shipboard systems. He is currently chairman of Aegis Computer Architecture Data Bus and Fiber Optics Working Group from which many concepts for this paper were generated. Dr. Zitzman received his B.S. degree in physics from Brigham Young University in 1963 and his M.S. and Ph.D. degrees in physics from the University of Illinois in 1967 and 1972 respectively. Stephen M. Falatko:was a senior engineering analyst in the Combat Systems Engineering Department Comptek Research Incorporated for the majority of this effort. He is currently employed at ManTech Services Corporation. During his eight-year career first at The Johns Hopkins University Applied Physics Laboratory and currently with ManTech Mr. Falatko's work has centered around the development of requirements and specifications for future Navy systems and the application of advanced technology to Navy command and control systems. He is a member of both the Computer Architecture Fiber Optics and Data Bus Working Group and the Aegis Fiber Optics Working Group. Mr. Falatko received his B.S. degree in aerospace engineering with high distinction from the University of Virginia in 1982 and his M.S. degree in applied physics from The Johns Hopkins University in 1985. Mr. Falatko is a member of Tau Beta Pi Sigma Gamma Tau the American Society of Naval Engineers and the U.S. Naval Institute. Janet L. Papach:is a section leader and senior engineering analyst in the Combat Systems Engineering Department Comptek Research Incorporated. She has ten years' experience as an analyst supporting NavSea Spa War and the U.S. Department of State. She currently participates in working group efforts under Aegis Combat System Doctrin

This paper sets forth computer systems architecture concepts for the combat system of the 2010–2030 timeframe that satisfy the needs of the next generation of surface combatants. It builds upon the current Aegis computer systems architecture, expanding that architecture while preserving, and adhering to, the Aegis fundamental principle of thorough systems engineering, dedicated to maintaining a well integrated, highly reliable, and easily operable combat system. The implementation of these proposed computer systems concepts in a coherent architecture would support the future battle force capable combat system and allow the expansion necessary to accommodate evolutionary changes in both the threat environment and the technology then available to effectively counter that threat. Changes to the current Aegis computer architecture must be carefully and effectively managed such that the fleet will retain its combat readiness capability at all times. This paper describes a possible transition approach for evolving the current Aegis computer architecture to a general architecture for the future. The proposed computer systems architecture concepts encompass the use of combinations of physically distributed, microprocessor-based computers, collocated with the equipment they support or embedded within the equipment itself. They draw heavily on widely used and available industry standards, including instruction set architectures (ISAs), backplane busses, microprocessors, computer programming languages and development environments, and local area networks (LANs). In this proposal, LANs, based on fiber optics, will provide the interconnection to support system expandability, redundancy, and higher data throughput rates. A system of cross connected LANs will support a high level of combat system integration, spanning the major warfare areas, and will facilitate the coordination and development of a coherent multi-warfare tactical picture supporting the future combatant command st

关键词： computer architecture

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：