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

筛选
英文 中文
Observing Hidden Service Directory Spying with a Private Hidden Service Honeynet 观察隐藏服务目录间谍与私有隐藏服务蜜网
2016 11th Asia Joint Conference on Information Security (AsiaJCIS) Pub Date : 2016-08-01 DOI: 10.1109/AsiaJCIS.2016.31
Juha Nurmi, Joona Kannisto, Markku Vajaranta
{"title":"Observing Hidden Service Directory Spying with a Private Hidden Service Honeynet","authors":"Juha Nurmi, Joona Kannisto, Markku Vajaranta","doi":"10.1109/AsiaJCIS.2016.31","DOIUrl":"https://doi.org/10.1109/AsiaJCIS.2016.31","url":null,"abstract":"Tor's location hidden services (HS) are a tool for anonymous publishing, with the feature that the sites cannot be brought down without taking down the whole Tor network. People run HSs for a multitude of reasons. Some like them to be public, but others want to keep them their existence as private. We have run private unannounced HSs to detect whether the HS directory is spied on. Our results show that the hidden service directory is monitored for new addresses. This paper details the observations made from the scanning activity.","PeriodicalId":213242,"journal":{"name":"2016 11th Asia Joint Conference on Information Security (AsiaJCIS)","volume":"78 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":"123127564","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
Evaluation of a Brute Forcing Tool that Extracts the RAT from a Malicious Document File 一种从恶意文档文件中提取RAT的暴力强制工具的评估
2016 11th Asia Joint Conference on Information Security (AsiaJCIS) Pub Date : 2016-08-01 DOI: 10.1109/AsiaJCIS.2016.17
M. Mimura, Yuhei Otsubo, Hidehiko Tanaka
{"title":"Evaluation of a Brute Forcing Tool that Extracts the RAT from a Malicious Document File","authors":"M. Mimura, Yuhei Otsubo, Hidehiko Tanaka","doi":"10.1109/AsiaJCIS.2016.17","DOIUrl":"https://doi.org/10.1109/AsiaJCIS.2016.17","url":null,"abstract":"APT(Advanced Persistent Threat) attacks that cause unauthorized transfer of sensitive information from the targeted organization are serious threats. The attackers in APT attacks use RAT(Remote Access Trojan or Remote Administration Tool)s to take the control of the victim's computer. The attackers in APT attacks occasionally use malicious document files to camouflage themselves. If a RAT is embedded into a malicious document file, it is more difficult to detect and analyze the function. Analyzing malicious document files attached to spear phishing e-mails requires extracting the RAT. However, if we do not know the condition where the exploit code runs normally, it is difficult to extract the RAT by dynamic analysis. Therefore, we developed a brute forcing tool which decodes obfuscation and extracts the RAT from a malicious document file. This tool was developed based on the malicious document files which were used between 2009 and 2012 in APT attacks, and indicated how to embed a RAT in a malicious document file. However, whether our method can extract or detect recent RATs in APT attacks or not is uncertain. In this paper, we investigate recent malicious document files which were used between 2013 and 2015 in APT attacks, and reveal the recent trend of the encoding methods with this tool. Moreover, we compare the success rates with the other detection methods such as antivirus programs with the latest virus definitions. Even if a malicious document file which contains executable files does not perform malicious activities in dynamic analysis, this tool extracts the executable files automatically without executing the malicious document file. In addition, this tool hardly give false positives. We can use this tool to detect unknown malicious document files in dynamic analysis or at mail gateways.","PeriodicalId":213242,"journal":{"name":"2016 11th Asia Joint Conference on Information Security (AsiaJCIS)","volume":"24 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":"123598390","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
Efficient Privacy-Preserving Logistic Regression with Iteratively Re-weighted Least Squares 基于迭代重加权最小二乘的高效隐私保护逻辑回归
2016 11th Asia Joint Conference on Information Security (AsiaJCIS) Pub Date : 2016-08-01 DOI: 10.1109/AsiaJCIS.2016.21
Hiroaki Kikuchi, H. Yasunaga, H. Matsui, Chun-I Fan
{"title":"Efficient Privacy-Preserving Logistic Regression with Iteratively Re-weighted Least Squares","authors":"Hiroaki Kikuchi, H. Yasunaga, H. Matsui, Chun-I Fan","doi":"10.1109/AsiaJCIS.2016.21","DOIUrl":"https://doi.org/10.1109/AsiaJCIS.2016.21","url":null,"abstract":"In this paper, we propose a new secure protocols for privacy-preserving logistic regression of two vertically partitioned datasets. Our protocol is efficient in the sense that coefficients of logistic model are converged in few iterations by using the Iteratively Re-weighted Least Squares (IRLS). In the comparison to one of the existing work using the stochastic gradient descent (SGD), our protocol improved the performance of estimate from 30,000 to 7 iterations. We study the feasibility of the proposed protocol over the the Diagnosis Procedure Combination (DPC) database, a large-scale claim-based database of Japanese hospitals that contains confidential status of patients. Our scheme allows to estimate the probability of death with some patient information without revealing confidential data to the other party. Using the toy dataset and the trial implementation of the proposed scheme, we examine the accuracy of the proposed scheme and study the feasibility.","PeriodicalId":213242,"journal":{"name":"2016 11th Asia Joint Conference on Information Security (AsiaJCIS)","volume":"18 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":"128566891","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
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学术官方微信