2016 11th Asia Joint Conference on Information Security (AsiaJCIS)最新文献_第2页

NFC-based Mobile Payment Protocol with User Anonymity 基于nfc的用户匿名移动支付协议

2016 11th Asia Joint Conference on Information Security (AsiaJCIS) Pub Date : 2016-08-01 DOI: 10.1109/AsiaJCIS.2016.30

Shan Chen, R. Tso

{"title":"NFC-based Mobile Payment Protocol with User Anonymity","authors":"Shan Chen, R. Tso","doi":"10.1109/AsiaJCIS.2016.30","DOIUrl":"https://doi.org/10.1109/AsiaJCIS.2016.30","url":null,"abstract":"Following the developments of wireless and mobile communication technologies, mobile-commerce (M-commerce) has become more and more popular. However, most of the existing M-commerce protocols do not consider the user anonymity during transactions. This means that it is possible to trace the identity of a payer from a M-commerce transaction. Luo et al. in 2014 proposed an NFC-based anonymous mobile payment protocol. It used an NFC-enabled smartphone and combined a built-in secure element (SE) as a trusted execution environment to build an anonymous mobile payment service. But their scheme has several problems and cannot be functional in practice. In this paper, we introduce a new NFC-based anonymous mobile payment protocol. Our scheme has the following features:(1) Anonymity. It prevents the disclosure of user's identity by using virtual identities instead of real identity during the transmission. (2) Efficiency. Confidentiality is achieved by symmetric key cryptography instead of public key cryptography so as to increase the performance. (3) Convenience. The protocol is based on NFC and is EMV compatible. (4) Security. All the transaction is either encrypted or signed by the sender so the confidentiality and authenticity are preserved.","PeriodicalId":213242,"journal":{"name":"2016 11th Asia Joint Conference on Information Security (AsiaJCIS)","volume":"258 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116417591","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

Securing Smart Meters Data for AMI Using RBAC 使用RBAC保护AMI智能电表数据

2016 11th Asia Joint Conference on Information Security (AsiaJCIS) Pub Date : 2016-08-01 DOI: 10.1109/AsiaJCIS.2016.16

E. Barka, Nedaa Al Hussien, K. Shuaib

引用次数: 1

Partial Server Side Parameter Selection in Private Information Retrieval 私有信息检索中的部分服务器端参数选择

2016 11th Asia Joint Conference on Information Security (AsiaJCIS) Pub Date : 2016-08-01 DOI: 10.1109/AsiaJCIS.2016.27

Thomas Vannet, N. Kunihiro

引用次数: 0

Design of arithmetic building blocks for cryptographic systems 密码系统的算术构建块设计

2016 11th Asia Joint Conference on Information Security (AsiaJCIS) Pub Date : 2016-08-01 DOI: 10.1109/ASIAJCIS.2016.15

M. Abd-El-Barr, Aisha Al-Noori

{"title":"Design of arithmetic building blocks for cryptographic systems","authors":"M. Abd-El-Barr, Aisha Al-Noori","doi":"10.1109/ASIAJCIS.2016.15","DOIUrl":"https://doi.org/10.1109/ASIAJCIS.2016.15","url":null,"abstract":"The Advanced Encryption Standard (AES) is the current world standard symmetric key block cipher cryptosystem for data encryption/decryption. Multi-valued logic (MVL) is a propositional calculus that goes beyond binary in terms of the number of truth values. There has been intensive research work conducted attempting to enhance the performance of cryptographic systems in terms of speed and area. We have previously presented the gate-level logic design of a number of Modulo-4 and Galois field (GF) arithmetic operations using both binary and MVL. In this paper, we follow up on our previous work by presenting the CMOS (Complementary Metal Oxide Semiconductor) design, implementation, and PSpice simulation of Modulo-4 and Galois field (GF) arithmetic operations using MVL. The design objective is to minimize the chip area (measured by the number of transistors in the CMOS circuit implementation). Also reported is the transient analysis using the 0.18μm CMOS technology parameters. A comparison is conducted between our proposed CMOS implementation and those reported in the literature. The chip area (measured in terms of number of transistors) required for our implementation is less than those needed by the existing implementations.","PeriodicalId":213242,"journal":{"name":"2016 11th Asia Joint Conference on Information Security (AsiaJCIS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116743259","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}

引用次数: 1

Classifier Ensemble Design with Rotation Forest to Enhance Attack Detection of IDS in Wireless Network 基于旋转森林的分类器集成设计增强无线网络入侵检测

2016 11th Asia Joint Conference on Information Security (AsiaJCIS) Pub Date : 2016-08-01 DOI: 10.1109/AsiaJCIS.2016.13

Bayu Adhi Tama, K. Rhee

引用次数: 10

New Conditional Differential Cryptanalysis for NLFSR-based Stream Ciphers and Application to Grain v1 基于nlfsr的流密码的新条件差分密码分析及其在Grain v1中的应用

2016 11th Asia Joint Conference on Information Security (AsiaJCIS) Pub Date : 2016-08-01 DOI: 10.1109/AsiaJCIS.2016.26

Yuhei Watanabe, Yosuke Todo, M. Morii

{"title":"New Conditional Differential Cryptanalysis for NLFSR-based Stream Ciphers and Application to Grain v1","authors":"Yuhei Watanabe, Yosuke Todo, M. Morii","doi":"10.1109/AsiaJCIS.2016.26","DOIUrl":"https://doi.org/10.1109/AsiaJCIS.2016.26","url":null,"abstract":"Grain v1 is an NLFSR-based stream cipher designed by Hell, Johansson, and Meier in 2005. This algorithm was selected in the eSTREAM hardware profile. At Asiacrypt 2010, Knellwolf, Meier, and Naya-Plasencia showed a conditional differential cryptanalysis and applied it to Grain v1. They showed distinguishing and key-recovery attacks on Grain v1 with 104 rounds by using 235 chosen IVs. Sarkar then extended the distinguisher up to 106 rounds. Knellwolf et al. also showed a conditional differential cryptanalysis for the related-key setting, where they analyzed both forward and inverse key initializations. Since differences quickly spread to the whole of the state, this technique works in the related-key setting because the key is loaded directly into the state in the NLFSR-based stream ciphers. In this paper, we propose a new method to find conditional differential characteristics on NLFSR-based stream ciphers. Our method is similar to the previous one on the related-key setting, but we look for conditional differential characteristics so as to prevent differences from spreading to the key. Therefore, we can efficiently find characteristics without the related-key setting. On the other hand, since the found characteristic has many conditions, it generally works in the weak-key setting. We apply our technique to Grain v1. We show the conditional differential distinguisher on Grain v1 up to 114 rounds and have 240 weak keys. Our distinguisher can be executed in a practical time by using 232 chosen IVs. Moreover, we propose a key recovery attack. We distinguish the weak key from the randomly chosen key by using our distinguisher. After distinguishing the weak key, we obtain the 1-bit key from the condition on both key and IV.","PeriodicalId":213242,"journal":{"name":"2016 11th Asia Joint Conference on Information Security (AsiaJCIS)","volume":"898 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132273642","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}

引用次数: 10

({1,3},n) Hierarchical Secret Sharing Scheme Based on XOR Operations for a Small Number of Indispensable Participants ({1,3}，n)一种基于少量不可或缺参与者异或操作的分层秘密共享方案

2016 11th Asia Joint Conference on Information Security (AsiaJCIS) Pub Date : 2016-08-01 DOI: 10.1109/AsiaJCIS.2016.11

Koji Shima, H. Doi

{"title":"({1,3},n) Hierarchical Secret Sharing Scheme Based on XOR Operations for a Small Number of Indispensable Participants","authors":"Koji Shima, H. Doi","doi":"10.1109/AsiaJCIS.2016.11","DOIUrl":"https://doi.org/10.1109/AsiaJCIS.2016.11","url":null,"abstract":"Blakley and Shamir independently introduce the basic idea of a (k, n) threshold secret sharing scheme in 1979. Shamir also recognize the concept of a hierarchical scheme, and suggests accomplishing the scheme by giving the participants of the more capable levels a greater number of shares. Some of hierarchical secret sharing schemes are known in the way that the secret is shared among a group of participants that is partitioned into levels. We look at hierarchical secret sharing schemes in the purpose of the ease of deleting the secret after it is distributed, that is, the reliability of data deletion depends on the deletion of the shares of the indispensable participants, and focus on providing a fast method and practicality. In this paper, we introduce Fujii et al.'s XOR-based secret sharing scheme and Kurihara et al.'s XOR-based secret sharing scheme, and propose a perfect and ideal ({1,3},n) hierarchical secret sharing scheme based on Fujii et al.'s XOR-based secret sharing scheme for a small number of indispensable participants to place practicality. Our implementation system on a PC with Intel Celeron G1820 2.70GHz and 3.6GB RAM can recover the secret in the processing of around 7.0Gbps.","PeriodicalId":213242,"journal":{"name":"2016 11th Asia Joint Conference on Information Security (AsiaJCIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129848011","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

How to Design Practical Client Honeypots Based on Virtual Environment 如何基于虚拟环境设计实用的客户端蜜罐

2016 11th Asia Joint Conference on Information Security (AsiaJCIS) Pub Date : 2016-08-01 DOI: 10.1109/AsiaJCIS.2016.19

Jinhak Park, Jangwon Choi, Jungsuk Song

{"title":"How to Design Practical Client Honeypots Based on Virtual Environment","authors":"Jinhak Park, Jangwon Choi, Jungsuk Song","doi":"10.1109/AsiaJCIS.2016.19","DOIUrl":"https://doi.org/10.1109/AsiaJCIS.2016.19","url":null,"abstract":"Honeypot is known as the most famous and widely deployed tool for collecting malwares on the Internet. Conventional honeypots lure attackers into them by simulating vulnerable applications, programs and services, and are able to collect malwares by monitoring malicious activities of attackers. While client honeypots visit websites linked to URLs which are previously provided by users and collect malwares by analyzing the websites. Since attackers mainly use websites for spreading their well-crafted malwares or compromising their target systems, client honeypots have a remarkable attention for the purpose of collecting malwares effectively. However, most existing approaches focus on only collecting malwares by using open source client honeypots such as Capture-HPC, HoneyClient, HoneyMonkey, etc and analyzing them. In this paper, we present how to design practical client honeypots based on virtual environment. The proposed client honeypots are able to help users who want to develop their own client honeypots and deploy them. The experimental results show that the proposed client honeypots visited 2,276,733 URLs, identified 28,831 malicious URLs and succeeded in collecting 2,115 malwares.","PeriodicalId":213242,"journal":{"name":"2016 11th Asia Joint Conference on Information Security (AsiaJCIS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125734744","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}

引用次数: 3

Home Network Security: Modelling Power Consumption to Detect and Prevent Attacks on Homenet Routers 家庭网络安全:模拟功耗以检测和防止对家庭网络路由器的攻击

2016 11th Asia Joint Conference on Information Security (AsiaJCIS) Pub Date : 2016-08-01 DOI: 10.1109/AsiaJCIS.2016.10

B. Silverajan, Markku Vajaranta, Antti Kolehmainen

引用次数: 3

SDNort: A Software Defined Network Testing Framework Using Openflow SDNort:使用Openflow的软件定义网络测试框架

2016 11th Asia Joint Conference on Information Security (AsiaJCIS) Pub Date : 2016-08-01 DOI: 10.1109/AsiaJCIS.2016.12

Po-Wen Chi, Ming-Hung Wang, Chengtah Lin, Jing-Wei Guo, C. Lei, N. Huang

引用次数: 1