2020 Third ISEA Conference on Security and Privacy (ISEA-ISAP)最新文献

筛选
英文 中文
Implementation of Minimally Shared Blockchains using Big Data Applications 使用大数据应用实现最小共享区块链
2020 Third ISEA Conference on Security and Privacy (ISEA-ISAP) Pub Date : 2020-02-01 DOI: 10.1109/ISEA-ISAP49340.2020.235000
Kausthav Pratim Kalita, Debojit Boro, D. Bhattacharyya
{"title":"Implementation of Minimally Shared Blockchains using Big Data Applications","authors":"Kausthav Pratim Kalita, Debojit Boro, D. Bhattacharyya","doi":"10.1109/ISEA-ISAP49340.2020.235000","DOIUrl":"https://doi.org/10.1109/ISEA-ISAP49340.2020.235000","url":null,"abstract":"Due to the scalability factor associated with a blockchain, it is inevitable that it will grow with time. Therefore, one of the primary concerns associated with a blockchain is its growing size as more blocks are introduced into the chain. When a full node or a mining node joins a blockchain network, it requires downloading all the existing information available in the distributed chain before it can add new blocks. Thus, as time progresses and more blocks are appended to the chain, a large amount of information needs to be replicated in its local machine. We introduce an approach to keep a minimally shared blockchain in the network which keeps the size of the distributed ledger limited and, thus, new miners can participate in the mining process at a faster pace.","PeriodicalId":235855,"journal":{"name":"2020 Third ISEA Conference on Security and Privacy (ISEA-ISAP)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122344494","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
Inter-Planetary File System Enabled Blockchain Solution For Securing Healthcare Records 用于保护医疗记录的启用星际文件系统的区块链解决方案
2020 Third ISEA Conference on Security and Privacy (ISEA-ISAP) Pub Date : 2020-02-01 DOI: 10.1109/ISEA-ISAP49340.2020.235016
Raghavendra K. Marangappanavar, K. M.
{"title":"Inter-Planetary File System Enabled Blockchain Solution For Securing Healthcare Records","authors":"Raghavendra K. Marangappanavar, K. M.","doi":"10.1109/ISEA-ISAP49340.2020.235016","DOIUrl":"https://doi.org/10.1109/ISEA-ISAP49340.2020.235016","url":null,"abstract":"The sharing of health-related data has become challenging in terms of data security which may lead to compromise patient’s privacy. Generally, once the report generated by the health provider is final, it will be uploaded to the hospital’s private repository. When it comes to the hospital as an organization, many participants [Doctor, Patient, Researcher, Insurance company] requires the report of patients for one or other reasons. Providing a single platform for all participants to share confidential data securely is a difficult and challenging task. Care should be taken such that the personal data of the patients should not be misused or tampered. Existing methods have been proved insufficient to effectively manage and secure health records. Blockchain technology, a recent research trend, has shown promising results for such secure data sharing. Since the contents of blockchain are tamper-proof, all participants can access the data but cannot change the data. By employing smart contracts and access control programs one can monitor data activity in the blockchain network. In this article, a blockchain architecture has been designed and discussed for secure and easy sharing of patient’s Personal Health Report(PHR) among the different players of health organization. Further, Inter-Planetary File System (IPFS) has also used in the proposed blockchain architecture for faster retrieval of PHR’s. We demonstrate the strengths of our proposed model, its user-centric focus and also the experimental results.","PeriodicalId":235855,"journal":{"name":"2020 Third ISEA Conference on Security and Privacy (ISEA-ISAP)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129749326","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}
引用次数: 12
Provisioning Privacy and Accountability in Participatory Sensing 参与式感知中的提供隐私和问责
2020 Third ISEA Conference on Security and Privacy (ISEA-ISAP) Pub Date : 2020-02-01 DOI: 10.1109/ISEA-ISAP49340.2020.235007
Tejendrakumar Thakur, N. Marchang
{"title":"Provisioning Privacy and Accountability in Participatory Sensing","authors":"Tejendrakumar Thakur, N. Marchang","doi":"10.1109/ISEA-ISAP49340.2020.235007","DOIUrl":"https://doi.org/10.1109/ISEA-ISAP49340.2020.235007","url":null,"abstract":"Mobile Crowd Sensing (MCS) is a cost-effective and innovative paradigm that exploits the power of the crowd by facilitating individuals with sensing and computing devices to collectively sense the physical world and share the sensed data. The goal is to extract information from the collected data to measure and map phenomena of common interest. For an MCS campaign to be successful, privacy of the participants should be preserved. At the same time, the platform should be able to fix responsibility when a dishonest participant behaves maliciously (for instance, shares falsified data). Hence, privacy and accountability are important issues which need to be provisioned in the MCS architecture. This work proposes an extension to an existing MCS architecture which takes care of both. Security analysis of the architecture is also presented.","PeriodicalId":235855,"journal":{"name":"2020 Third ISEA Conference on Security and Privacy (ISEA-ISAP)","volume":"165 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124333181","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}
引用次数: 0
DeDOP: Deduplication with cross-server Ownership over encrypted data DeDOP:对加密数据进行跨服务器所有权的重复数据删除
2020 Third ISEA Conference on Security and Privacy (ISEA-ISAP) Pub Date : 2020-02-01 DOI: 10.1109/ISEA-ISAP49340.2020.234998
Hardik Gajera, M. Das
{"title":"DeDOP: Deduplication with cross-server Ownership over encrypted data","authors":"Hardik Gajera, M. Das","doi":"10.1109/ISEA-ISAP49340.2020.234998","DOIUrl":"https://doi.org/10.1109/ISEA-ISAP49340.2020.234998","url":null,"abstract":"The data deduplication is a standard practice among cloud service providers. The deduplication process allows storage servers to utilize limited storage capacity efficiently. The deduplication process is challenging when the data are in encrypted form. There are various data deduplication schemes for encrypted data. However, they do not consider a cross-server ownership issue. In this paper, we present a data deduplication scheme, DeDOP, for encrypted data, which also solves cross-server ownership issues. The scheme can detect two almost the same file uploaded by two different users on different storage servers in the system. If the fraction of the data match in two files is more than a certain threshold, then we say files are almost the same. The scheme provides tag consistency, which allows the system to detect data faking attacks where an adversary tries to upload fake data under the different tags in the system.","PeriodicalId":235855,"journal":{"name":"2020 Third ISEA Conference on Security and Privacy (ISEA-ISAP)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128191877","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
On the DSA Key Recovery Attack with Variable Partial Nonces Known 已知可变部分随机数的DSA密钥恢复攻击
2020 Third ISEA Conference on Security and Privacy (ISEA-ISAP) Pub Date : 2020-02-01 DOI: 10.1109/ISEA-ISAP49340.2020.235008
Jiji Angel, Virendra Singh
{"title":"On the DSA Key Recovery Attack with Variable Partial Nonces Known","authors":"Jiji Angel, Virendra Singh","doi":"10.1109/ISEA-ISAP49340.2020.235008","DOIUrl":"https://doi.org/10.1109/ISEA-ISAP49340.2020.235008","url":null,"abstract":"The security of Digital Signature Algorithm is based on the proven hardness of the number theoretic problem of discrete logarithm. However, in practice, this public key based digital signature algorithm is prone to side channel based attacks. In this work, we consider the cryptanalysis of Digital Signature Algorithm, when partial information on ephemeral keys can be obtained. We present a variant of the existing lattice based cryptanalytic method for DSA and further extend our work by analysing the scenario when variable number of least significant bits per ephemeral keys are known for a set of signatures pertaining to a signatory.","PeriodicalId":235855,"journal":{"name":"2020 Third ISEA Conference on Security and Privacy (ISEA-ISAP)","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134271344","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}
引用次数: 0
Graph Convolutional Networks for Android Malware Detection with System Call Graphs 基于系统调用图的Android恶意软件检测图卷积网络
2020 Third ISEA Conference on Security and Privacy (ISEA-ISAP) Pub Date : 2020-02-01 DOI: 10.1109/ISEA-ISAP49340.2020.235015
Teenu S. John, Tony Thomas, S. Emmanuel
{"title":"Graph Convolutional Networks for Android Malware Detection with System Call Graphs","authors":"Teenu S. John, Tony Thomas, S. Emmanuel","doi":"10.1109/ISEA-ISAP49340.2020.235015","DOIUrl":"https://doi.org/10.1109/ISEA-ISAP49340.2020.235015","url":null,"abstract":"Nowadays, Android malwares have risen precipitously causing critical security threats. Malware authors now employ a variety of obfuscation techniques to evade their detection. Among various features, system calls are one of the major features used for detecting malwares. Although obfuscated malwares use diverse methods to conceal their malicious nature, the dependencies between the system calls can reveal their malicious nature. The existing malware detection models do not take into account of these structural dependencies and have large feature dimensions. Modelling the system calls as graphs can help in capturing the structural dependencies between the system calls. Recently, there has been an increasing interest in extending deep learning models such as Graph Convolutional Nets (GCN) for graph data. Motivated by this, we propose a novel Android malware detection mechanism using GCN which uses centrality measures of the graph as input features. To the best of our knowledge this is the first application of GCN for dynamic Android malware detection. We achieved a four dimensional feature representation for Android applications and a detection accuracy of 92.30 % on datasets with obfuscated malwares.","PeriodicalId":235855,"journal":{"name":"2020 Third ISEA Conference on Security and Privacy (ISEA-ISAP)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133305584","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}
引用次数: 30
2SPUF: Machine Learning Attack Resistant SRAM PUF 2SPUF:抗机器学习攻击的SRAM PUF
2020 Third ISEA Conference on Security and Privacy (ISEA-ISAP) Pub Date : 2020-02-01 DOI: 10.1109/ISEA-ISAP49340.2020.235013
V. Rai, S. Tripathy, J. Mathew
{"title":"2SPUF: Machine Learning Attack Resistant SRAM PUF","authors":"V. Rai, S. Tripathy, J. Mathew","doi":"10.1109/ISEA-ISAP49340.2020.235013","DOIUrl":"https://doi.org/10.1109/ISEA-ISAP49340.2020.235013","url":null,"abstract":"Internet of Things (IoT) has grown up as an essential aspect of the modern age because it provides comfort to human life by massive connectivity of devices with greater flexibility and control. Security components in IoT systems are very crucial because the devices within the IoT system are exposed to numerous malicious attacks. Typical security components in IoT system performs authentication, authorization, message, and content integrity check. Since IoT systems are resource constraints, it becomes a bit difficult to implement traditional security mechanisms and protocols. For example, authentication is implemented using crypto module, but it is infeasible in IoT domain due to the distributed nature of IoT systems. Physical Unclonable Function (PUF) is considered to be a unique identification of a device that can not be cloned. Hence, PUFs are beneficial in IoT domain to perform basic security operations like authentication, key generation etc. However, there are some attacks proposed on various PUFs using machine learning techniques that model the challenge-response behavior. In this paper, we propose a Two Round SRAM PUF (2SPUF), which shows better resistance to machine learning modeling attacks (ML-MA). We use some well-known machine learning techniques to test ML-MA resistance of 2SPUF design. The result shows that the proposed PUF architecture has better resistance to machine learning modeling attacks.","PeriodicalId":235855,"journal":{"name":"2020 Third ISEA Conference on Security and Privacy (ISEA-ISAP)","volume":"15 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133169938","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
ISEA-ISAP 2020 List Reviewer Page ISEA-ISAP 2020列表审查页面
2020 Third ISEA Conference on Security and Privacy (ISEA-ISAP) Pub Date : 2020-02-01 DOI: 10.1109/isea-isap49340.2020.9079303
{"title":"ISEA-ISAP 2020 List Reviewer Page","authors":"","doi":"10.1109/isea-isap49340.2020.9079303","DOIUrl":"https://doi.org/10.1109/isea-isap49340.2020.9079303","url":null,"abstract":"","PeriodicalId":235855,"journal":{"name":"2020 Third ISEA Conference on Security and Privacy (ISEA-ISAP)","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121850669","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}
引用次数: 0
A Parallel Quad Itoh-Tsujii Multiplicative Inversion Algorithm for FPGA Platforms 一种FPGA平台上的并行四倍Itoh-Tsujii乘法反演算法
2020 Third ISEA Conference on Security and Privacy (ISEA-ISAP) Pub Date : 2020-02-01 DOI: 10.1109/ISEA-ISAP49340.2020.234996
M. Kalaiarasi, V. R. Venkatasubramani, S. Rajaram
{"title":"A Parallel Quad Itoh-Tsujii Multiplicative Inversion Algorithm for FPGA Platforms","authors":"M. Kalaiarasi, V. R. Venkatasubramani, S. Rajaram","doi":"10.1109/ISEA-ISAP49340.2020.234996","DOIUrl":"https://doi.org/10.1109/ISEA-ISAP49340.2020.234996","url":null,"abstract":"Modular inversion in GF (2m) is one of the computationally intensive tasks in cryptographic applications like Elliptic Curve Cryptography (ECC). For hardware implementation over binary extended field, Itoh- Tsujii inversion Algorithm (ITA) using sequential multiplication and squaring is considered as the most efficient algorithm. In this paper, we propose a new parallel Quad ITA(QITA) over the National Institute of Standards and Technology (NIST) recommended trinomials to efficiently compute inverse operation on Field-Programmable Gate-Array (FPGA) platforms. Due to the implementation of novel short length addition chain and parallel Quadblock, area-time efficiency has been enhanced in this architecture. This modification allows the computation of inversion with reduced clock cycles comparatively. The experimental results reveal that the proposed parallel QITA algorithm improves the area-time performance as compared to other existing works.","PeriodicalId":235855,"journal":{"name":"2020 Third ISEA Conference on Security and Privacy (ISEA-ISAP)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127685506","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
An Approach Towards Resisting Side-Channel Attacks for Secured Testing of Advanced Encryption Algorithm (AES) Cryptochip 高级加密算法(AES)加密芯片安全测试中的抗侧信道攻击方法
2020 Third ISEA Conference on Security and Privacy (ISEA-ISAP) Pub Date : 2020-02-01 DOI: 10.1109/ISEA-ISAP49340.2020.235014
Nandi Kaushik, K. Lata
{"title":"An Approach Towards Resisting Side-Channel Attacks for Secured Testing of Advanced Encryption Algorithm (AES) Cryptochip","authors":"Nandi Kaushik, K. Lata","doi":"10.1109/ISEA-ISAP49340.2020.235014","DOIUrl":"https://doi.org/10.1109/ISEA-ISAP49340.2020.235014","url":null,"abstract":"Cryptography is used for securing sensitive information from unauthorized access. A cryptochip needs to be tested so as to ensure its functionality. Scan based testing is the most popular technique employed for testing purposes, however, such testing of the cryptochips can lead to the retrieval of the secret information stored inside them by exploiting the scan chain structure known as the scan based side channel attack. Thus, it becomes crucial to guarantee the security of the cryptochip while maintaining its testing capabilities. In this paper, we have proposed two schemes to securely test the AES cryptochip by inserting a certain number of XOR gates and a combination of XOR gates and NOT gates at random positions inside the scan chain structure of the AES crypto module. Our results show that, without affecting the testability of the AES cryptochip, our proposed schemes are successfully able to guard itself against scan based side channel attacks with minimal area overhead of just 0.02% and with the probability of finding the scan chain structure being 1/2128.","PeriodicalId":235855,"journal":{"name":"2020 Third ISEA Conference on Security and Privacy (ISEA-ISAP)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124820023","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
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学术文献互助群
群 号:604180095
Book学术官方微信