Pub Date : 2021-01-30DOI: 10.1109/DSC49826.2021.9346275
Zhixin Zhao, Lu Zhou, Chunhua Su
The Lightning Network is a second layer payment protocol built on the Bitcoin network. Since the lightning network enables off-chain transactions, it improves the throughput of the Bitcoin platform and thus extends the scalability of the Bitcoin network. There have been many security, privacy and robustness problems occurred in the Lightning Network. Though there have been some works researched on these problems. It is still unclear what types of attack the Lightning network is facing and why these attacks occurred. In this work, We provide a systematic exposition of the Lightning network in terms of properties, security and privacy issues. We first present a detailed technical point of the Lightning Network to enable a more insightful analysis of Lightning Network's operating mechanism and find out the existing problems of the Lightning Network. Additionally, we analyze the security, privacy and robustness issues of the Lightning Network. Finally, we list the existing solutions and propose some possible solutions to the above mentioned issues.
{"title":"Systematic Research on Technology and Challenges of Lightning Network","authors":"Zhixin Zhao, Lu Zhou, Chunhua Su","doi":"10.1109/DSC49826.2021.9346275","DOIUrl":"https://doi.org/10.1109/DSC49826.2021.9346275","url":null,"abstract":"The Lightning Network is a second layer payment protocol built on the Bitcoin network. Since the lightning network enables off-chain transactions, it improves the throughput of the Bitcoin platform and thus extends the scalability of the Bitcoin network. There have been many security, privacy and robustness problems occurred in the Lightning Network. Though there have been some works researched on these problems. It is still unclear what types of attack the Lightning network is facing and why these attacks occurred. In this work, We provide a systematic exposition of the Lightning network in terms of properties, security and privacy issues. We first present a detailed technical point of the Lightning Network to enable a more insightful analysis of Lightning Network's operating mechanism and find out the existing problems of the Lightning Network. Additionally, we analyze the security, privacy and robustness issues of the Lightning Network. Finally, we list the existing solutions and propose some possible solutions to the above mentioned issues.","PeriodicalId":184504,"journal":{"name":"2021 IEEE Conference on Dependable and Secure Computing (DSC)","volume":"231 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125532423","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}
Pub Date : 2021-01-30DOI: 10.1109/DSC49826.2021.9346242
Po-Chu Hsu, A. Miyaji
A. $mathrm{M}+1$ st-price auction is an auction method in which all bidders submit their bids simultaneously, and the $M$ highest bidders purchase $M$ identical goods at the $M+$ 1st bidding price. Previous researches use trusted third party (TTP), trusted mix server, and honest managers. We propose an efficient and secure auction protocol that guarantees financial fairness, robustness and correctness without any manager or TTP and is secure under malicious model for the first time. We also proposed a new mechanism to verify bids. This new mechanism can be used in all auction protocols which is based on encrypted bits.
A. $mathrm{M}+1$ st-price auction是一种所有竞标者同时出价的拍卖方式，出价最高的竞标者以$M+$ 1的出价购买$M$相同的商品。以往的研究主要采用可信第三方(TTP)、可信混合服务器和诚实管理者。我们首次提出了一种高效、安全的拍卖协议，该协议在没有任何管理器和http的情况下保证了财务的公平性、鲁棒性和正确性，并且在恶意模型下是安全的。我们还提出了一个核实投标的新机制。这种新机制可用于所有基于加密比特的拍卖协议。
{"title":"Verifiable M+lst-Price Auction without Manager","authors":"Po-Chu Hsu, A. Miyaji","doi":"10.1109/DSC49826.2021.9346242","DOIUrl":"https://doi.org/10.1109/DSC49826.2021.9346242","url":null,"abstract":"A. $mathrm{M}+1$ st-price auction is an auction method in which all bidders submit their bids simultaneously, and the $M$ highest bidders purchase $M$ identical goods at the $M+$ 1st bidding price. Previous researches use trusted third party (TTP), trusted mix server, and honest managers. We propose an efficient and secure auction protocol that guarantees financial fairness, robustness and correctness without any manager or TTP and is secure under malicious model for the first time. We also proposed a new mechanism to verify bids. This new mechanism can be used in all auction protocols which is based on encrypted bits.","PeriodicalId":184504,"journal":{"name":"2021 IEEE Conference on Dependable and Secure Computing (DSC)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125080267","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}
Pub Date : 2021-01-30DOI: 10.1109/DSC49826.2021.9346254
Dong Zhang, Qing Fan, H. Qiao, Min Luo
The smart grid is viewed as the next generation power system due to its reliability, resiliency, sustainability and energy efficiency. The smart grid technology has aroused widespread attention in communities of academia and industry over the years. Rapid development of smart grid enables more data to be collected and power to be efficiently distributed in real-time. With the increasing of power data, conventional smart grid cannnot satisfy the growing storage and data management demand. Cloud computing exactly handles these issues and is integrated with smart grid perfectly for more efficient operation of system. However, cloud-based smart grid system is vulnerable for various security flaws. Data confidentiality is one indispensable method of protecting users' privacy. Public-key Encryption with Multi-keyword Search (PEMKS) realizes the cloud server search encrypted files with users' multi-keyword trapdoor without revealing any information of retrival contents. In this paper, we propose a PEMKS scheme and apply it to cloud-based smart grid. Moreover, the proposed scheme is proved to be SS-sCKA secure and meets security requirements. Performance analysis indicates that the proposed scheme has better time complexity and lower storage cost compared with two recent PEMKS schemes.
{"title":"A Public-key Encryption with Multi-keyword Search Scheme for Cloud-based Smart Grids","authors":"Dong Zhang, Qing Fan, H. Qiao, Min Luo","doi":"10.1109/DSC49826.2021.9346254","DOIUrl":"https://doi.org/10.1109/DSC49826.2021.9346254","url":null,"abstract":"The smart grid is viewed as the next generation power system due to its reliability, resiliency, sustainability and energy efficiency. The smart grid technology has aroused widespread attention in communities of academia and industry over the years. Rapid development of smart grid enables more data to be collected and power to be efficiently distributed in real-time. With the increasing of power data, conventional smart grid cannnot satisfy the growing storage and data management demand. Cloud computing exactly handles these issues and is integrated with smart grid perfectly for more efficient operation of system. However, cloud-based smart grid system is vulnerable for various security flaws. Data confidentiality is one indispensable method of protecting users' privacy. Public-key Encryption with Multi-keyword Search (PEMKS) realizes the cloud server search encrypted files with users' multi-keyword trapdoor without revealing any information of retrival contents. In this paper, we propose a PEMKS scheme and apply it to cloud-based smart grid. Moreover, the proposed scheme is proved to be SS-sCKA secure and meets security requirements. Performance analysis indicates that the proposed scheme has better time complexity and lower storage cost compared with two recent PEMKS schemes.","PeriodicalId":184504,"journal":{"name":"2021 IEEE Conference on Dependable and Secure Computing (DSC)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131559452","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}
Pub Date : 2021-01-30DOI: 10.1109/DSC49826.2021.9346232
Wenjuan Li, W. Meng, Javier Parra-Arnau, K. Choo
With cyber-attacks becoming more complicated and the networks increasingly interconnected, there has been a move towards using collaborative intrusion detection networks (CIDNs) to identify cyber-threats more effectively. However, insider attacks may remain challenging to mitigate in CIDNs, as the intruders are able to control one or more internal nodes. Challenge- based trust mechanism is one promising solution to help safeguard CIDNs against common insider attacks, but not necessarily against advanced attacks such as passive message fingerprint attacks. In this work, we focus on challenge-based trust mechanism and advocate that considering additional level of trust can enhance the robustness of CIDNs. Specifically, we design an enhanced trust management scheme by checking spatial correlation among nodes' behavior, regarding forwarding delay, packet dropping and sending rate. Then, we evaluate our approach in a simulated environment, as well as a realworld environment in collaboration with an IT organization. Experimental results demonstrate that our approach can help enhance the robustness of challenge-based trust mechanism by detecting malicious nodes faster than similar approaches (i.e., reducing time consumption by two to three days).
{"title":"Enhancing Challenge-based Collaborative Intrusion Detection Against Insider Attacks using Spatial Correlation","authors":"Wenjuan Li, W. Meng, Javier Parra-Arnau, K. Choo","doi":"10.1109/DSC49826.2021.9346232","DOIUrl":"https://doi.org/10.1109/DSC49826.2021.9346232","url":null,"abstract":"With cyber-attacks becoming more complicated and the networks increasingly interconnected, there has been a move towards using collaborative intrusion detection networks (CIDNs) to identify cyber-threats more effectively. However, insider attacks may remain challenging to mitigate in CIDNs, as the intruders are able to control one or more internal nodes. Challenge- based trust mechanism is one promising solution to help safeguard CIDNs against common insider attacks, but not necessarily against advanced attacks such as passive message fingerprint attacks. In this work, we focus on challenge-based trust mechanism and advocate that considering additional level of trust can enhance the robustness of CIDNs. Specifically, we design an enhanced trust management scheme by checking spatial correlation among nodes' behavior, regarding forwarding delay, packet dropping and sending rate. Then, we evaluate our approach in a simulated environment, as well as a realworld environment in collaboration with an IT organization. Experimental results demonstrate that our approach can help enhance the robustness of challenge-based trust mechanism by detecting malicious nodes faster than similar approaches (i.e., reducing time consumption by two to three days).","PeriodicalId":184504,"journal":{"name":"2021 IEEE Conference on Dependable and Secure Computing (DSC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115874104","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}
Pub Date : 2021-01-30DOI: 10.1109/DSC49826.2021.9346259
Ting-Le Zhu, Tzungher Chen
Traditional healthcare systems store and process personal healthcare record (PHR) in the centralized client-server architecture. PHR stored in a healthcare institution remain in depository which is not easily shared with other institutions due to technical and infrastructure related restrictions. In such a way, if a patient has to visit distinct institutions/hospitals or physicians, there is no effective and privacy-preserving data sharing mechanism. Furthermore, even if patients' privacy is protected by Health Insurance Portability and Accountability Act (HIPAA), it is still doubtful owing to the lack of the consideration of if the patient is directly involved. With the recent bloom of interest around blockchain, a technology with well-defined decentralized framework, privacy-preserving in healthcare information system (HIS) should be revisited to examine the new possibility. Actually, in the literature, the blockchain-based researches about the privacy and security in healthcare are prevalent in decentralized platform. However, they have drawn attention on the personal healthcare record management rather than focus on how to distribute the encryption/decryption key used to guarantee the confidentiality of PHR. Blockchain provides a shared, immutable and transparent history of all the transactions to build systems with trusty and decentralized environment. This provides an opportunity to develop a secure and trusty PHR data management system by blockchain technology. This paper presents the solution aiming at the patient's control by holding the knowledge of the encryption/decryption key which can be deduced from the previous transaction in blockchains. In such a way, a patient can control the personal healthcare record by controlling key usage.
{"title":"A Patient-Centric Key Management Protocol for Healthcare Information System based on Blockchain","authors":"Ting-Le Zhu, Tzungher Chen","doi":"10.1109/DSC49826.2021.9346259","DOIUrl":"https://doi.org/10.1109/DSC49826.2021.9346259","url":null,"abstract":"Traditional healthcare systems store and process personal healthcare record (PHR) in the centralized client-server architecture. PHR stored in a healthcare institution remain in depository which is not easily shared with other institutions due to technical and infrastructure related restrictions. In such a way, if a patient has to visit distinct institutions/hospitals or physicians, there is no effective and privacy-preserving data sharing mechanism. Furthermore, even if patients' privacy is protected by Health Insurance Portability and Accountability Act (HIPAA), it is still doubtful owing to the lack of the consideration of if the patient is directly involved. With the recent bloom of interest around blockchain, a technology with well-defined decentralized framework, privacy-preserving in healthcare information system (HIS) should be revisited to examine the new possibility. Actually, in the literature, the blockchain-based researches about the privacy and security in healthcare are prevalent in decentralized platform. However, they have drawn attention on the personal healthcare record management rather than focus on how to distribute the encryption/decryption key used to guarantee the confidentiality of PHR. Blockchain provides a shared, immutable and transparent history of all the transactions to build systems with trusty and decentralized environment. This provides an opportunity to develop a secure and trusty PHR data management system by blockchain technology. This paper presents the solution aiming at the patient's control by holding the knowledge of the encryption/decryption key which can be deduced from the previous transaction in blockchains. In such a way, a patient can control the personal healthcare record by controlling key usage.","PeriodicalId":184504,"journal":{"name":"2021 IEEE Conference on Dependable and Secure Computing (DSC)","volume":"07 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127289273","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}
Pub Date : 2021-01-30DOI: 10.1109/DSC49826.2021.9346276
Jing Xu, F. Xu, Fanshu Ma, Lei Zhou, Shuanglin Jiang, Zhibo Rao
Personal web-surfing habits of individual users vary drastically. Thus, the selection and frequency of requested URLs can be viewed as an individual finger-print allowing to identify a user, which has many security and target marketing applications. In this paper, to model web usage, we derive web usage profiles for each user and employ instance-based classification methods to predict the most likely user in the monitored network. Thus, the proposed methods are scalable for large numbers of users. In our experimental evaluation, the accuracy of user identification is verified.
{"title":"Mining Web Usage Profiles from Proxy Logs: User Identification","authors":"Jing Xu, F. Xu, Fanshu Ma, Lei Zhou, Shuanglin Jiang, Zhibo Rao","doi":"10.1109/DSC49826.2021.9346276","DOIUrl":"https://doi.org/10.1109/DSC49826.2021.9346276","url":null,"abstract":"Personal web-surfing habits of individual users vary drastically. Thus, the selection and frequency of requested URLs can be viewed as an individual finger-print allowing to identify a user, which has many security and target marketing applications. In this paper, to model web usage, we derive web usage profiles for each user and employ instance-based classification methods to predict the most likely user in the monitored network. Thus, the proposed methods are scalable for large numbers of users. In our experimental evaluation, the accuracy of user identification is verified.","PeriodicalId":184504,"journal":{"name":"2021 IEEE Conference on Dependable and Secure Computing (DSC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126432024","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}
Pub Date : 2021-01-30DOI: 10.1109/DSC49826.2021.9346250
Ruei-Hau Hsu, Hsiang-Shian Fan, Lu-Chin Wang
The fifth generation (5G) mobile networks provide intensive and low-latency communications, which are applicable to an emerging data sharing/exchange technology called Device-to-device (D2D) communication. For a safety D2D communication, is essential to ensure the legitimacy of devices and the secrecy of communications before it practiced. However, the basic security specification can only support secure one-to-one or one-to-many D2D communications with the assistance of security-related components,i.e., access and mobility management function (AMF), authentication server function (AuSF), and unified data management (UDM), in the 5G core network. It results that 5G core networks always have to handled the discovery of mobile devices. Since the components related to user authentication are involved, the device discovery procedures result in no privacy for users. To overcome the above issues, this work proposes a secure attribute-based access control mechanism to support secure device discovery with fine-grained access control based on edge computing model for D2D communications in 5G, called SGD2. SGD2 guarantees the privacy of D2D communications against the infrastructures of 5G mobile networks. Additionally, this work provides security analysis and empirical performance evaluation for the security and feasibility. To sum up, the proposed SGD2 is the practice of D2D communications with the features of fine-grained access control and privacy against mobile network operators in 5G for the applications of IoT.
{"title":"SGD2: Secure Group-based Device-to-Device Communications with Fine-grained Access Control for IoT in 5G","authors":"Ruei-Hau Hsu, Hsiang-Shian Fan, Lu-Chin Wang","doi":"10.1109/DSC49826.2021.9346250","DOIUrl":"https://doi.org/10.1109/DSC49826.2021.9346250","url":null,"abstract":"The fifth generation (5G) mobile networks provide intensive and low-latency communications, which are applicable to an emerging data sharing/exchange technology called Device-to-device (D2D) communication. For a safety D2D communication, is essential to ensure the legitimacy of devices and the secrecy of communications before it practiced. However, the basic security specification can only support secure one-to-one or one-to-many D2D communications with the assistance of security-related components,i.e., access and mobility management function (AMF), authentication server function (AuSF), and unified data management (UDM), in the 5G core network. It results that 5G core networks always have to handled the discovery of mobile devices. Since the components related to user authentication are involved, the device discovery procedures result in no privacy for users. To overcome the above issues, this work proposes a secure attribute-based access control mechanism to support secure device discovery with fine-grained access control based on edge computing model for D2D communications in 5G, called SGD2. SGD2 guarantees the privacy of D2D communications against the infrastructures of 5G mobile networks. Additionally, this work provides security analysis and empirical performance evaluation for the security and feasibility. To sum up, the proposed SGD2 is the practice of D2D communications with the features of fine-grained access control and privacy against mobile network operators in 5G for the applications of IoT.","PeriodicalId":184504,"journal":{"name":"2021 IEEE Conference on Dependable and Secure Computing (DSC)","volume":"57 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131922771","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}
Pub Date : 2021-01-30DOI: 10.1109/DSC49826.2021.9346268
Yang Zhao, Guohang Dan, Ankang Ruan, Jicheng Huang, H. Xiong
The vehicular sensor network has been developed to improve traffic, enhance the driving experience and so on, and is an inevitable technology trend. In vehicular sensor network, large amounts of data generated by vehicles need to be transmitted in the open channel, so it is important to ensure the integrity of information and vehicular privacy. For such a harsh condition, the aggregate signature technology is a very suitable solution, because it not only provides message integrity and authentication, but is also well suited to resource-constrained environments. Thus, in this paper, for vehicular sensor networks, we construct a certificateless and fault-tolerant aggregate signature (CLFTAS) scheme based on the elliptic curve cryptosystem. The certificateless nature makes our scheme free from the certificate management issue in traditional public key cryptography and the key escrow issue in identity-based cryptography. Fault tolerance greatly makes up for the aggregate signature's defect that adding an invalid individual signature to a valid aggregate invalidates the entire aggregation. Moreover, our scheme can protect the privacy of the vehicle’ identity. In the end, we give the security proof and performance evaluation. In the random oracle model, our scheme is secure under the assumption that solving the elliptic curve discrete logarithm problem is hard, and has great performance optimization and functionality compared with the state-of-the-art.
{"title":"A Certificateless and Privacy-Preserving Authentication with Fault-Tolerance for Vehicular Sensor Networks","authors":"Yang Zhao, Guohang Dan, Ankang Ruan, Jicheng Huang, H. Xiong","doi":"10.1109/DSC49826.2021.9346268","DOIUrl":"https://doi.org/10.1109/DSC49826.2021.9346268","url":null,"abstract":"The vehicular sensor network has been developed to improve traffic, enhance the driving experience and so on, and is an inevitable technology trend. In vehicular sensor network, large amounts of data generated by vehicles need to be transmitted in the open channel, so it is important to ensure the integrity of information and vehicular privacy. For such a harsh condition, the aggregate signature technology is a very suitable solution, because it not only provides message integrity and authentication, but is also well suited to resource-constrained environments. Thus, in this paper, for vehicular sensor networks, we construct a certificateless and fault-tolerant aggregate signature (CLFTAS) scheme based on the elliptic curve cryptosystem. The certificateless nature makes our scheme free from the certificate management issue in traditional public key cryptography and the key escrow issue in identity-based cryptography. Fault tolerance greatly makes up for the aggregate signature's defect that adding an invalid individual signature to a valid aggregate invalidates the entire aggregation. Moreover, our scheme can protect the privacy of the vehicle’ identity. In the end, we give the security proof and performance evaluation. In the random oracle model, our scheme is secure under the assumption that solving the elliptic curve discrete logarithm problem is hard, and has great performance optimization and functionality compared with the state-of-the-art.","PeriodicalId":184504,"journal":{"name":"2021 IEEE Conference on Dependable and Secure Computing (DSC)","volume":"600 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132799759","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}
Pub Date : 2021-01-30DOI: 10.1109/DSC49826.2021.9346236
Marc Fischer, O. Riedel, A. Lechler, A. Verl
To enable the usage of standard hardware in safety-critical applications for production systems, new approaches for hardware fault tolerance are required. These approaches must be implemented on software level. As shown in the literature, arithmetic coding is a promising approach, but only supports integer calculations. For complex safety functions, e.g. in robotics, fast floating-point calculations are needed. Therefore, this paper presents a method for direct arithmetic encoding of floating-point calculations with low-performance impact. Moreover, a detailed residual error estimation is given.
{"title":"Arithmetic Coding for Floating-Point Numbers","authors":"Marc Fischer, O. Riedel, A. Lechler, A. Verl","doi":"10.1109/DSC49826.2021.9346236","DOIUrl":"https://doi.org/10.1109/DSC49826.2021.9346236","url":null,"abstract":"To enable the usage of standard hardware in safety-critical applications for production systems, new approaches for hardware fault tolerance are required. These approaches must be implemented on software level. As shown in the literature, arithmetic coding is a promising approach, but only supports integer calculations. For complex safety functions, e.g. in robotics, fast floating-point calculations are needed. Therefore, this paper presents a method for direct arithmetic encoding of floating-point calculations with low-performance impact. Moreover, a detailed residual error estimation is given.","PeriodicalId":184504,"journal":{"name":"2021 IEEE Conference on Dependable and Secure Computing (DSC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114878068","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}
Pub Date : 2021-01-30DOI: 10.1109/DSC49826.2021.9346273
Wei-Yang Chiu, W. Meng, C. Jensen
Public key infrastructure (PKI) is the most widely adopted framework aiming to protect the communications between servers and clients, by authenticating users and devices in the digital world. In order to mitigate the single point of failure (SPOF) posed by a centralized PKI architecture, decentralized PKI has received much more attention, which can decentralize the responsibility of certificate authorities. Many blockchain-based PKI systems are developed such as BlockPGP, Blockstack and NoPKI. However, it is found that some existing systems are susceptible to privacy leakage. In this work, we first compare the functionality between blockchain-based PKI systems and analyze the potential privacy issues. Then we focus on Luo's PKI system that adopts the concept of neighborhood and propose a privacy-aware blockchain-based PKI called ChainPKI, by enhancing the privacy. Our experimental results indicate the effectiveness of our enhanced system auainst notential nrivacv leakaoe,
{"title":"ChainPKI - Towards Ethash-based Decentralized PKI with Privacy Enhancement","authors":"Wei-Yang Chiu, W. Meng, C. Jensen","doi":"10.1109/DSC49826.2021.9346273","DOIUrl":"https://doi.org/10.1109/DSC49826.2021.9346273","url":null,"abstract":"Public key infrastructure (PKI) is the most widely adopted framework aiming to protect the communications between servers and clients, by authenticating users and devices in the digital world. In order to mitigate the single point of failure (SPOF) posed by a centralized PKI architecture, decentralized PKI has received much more attention, which can decentralize the responsibility of certificate authorities. Many blockchain-based PKI systems are developed such as BlockPGP, Blockstack and NoPKI. However, it is found that some existing systems are susceptible to privacy leakage. In this work, we first compare the functionality between blockchain-based PKI systems and analyze the potential privacy issues. Then we focus on Luo's PKI system that adopts the concept of neighborhood and propose a privacy-aware blockchain-based PKI called ChainPKI, by enhancing the privacy. Our experimental results indicate the effectiveness of our enhanced system auainst notential nrivacv leakaoe,","PeriodicalId":184504,"journal":{"name":"2021 IEEE Conference on Dependable and Secure Computing (DSC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116694092","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：