2014 Ninth Asia Joint Conference on Information Security最新文献_第2页

Detection of DDoS Backscatter Based on Traffic Features of Darknet TCP Packets 基于暗网TCP报文流量特征的DDoS反向散射检测

2014 Ninth Asia Joint Conference on Information Security Pub Date : 2014-09-01 DOI: 10.1109/AsiaJCIS.2014.23

Nobuaki Furutani, Tao Ban, J. Nakazato, Jumpei Shimamura, Jun Kitazono, S. Ozawa

引用次数: 17

Anonymous Credential Scheme Supporting Active Revocation 支持主动撤销的匿名凭证方案

2014 Ninth Asia Joint Conference on Information Security Pub Date : 2014-09-01 DOI: 10.1109/AsiaJCIS.2014.17

Chun-I Fan, Chien-Nan Wu, Jen-Chun Hsu, Yi-Fan Tseng, Wen-Tsuen Chen

{"title":"Anonymous Credential Scheme Supporting Active Revocation","authors":"Chun-I Fan, Chien-Nan Wu, Jen-Chun Hsu, Yi-Fan Tseng, Wen-Tsuen Chen","doi":"10.1109/AsiaJCIS.2014.17","DOIUrl":"https://doi.org/10.1109/AsiaJCIS.2014.17","url":null,"abstract":"With the rapid development of electronic commerce, digital credentials are used with increasing frequency. Today users employing digital credentials not only complete the identity authentication process and obtain service, but also attach importance to their anonymity with the concept of privacy protection that is being rapidly developed. For this reason, anonymous credential mechanisms are being increasingly studied. However, while anonymous credentials provide privacy protection for users, the question of how to manage the credentials is a problem for issuers and service providers. In recent years, many literatures have proposed that the revocation list is a challenge to effectively implement, while users and credential consumers receive the corresponding revocation list with massive computational costs. In this paper, we present an improved anonymous credential revocation mechanism in which we examine how users not only provide passive revocation management but must spend considerable time in computational terms. We distribute the permission of revocation to the issuer and the service provider. The revocation phase can be executed only if both issuer and service provider permit, so users are not afraid that the issuer or service provider will access their private information. In addition, the issuer and the service provider can also manage illegal users. Consequently, online service systems can be more widely used. Further, we add a mechanism of time-revocation, which sets a time limit on the revocability of the anonymous credentials. This capability enables the issuer to more effectively manage the revocation phase.","PeriodicalId":354543,"journal":{"name":"2014 Ninth Asia Joint Conference on Information Security","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134514692","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

METRO: Measurement of End-to-End Route Trust METRO:端到端路由信任度量

2014 Ninth Asia Joint Conference on Information Security Pub Date : 2014-09-01 DOI: 10.2197/ipsjjip.23.613

Nasato Goto, Akira Kanaoka, Masayuki Okada, E. Okamoto

引用次数: 0

Parity Detection for Some Three-Modulus Residue Number System 一类三模剩余数系统的奇偶检测

2014 Ninth Asia Joint Conference on Information Security Pub Date : 2014-09-01 DOI: 10.1109/AsiaJCIS.2014.13

D. Guan, Yu-Shan Cheng

引用次数: 3

Strongly Privacy-Preserving Communication Protocol for VANETs 面向vanet的强隐私保护通信协议

2014 Ninth Asia Joint Conference on Information Security Pub Date : 2014-09-01 DOI: 10.1109/AsiaJCIS.2014.24

Chun-I Fan, Wei Sun, Shih-Wei Huang, Wen-Shenq Juang, Jheng-Jia Huang

{"title":"Strongly Privacy-Preserving Communication Protocol for VANETs","authors":"Chun-I Fan, Wei Sun, Shih-Wei Huang, Wen-Shenq Juang, Jheng-Jia Huang","doi":"10.1109/AsiaJCIS.2014.24","DOIUrl":"https://doi.org/10.1109/AsiaJCIS.2014.24","url":null,"abstract":"Vehicular ad hoc networks (VANETs) are advanced instances of mobile ad hoc networks with the aim of enhancing the safety and efficiency of road traffic. The basic idea is to allow arbitrary vehicles to broadcast ad hoc messages (e.g. Traffic accident notifications) to other vehicles and remind drivers to change their routes immediately or slow down to avoid dangers. However, some concerns on security and privacy are also raised in this environment. Messages should be signed and verified before they are trusted while the real identities of vehicles should not be revealed to guarantee source privacy, but they must be still traceable when VANETs were abused (e.g. Sending a fake message). Many related works have been presented in the literature so far. They can be generally divided into two constructions, where one is based on pseudonymous authentication and the other is based on group signatures. However, both of the two constructions have some drawbacks. In a pseudonymous-authentication-based scheme, a large revocation list is usually transmitted among vehicles. A group-signature-based scheme needs a large amount of computations for revocation checking. Furthermore, most of the previous schemes cannot support privacy preservation between roadside units (RSUs) and vehicles. Consequently, in this paper, we come up with a provably secure and strong privacy preserving protocol based on the blind signature technique to guarantee privacy and fulfill other essential security requirements in the vehicular communication environment. Furthermore, compared with other similar works, we offer an efficient tracing mechanism to trace and revoke the vehicles which abused the VANETs. Finally, we provide security analysis to show that our proposed scheme is secure.","PeriodicalId":354543,"journal":{"name":"2014 Ninth Asia Joint Conference on Information Security","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125229723","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}

引用次数: 21

Parallel Modulus Operations in RSA Encryption by CPU/GPU Hybrid Computation 基于CPU/GPU混合计算的RSA加密并行模数运算

2014 Ninth Asia Joint Conference on Information Security Pub Date : 2014-09-01 DOI: 10.1109/AsiaJCIS.2014.25

Chu-Hsing Lin, Jung-Chun Liu, Cheng-Chieh Li, Po-Wei Chu

{"title":"Parallel Modulus Operations in RSA Encryption by CPU/GPU Hybrid Computation","authors":"Chu-Hsing Lin, Jung-Chun Liu, Cheng-Chieh Li, Po-Wei Chu","doi":"10.1109/AsiaJCIS.2014.25","DOIUrl":"https://doi.org/10.1109/AsiaJCIS.2014.25","url":null,"abstract":"This research mainly proposes a method to resolve the bottleneck of running RSA encryption algorithms on CPUs. The RSA encryption algorithm involves with the operation of large numbers. Accompanied by the enhancement of the hardware performance of computers, the RSA key length is increased for providing substantial security. To crack RSA encryption, methods based on factoring of large prime numbers are currently in use, in which GPU parallel techniques have been utilized to speed up factorization of prime numbers in recent years. However, most RSA encryptions are still performed on CPUs. To deal with the increasing speed of cracking through high speed GPU operations, the RSA key length continues to increase and so does the cost of RSA encryption. Presently many researches of RSA encryptions are based on the Montgomery algorithm, in which operations of modular multiplication are parallelized to enhance the performance, however, modulus operations are still performed on the single core CPU. In addition to use the Montgomery algorithm on CPUs to accelerate the RSA encryption algorithm, we also exploit the convolution property of the Fast Fourier Transform and the convergence of the Newton's method. As a result, cooperative heterogeneous computing for parallel processing on CPU/GPU hybrids is used to greatly enhance the encryption performance.","PeriodicalId":354543,"journal":{"name":"2014 Ninth Asia Joint Conference on Information Security","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126016131","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

Secret Sharing Scheme with Efficient Keyword Search for Cloud Storage 基于高效关键字搜索的云存储秘密共享方案

2014 Ninth Asia Joint Conference on Information Security Pub Date : 2014-09-01 DOI: 10.1109/AsiaJCIS.2014.33

Hiroaki Kikuchi, Kouichi Itoh, Mebae Ushida, Yuji Yamaoka, Takanori Oikawa

引用次数: 1

An Efficient Defense Scheme against SIP DoS Attack in SDN Using Cloud SFW 基于云SFW的SDN下SIP DoS攻击的有效防御方案

2014 Ninth Asia Joint Conference on Information Security Pub Date : 2014-09-01 DOI: 10.1109/AsiaJCIS.2014.12

Zengguang Liu, Xiaochun Yin, Hoonjae Lee

引用次数: 5

Overview on Privacy-Preserving Profile-Matching Mechanisms in Mobile Social Networks in Proximity (MSNP) 近距离移动社交网络(MSNP)中隐私保护配置文件匹配机制研究综述

2014 Ninth Asia Joint Conference on Information Security Pub Date : 2014-09-01 DOI: 10.1109/AsiaJCIS.2014.18

Yufeng Wang, Jing Xu

{"title":"Overview on Privacy-Preserving Profile-Matching Mechanisms in Mobile Social Networks in Proximity (MSNP)","authors":"Yufeng Wang, Jing Xu","doi":"10.1109/AsiaJCIS.2014.18","DOIUrl":"https://doi.org/10.1109/AsiaJCIS.2014.18","url":null,"abstract":"Recently, mobile social networking in proximity (MSNP) has gained tremendous attentions, which refers to the social interactions among physically proximate mobile users directly through the Bluetooth/WiFi interfaces on their Smartphones or other mobile devices. MSNP applications can provide users more opportunities to discover and make new social interactions within proximity area, e.g., Airports, bars or other social spots. However, users enjoy these conveniences at the cost of their growing privacy concerns. Usually, MSNP application consists of three phases. First, two users need discover each other in the neighbor-discovery phase, Second, they need compare their personal profiles in the matching phase, usually called private matching, Last, two matching users enter the interaction phase for real information exchange. In this paper, we concentrate on the privacy mechanisms in the first and second phases. In detail, two primary approaches to solving the privacy-preserving profile-based friend matching problem, are categorized and compared, including private set intersection (PSI) and vector dot product to measures the social proximity, and then, two typical schemes from those approaches are discussed respectively. Our primary goal is to summarize and analyze characteristics, challenges and future directions of the privacy-preserving profile-matching schemes in MSNP.","PeriodicalId":354543,"journal":{"name":"2014 Ninth Asia Joint Conference on Information Security","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125071253","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}

引用次数: 11

Detecting Advertisement Module Network Behavior with Graph Modeling 基于图建模的广告模块网络行为检测

2014 Ninth Asia Joint Conference on Information Security Pub Date : 2014-09-01 DOI: 10.1109/AsiaJCIS.2014.26

Hiroki Kuzuno, Kenichi Magata

{"title":"Detecting Advertisement Module Network Behavior with Graph Modeling","authors":"Hiroki Kuzuno, Kenichi Magata","doi":"10.1109/AsiaJCIS.2014.26","DOIUrl":"https://doi.org/10.1109/AsiaJCIS.2014.26","url":null,"abstract":"Android applications are widely used and many are 'free' applications which include advertisement (ad) modules that provide ad services and track user behavior statistics. However, these ad modules often collect users' personal information and device identification numbers along with usage statistics, which is a violation of privacy. In our analysis of 1,188 Android applications' network traffic, we identified 797 applications that included 45 previously known ad modules. We analyzed these ad modules' network behavior, and found that they have characteristic network traffic patterns for acquiring ad content, specifically images. In order to accurately differentiate between ad modules' network traffic and valid application network traffic, we propose a novel method based on the distance between network traffic graphs mapping the relationships between HTTP session data (such as HTML or Java Script). This distance describes the similarity between the sessions. Using this method, we can detect ad modules' traffic by comparing session graphs with the graphs of already known ad modules. In our evaluation, we generated 20,903 graphs of applications. We separated the application graphs into those generated by known ad modules (4,698 graphs), those we manually identified as ad modules (2,000 graphs), and standard application traffic. We then applied 1,000 graphs of known ad graphs to the other graph sets (the remaining 3,698 known ad graphs and the 2,000 manually classified ad graphs) to see how accurately they could be used to identify ad graphs. Our approach showed a 76% detection rate for known ad graphs, and a 96% detection rate for manually classified ad graphs.","PeriodicalId":354543,"journal":{"name":"2014 Ninth Asia Joint Conference on Information Security","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117150431","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