Proceedings of the Third Workshop on Cryptography and Security in Computing Systems最新文献

筛选
英文 中文
AEGIS-Based Efficient Solution for Secure Reconfiguration of FPGAs 基于aegis的fpga安全重构高效解决方案
K. M. Abdellatif, R. Chotin-Avot, H. Mehrez
{"title":"AEGIS-Based Efficient Solution for Secure Reconfiguration of FPGAs","authors":"K. M. Abdellatif, R. Chotin-Avot, H. Mehrez","doi":"10.1145/2858930.2858937","DOIUrl":"https://doi.org/10.1145/2858930.2858937","url":null,"abstract":"The reconfiguration of FPGAs includes downloading the bit-stream file which contains the new design on the FPGA. The option to reconfigure FPGAs dynamically opens up the threat of stealing the Intellectual Property (IP) of the design. Since the configuration is usually stored in external memory, this can be easily tapped and read out by an eaves-dropper. This work presents a low cost solution in order to secure the reconfiguration of FPGAs. The proposed solution is based on an efficient-compact hardware implementation for AEGIS which is considered one of the candidates to the competition of CAESAR. The proposed architecture depends on using 1/4 AES-round for reducing the consumed area. We evaluated the presented design using 90 and 65 nm technologies. Our comparison to existing AES-based schemes reveals that the proposed design is better in terms of the hardware performance (Thr./mm2).","PeriodicalId":104042,"journal":{"name":"Proceedings of the Third Workshop on Cryptography and Security in Computing Systems","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123011161","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Body Biasing Injection Attacks in Practice 身体偏压注射攻击的实践
Noemie Beringuier-Boher, Marc Lacruche, David El-Baze, J. Dutertre, J. Rigaud, P. Maurine
{"title":"Body Biasing Injection Attacks in Practice","authors":"Noemie Beringuier-Boher, Marc Lacruche, David El-Baze, J. Dutertre, J. Rigaud, P. Maurine","doi":"10.1145/2858930.2858940","DOIUrl":"https://doi.org/10.1145/2858930.2858940","url":null,"abstract":"As security constraints are becoming more and more important, even for low-cost and low-power devices, new attacks and countermeasures are constantly proposed. Following this trend, Body Bias Injection (BBI) was introduced a few years ago. This new fault injection method consists in applying a high voltage pulse on the circuit substrate to induce faults. This paper presents an advanced evaluation bench allowing to perform BBI attacks with a good repeatability to evaluate the sensitivity of various circuits to this new threat. The moderate cost of this setup offers the opportunity for every electronic laboratory to use this new attack method and evaluate its effect on various devices. In addition, the physical effects of such attacks are described and a more accurate attack model is given.","PeriodicalId":104042,"journal":{"name":"Proceedings of the Third Workshop on Cryptography and Security in Computing Systems","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125916176","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 16
Mode-based Obfuscation using Control-Flow Modifications 使用控制流修改的基于模式的混淆
Sandhya Koteshwara, C. Kim, K. Parhi
{"title":"Mode-based Obfuscation using Control-Flow Modifications","authors":"Sandhya Koteshwara, C. Kim, K. Parhi","doi":"10.1145/2858930.2858934","DOIUrl":"https://doi.org/10.1145/2858930.2858934","url":null,"abstract":"Hardware security has emerged as an important topic in the wake of increasing threats on integrated circuits which include reverse engineering, intellectual property (IP) piracy and overbuilding. This paper explores obfuscation of circuits as a hardware security measure and specifically targets digital signal processing (DSP) circuits which are part of most modern systems. The idea of using desired and undesired modes to design obfuscated DSP functions is illustrated using the fast Fourier transform (FFT) as an example. The selection of a mode is dependent on a key input to the circuit. The system is said to work in its desired mode of operation only if the correct key is applied. Other undesired modes are built into the design to confuse an adversary. The approach to obfuscating the design involves control-flow modifications which alter the computations from the desired mode. We present simulation and synthesis results on a reconfigurable, 2-parallel FFT and discuss the security of this approach. It is shown that the proposed approach results in a reconfigurable and flexible design at an area overhead of 8% and a power overhead of 10%.","PeriodicalId":104042,"journal":{"name":"Proceedings of the Third Workshop on Cryptography and Security in Computing Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132196975","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
A Cautionary Note: Side-Channel Leakage Implications of Deterministic Signature Schemes 警告:确定性签名方案的侧信道泄漏影响
Hermann Seuschek, Johann Heyszl, F. D. Santis
{"title":"A Cautionary Note: Side-Channel Leakage Implications of Deterministic Signature Schemes","authors":"Hermann Seuschek, Johann Heyszl, F. D. Santis","doi":"10.1145/2858930.2858932","DOIUrl":"https://doi.org/10.1145/2858930.2858932","url":null,"abstract":"Two recent proposals by Bernstein and Pornin emphasize the use of deterministic signatures in DSA and its elliptic curve-based variants. Deterministic signatures derive the required ephemeral key value in a deterministic manner from the message to be signed and the secret key instead of using random number generators. The goal is to prevent severe security issues, such as the straight-forward secret key recovery from low quality random numbers. Recent developments have raised skepticism whether e.g. embedded or pervasive devices are able to generate randomness of sufficient quality. The main concerns stem from individual implementations lacking sufficient entropy source and standardized methods for random number generation with suspected back doors. While we support the goal of deterministic signatures, we are concerned about the fact that this has a significant influence on side-channel security of implementations. Specifically, attackers will be able to mount differential side-channel attacks on the additional use of the secret key in a cryptographic hash function to derive the deterministic ephemeral key. Previously, only a simple integer arithmetic function to generate the second signature parameter had to be protected, which is rather straight-forward. Hash functions are significantly more difficult to protect. In this contribution, we systematically explain how deterministic signatures introduce this new side-channel vulnerability.","PeriodicalId":104042,"journal":{"name":"Proceedings of the Third Workshop on Cryptography and Security in Computing Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124011168","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Differential Fault Attack on SIMECK SIMECK的差分故障攻击
Venu Nalla, R. Sahu, V. Saraswat
{"title":"Differential Fault Attack on SIMECK","authors":"Venu Nalla, R. Sahu, V. Saraswat","doi":"10.1145/2858930.2858939","DOIUrl":"https://doi.org/10.1145/2858930.2858939","url":null,"abstract":"In 2013, researchers from the National Security Agency of the USA (NSA) proposed two lightweight block ciphers SIMON and SPECK [3]. While SIMON is tuned for optimal performance in hardware, SPECK is tuned for optimal performance in software. At CHES 2015, Yang et al. [6] combined the \"good\" design components from both SIMON and SPECK and proposed a new lightweight block cipher SIMECK that is even more compact and efficient. In this paper we show that SIMECK is vulnerable to fault attacks and demonstrate two fault attacks on SIMECK. The first is a random bit-flip fault attack which recovers the n-bit last round key of Simeck using on average about n/2 faults and the second is a more practical, random byte fault attack which recovers the n-bit last round key of SIMECK using on average about n/6.5 faults.","PeriodicalId":104042,"journal":{"name":"Proceedings of the Third Workshop on Cryptography and Security in Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130466415","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
Practical Aspects of Quantization and Tamper-Sensitivity for Physically Obfuscated Keys 物理模糊键的量化和篡改敏感性的实用方面
Vincent Immler, Maxim Hennig, Ludwig Kurzinger, G. Sigl
{"title":"Practical Aspects of Quantization and Tamper-Sensitivity for Physically Obfuscated Keys","authors":"Vincent Immler, Maxim Hennig, Ludwig Kurzinger, G. Sigl","doi":"10.1145/2858930.2858933","DOIUrl":"https://doi.org/10.1145/2858930.2858933","url":null,"abstract":"This work deals with key generation based on Physically Obfuscated Keys (POKs), i.e., a certain type of tamper-evident Physical Unclonable Function (PUF) that can be used as protection against invasive physical attacks. To design a protected device, one must take attacks such as probing of data lines or penetration of the physical security boundary into consideration. For the implementation of a POK as a countermeasure, physical properties of a material -- which covers all parts to be protected -- are measured. After measuring these properties, i.e. analog values, they have to be quantized in order to derive a cryptographic key. This paper will present and discuss the impact of the quantization method with regard to three parameters: key quality, tamper-sensitivity, and reliability. Our contribution is the analysis of two different quantization schemes considering these parameters. Foremost, we propose a new approach to achieve improved tamper-sensitivity in the worst-case with no information leakage. We then analyze a previous solution and compare it to our scenario. Based on empirical data we demonstrate the advantages of our approach. This significantly improves the level of protection of a tamper-resistant cryptographic device compared to cases not benefiting from our scheme.","PeriodicalId":104042,"journal":{"name":"Proceedings of the Third Workshop on Cryptography and Security in Computing Systems","volume":"141 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130923867","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
Tag-Protector: An Effective and Dynamic Detection of Out-of-bound Memory Accesses 标签保护:一种有效的、动态的越界内存访问检测方法
A. Saeed, A. Ahmadinia, Mike Just
{"title":"Tag-Protector: An Effective and Dynamic Detection of Out-of-bound Memory Accesses","authors":"A. Saeed, A. Ahmadinia, Mike Just","doi":"10.1145/2858930.2858936","DOIUrl":"https://doi.org/10.1145/2858930.2858936","url":null,"abstract":"Programming languages permitting immediate memory accesses through pointers often result in applications having memory-related errors, which may lead to unpredictable failures and security vulnerabilities. A light-weight solution is presented in this paper to tackle such illegal memory accesses dynamically in C/C++ based applications. We propose a new and effective method of instrumenting an application's source code at compile time in order to detect out-of-bound memory accesses. It is based on creating tags, to be coupled with each memory allocation and then placing additional tag checking instructions for each access made to the memory. The proposed solution is evaluated by instrumenting applications from the BugBench benchmark suite and publicly available benchmark software, Runtime Intrusion Prevention Evaluator (RIPE), detecting all the bugs successfully. The performance and memory overhead is further analysed by instrumenting and executing real world applications.","PeriodicalId":104042,"journal":{"name":"Proceedings of the Third Workshop on Cryptography and Security in Computing Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130550632","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
A High Speed Scalar Multiplier for Binary Edwards Curves 二元Edwards曲线的高速标量乘法器
A. Fournaris, N. Sklavos, C. Koulamas
{"title":"A High Speed Scalar Multiplier for Binary Edwards Curves","authors":"A. Fournaris, N. Sklavos, C. Koulamas","doi":"10.1145/2858930.2858938","DOIUrl":"https://doi.org/10.1145/2858930.2858938","url":null,"abstract":"Binary Edwards Curves (BEC) constitute an exciting elliptic curve variation that has very interesting benefits when it comes to side channel attack resistance. However, BECs require more GF(2k) operations for a single scalar multiplication and this acts as a deterring factor for their wide adoption and standardization. In this paper, a high speed BEC scalar multiplication architecture and implementation is proposed based on a parallel design strategy of the GF(2k) operations that provides power analysis attack resistance against a variety of attacks.","PeriodicalId":104042,"journal":{"name":"Proceedings of the Third Workshop on Cryptography and Security in Computing Systems","volume":"35 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131850204","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
Efficient Algorithms and Architectures for Double Point Multiplication on Elliptic Curves 椭圆曲线上双点乘法的高效算法和结构
R. Azarderakhsh, Koray Karabina
{"title":"Efficient Algorithms and Architectures for Double Point Multiplication on Elliptic Curves","authors":"R. Azarderakhsh, Koray Karabina","doi":"10.1145/2858930.2858935","DOIUrl":"https://doi.org/10.1145/2858930.2858935","url":null,"abstract":"Efficient implementation of double point multiplication is crucial for elliptic curve cryptographic systems. We propose efficient algorithms and architectures for the computation of double point multiplication on binary elliptic curves and provide a comparative analysis of their performance for 112-bit security level. To the best of our knowledge, this is the first work in the literature which considers the design and implementation of simultaneous computation of double point multiplication. We first provide algorithmics for the three main double point multiplication methods. Then, we perform data-flow analysis and propose hardware architectures for the presented algorithms. Finally, we implement the proposed state-of-the-art architectures on FPGA platform for the comparison purposes and report the area and timing results. Our results indicate that differential addition chain based algorithms are better suited to compute double point multiplication over binary elliptic curves for high performance applications.","PeriodicalId":104042,"journal":{"name":"Proceedings of the Third Workshop on Cryptography and Security in Computing Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117146837","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Compilation of a Countermeasure Against Instruction-Skip Fault Attacks 针对指令跳码攻击的对策编写
Thierno Barry, Damien Couroussé, B. Robisson
{"title":"Compilation of a Countermeasure Against Instruction-Skip Fault Attacks","authors":"Thierno Barry, Damien Couroussé, B. Robisson","doi":"10.1145/2858930.2858931","DOIUrl":"https://doi.org/10.1145/2858930.2858931","url":null,"abstract":"Physical attacks especially fault attacks represent one the major threats against embedded systems. In the state of the art, software countermeasures against fault attacks are either applied at the source code level where it will very likely be removed at compilation time, or at assembly level where several transformations need to be performed on the assembly code and lead to significant overheads both in terms of code size and execution time. This paper presents the use of compiler techniques to efficiently automate the application of software countermeasures against instruction-skip fault attacks. We propose a modified LLVM compiler that considers our security objectives throughout the compilation process. Experimental results illustrate the effectiveness of this approach on AES implementations running on an ARM-based microcontroller in terms of security overhead compared to existing solutions.","PeriodicalId":104042,"journal":{"name":"Proceedings of the Third Workshop on Cryptography and Security in Computing Systems","volume":"53 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123713456","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 38
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信