Pub Date : 2019-12-01DOI: 10.1109/ICCES48960.2019.9068179
Mostafa Farghaly, W. Ahmed, Nada Shorim, Ashraf AbdelRaouf, Sama Dawood
Conference interpretation is an active area of linguistics with growing challenges in technological integration. Despite advancement in information technology, simultaneous interpreters have not yet been provided with adequate tools to bring down the stress level that accompanies their profession. The booth setting and the way they perform have not been changed a lot over the years. Although a number of computer approaches have been presented to make the task of conference interpreters less challenging, most of them fail to meet their actual needs. Some of those approaches add to the pressure that interpreters are already under as they require human input, while others are restricted to certain languages. This paper proposes a new approach that makes use of automatic speech recognition (ASR) combined with a cloud-based machine translation (MT) that transcribes spoken words and provides in-depth translation in a contextual manner through the use of a compiled glossary. The proposed approach provides for the first time an instantaneous transcription of a speech, a domain detection through a part-of-speech tagger, and an adequate translation of the terminology used. Our approach has been tested in terms of transcription accuracy, domain extraction, and terminology identification and retrieval using English and Arabic speeches that cover different domains.
{"title":"Natural Language Understanding for Simultaneous Conference Interpretation","authors":"Mostafa Farghaly, W. Ahmed, Nada Shorim, Ashraf AbdelRaouf, Sama Dawood","doi":"10.1109/ICCES48960.2019.9068179","DOIUrl":"https://doi.org/10.1109/ICCES48960.2019.9068179","url":null,"abstract":"Conference interpretation is an active area of linguistics with growing challenges in technological integration. Despite advancement in information technology, simultaneous interpreters have not yet been provided with adequate tools to bring down the stress level that accompanies their profession. The booth setting and the way they perform have not been changed a lot over the years. Although a number of computer approaches have been presented to make the task of conference interpreters less challenging, most of them fail to meet their actual needs. Some of those approaches add to the pressure that interpreters are already under as they require human input, while others are restricted to certain languages. This paper proposes a new approach that makes use of automatic speech recognition (ASR) combined with a cloud-based machine translation (MT) that transcribes spoken words and provides in-depth translation in a contextual manner through the use of a compiled glossary. The proposed approach provides for the first time an instantaneous transcription of a speech, a domain detection through a part-of-speech tagger, and an adequate translation of the terminology used. Our approach has been tested in terms of transcription accuracy, domain extraction, and terminology identification and retrieval using English and Arabic speeches that cover different domains.","PeriodicalId":136643,"journal":{"name":"2019 14th International Conference on Computer Engineering and Systems (ICCES)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124633907","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 : 2019-12-01DOI: 10.1109/ICCES48960.2019.9068162
O. Raouf, Heba Askr
Recently, Software Defined Networking (SDN) is emerging to replace traditional network architecture management at a reduced cost. SDN aims to introduce a centralized intelligent network in a core controller. OpenFlow (OF) is considered the most commonly used southbound API in SDN. Existing routing optimization algorithms are effective but at high order of time and space complexity. This complexity opens the door for the researchers to use the heuristic techniques to optimize the dynamic routing in OF-based SDNs. There are few attempts to introduce intelligent optimization routing technique at SDN controller layer (SDN brain). This paper suggests a modified Ant Colony Optimization (ACO) algorithm called “ACOSDN” to optimize the dynamic routing in SDNs. The suggested algorithm is compared to other related work and other routing techniques in SDN, the effectiveness is measured and the results show that the algorithm is able to handle dynamic network changes, reduce the network congestion and achieve higher throughput associated with a lower delay and packet loss rates.
{"title":"ACOSDN-Ant Colony Optimization Algorithm for Dynamic Routing In Software Defined Networking","authors":"O. Raouf, Heba Askr","doi":"10.1109/ICCES48960.2019.9068162","DOIUrl":"https://doi.org/10.1109/ICCES48960.2019.9068162","url":null,"abstract":"Recently, Software Defined Networking (SDN) is emerging to replace traditional network architecture management at a reduced cost. SDN aims to introduce a centralized intelligent network in a core controller. OpenFlow (OF) is considered the most commonly used southbound API in SDN. Existing routing optimization algorithms are effective but at high order of time and space complexity. This complexity opens the door for the researchers to use the heuristic techniques to optimize the dynamic routing in OF-based SDNs. There are few attempts to introduce intelligent optimization routing technique at SDN controller layer (SDN brain). This paper suggests a modified Ant Colony Optimization (ACO) algorithm called “ACOSDN” to optimize the dynamic routing in SDNs. The suggested algorithm is compared to other related work and other routing techniques in SDN, the effectiveness is measured and the results show that the algorithm is able to handle dynamic network changes, reduce the network congestion and achieve higher throughput associated with a lower delay and packet loss rates.","PeriodicalId":136643,"journal":{"name":"2019 14th International Conference on Computer Engineering and Systems (ICCES)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121138151","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 : 2019-12-01DOI: 10.1109/ICCES48960.2019.9068137
A. Ali, K. M. Naguib, K. Mahmoud
Device-to-Device (D2D) communication has become a promising technology to enhance the performance of cellular networks. The major challenge for resource sharing in D2D networks lies in the co-interference between cellular users and the originated D2D connections. In addition, power allocation for D2D connections and cellular users sharing the same spectrum is also a problem for these networks. In D2D caching networks, caching contents at users' devices can significantly reduce large network headaches. This becomes a promising solution for controlling limited resources. Maximizing the cached portions delivered to users using D2D communications requires combined consideration for guaranteed D2D channels and their allocated power. In this paper, a joint optimization problem of caching content caching delivery with resource and power allocation awareness to improve the performance of D2D caching networks is presented. We aim to enhance the performance of such networks by maximizing the overall sum rate of D2D and cellular users. An optimization problem for sum rate is formulated under the constraint of power requirements and Signal-to-Interference plus Noise Ratio (SINR). The proposed optimization problem will be solved using an optimization algorithm by jointly optimize channel and power allocation. The simulation results show that the performance of the optimal scenario with effectively selecting suitable locality ratio and D2D power optimization can lead to valuable gains in the sum rate.
{"title":"Optimized Resource and Power Allocation for Sum Rate Maximization in D2D- Assisted Caching Networks","authors":"A. Ali, K. M. Naguib, K. Mahmoud","doi":"10.1109/ICCES48960.2019.9068137","DOIUrl":"https://doi.org/10.1109/ICCES48960.2019.9068137","url":null,"abstract":"Device-to-Device (D2D) communication has become a promising technology to enhance the performance of cellular networks. The major challenge for resource sharing in D2D networks lies in the co-interference between cellular users and the originated D2D connections. In addition, power allocation for D2D connections and cellular users sharing the same spectrum is also a problem for these networks. In D2D caching networks, caching contents at users' devices can significantly reduce large network headaches. This becomes a promising solution for controlling limited resources. Maximizing the cached portions delivered to users using D2D communications requires combined consideration for guaranteed D2D channels and their allocated power. In this paper, a joint optimization problem of caching content caching delivery with resource and power allocation awareness to improve the performance of D2D caching networks is presented. We aim to enhance the performance of such networks by maximizing the overall sum rate of D2D and cellular users. An optimization problem for sum rate is formulated under the constraint of power requirements and Signal-to-Interference plus Noise Ratio (SINR). The proposed optimization problem will be solved using an optimization algorithm by jointly optimize channel and power allocation. The simulation results show that the performance of the optimal scenario with effectively selecting suitable locality ratio and D2D power optimization can lead to valuable gains in the sum rate.","PeriodicalId":136643,"journal":{"name":"2019 14th International Conference on Computer Engineering and Systems (ICCES)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134468186","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 : 2019-12-01DOI: 10.1109/ICCES48960.2019.9068130
B. Balachandran, Kazi Farzana Saad, Ketu Patel, N. Mekhiel
We implemented a facial recognition application with AI. We used the VGGFace model for our neural net to identify faces. The application includes training and recognizing. The training part is to add new faces to our system, while the recognizing part is to determine the identity of a face. The application runs on multiple cores and able to scale with different numbers of cores. The implementation for parallelism uses tensorflow. For performance measurements, we used the Task Manager application found in Windows with special option known as ‘affinity to choose the number of cores to run the application. The results show that our system scales in performance with number of processors up to twelve.
{"title":"Parallel Computer For Face Recognition Using Artificial Intelligence","authors":"B. Balachandran, Kazi Farzana Saad, Ketu Patel, N. Mekhiel","doi":"10.1109/ICCES48960.2019.9068130","DOIUrl":"https://doi.org/10.1109/ICCES48960.2019.9068130","url":null,"abstract":"We implemented a facial recognition application with AI. We used the VGGFace model for our neural net to identify faces. The application includes training and recognizing. The training part is to add new faces to our system, while the recognizing part is to determine the identity of a face. The application runs on multiple cores and able to scale with different numbers of cores. The implementation for parallelism uses tensorflow. For performance measurements, we used the Task Manager application found in Windows with special option known as ‘affinity to choose the number of cores to run the application. The results show that our system scales in performance with number of processors up to twelve.","PeriodicalId":136643,"journal":{"name":"2019 14th International Conference on Computer Engineering and Systems (ICCES)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134634269","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 : 2019-12-01DOI: 10.1109/ICCES48960.2019.9068156
Sara Salama, Rashed K. Salem, H. Abdel-Kader
In data area, to achieve good information for decision making, suitable processing of data is needed. Data need to be transferred. They are transferred as a vector which contains features of data. During data transferring, errors may occur. Errors change the features of data vector (instance). In this case, error detection and correction techniques are needed to tackle this issue. If data transferred as groups based on its features, any change in the features of any vector will change the group (cluster) of this vector. So, to cluster an incomprehensible data for operating any method of data mining, an influential technique is needed, and this technique should ensure the correctness of the cluster using error detection and correction codes like Hamming and Golay. This paper presents a technique to detect and correct clustered data after the transfer process to reduce the misclustered instances. The main concept is the reemploying the error-correction Golay code with splitting of the data word and code word to symbols. DENCLUE clustering algorithm is used in the step of clustering as density-based clustering algorithm. Comparison with other related works is performed and the simulation results stated that the proposed technique achieved better performance.
{"title":"Error Detection and Correction Code Using Density-based Clustering Algorithm","authors":"Sara Salama, Rashed K. Salem, H. Abdel-Kader","doi":"10.1109/ICCES48960.2019.9068156","DOIUrl":"https://doi.org/10.1109/ICCES48960.2019.9068156","url":null,"abstract":"In data area, to achieve good information for decision making, suitable processing of data is needed. Data need to be transferred. They are transferred as a vector which contains features of data. During data transferring, errors may occur. Errors change the features of data vector (instance). In this case, error detection and correction techniques are needed to tackle this issue. If data transferred as groups based on its features, any change in the features of any vector will change the group (cluster) of this vector. So, to cluster an incomprehensible data for operating any method of data mining, an influential technique is needed, and this technique should ensure the correctness of the cluster using error detection and correction codes like Hamming and Golay. This paper presents a technique to detect and correct clustered data after the transfer process to reduce the misclustered instances. The main concept is the reemploying the error-correction Golay code with splitting of the data word and code word to symbols. DENCLUE clustering algorithm is used in the step of clustering as density-based clustering algorithm. Comparison with other related works is performed and the simulation results stated that the proposed technique achieved better performance.","PeriodicalId":136643,"journal":{"name":"2019 14th International Conference on Computer Engineering and Systems (ICCES)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114900569","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 : 2019-12-01DOI: 10.1109/ICCES48960.2019.9068108
Karim Alaa El-Din Abd El-Raouf, Ayman M. Bahaa-Eldin, M. Sobh
ASA systems (firewall, IDS, IPS) are probable to become communication bottlenecks in networks with growing network bandwidths. To alleviate this issue, we suggest to use Application-aware mechanism based on Deep Packet Inspection (DPI) to bypass chosen traffic around firewalls. The services of Internet video sharing gained importance and expanded their share of the multimedia market. The Internet video should meet strict service quality (QoS) criteria to make the broadcasting of broadcast television a viable and comparable level of quality. However, since the Internet video relies on packet communication, it is subject to delays, transmission failures, loss of data and bandwidth restrictions that may have a catastrophic effect on the quality of multimedia.
{"title":"Multipath Traffic Engineering for Software Defined Networking","authors":"Karim Alaa El-Din Abd El-Raouf, Ayman M. Bahaa-Eldin, M. Sobh","doi":"10.1109/ICCES48960.2019.9068108","DOIUrl":"https://doi.org/10.1109/ICCES48960.2019.9068108","url":null,"abstract":"ASA systems (firewall, IDS, IPS) are probable to become communication bottlenecks in networks with growing network bandwidths. To alleviate this issue, we suggest to use Application-aware mechanism based on Deep Packet Inspection (DPI) to bypass chosen traffic around firewalls. The services of Internet video sharing gained importance and expanded their share of the multimedia market. The Internet video should meet strict service quality (QoS) criteria to make the broadcasting of broadcast television a viable and comparable level of quality. However, since the Internet video relies on packet communication, it is subject to delays, transmission failures, loss of data and bandwidth restrictions that may have a catastrophic effect on the quality of multimedia.","PeriodicalId":136643,"journal":{"name":"2019 14th International Conference on Computer Engineering and Systems (ICCES)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114699107","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 : 2019-12-01DOI: 10.1109/ICCES48960.2019.9068106
Peter Hassaballah, M. A. Salem, Hisham Othman
Digital Audio Workstations (DAW) are tools for mastering and mixing audio files, in the broader context of large-scale audio processing. Among many other processes, they allow users to perform advanced processes (e.g. Mastering and Equalization) on audio files and apply a chains of audio effects (e.g. Gain, reverb) using sophisticated GUI. DAWs has proven to be a useful resource for Digital Signal Processing (DSP) tasks, and in particular for music production. While the tools are powerful and stable, utilizing tools that require a certain level of knowledge and background in music production and sound processing can be messy and error prone. We propose a solution that allows batch processing of audio file in a fast and prompt manner carrying out some of the popular digital signal processing techniques. The proposed solution, py DAW, is in the form of an open-source tool for users who cannot afford using DAWs for their cost or complexity. pyDAW is a lean Python Command Line Interface (CLI) that provides a simple interface to complement regular DAWs GUI environments, making it easier to run DAWs functionalities in a batch and simple manner.
{"title":"pyDAW: A Pragmatic CLI for Digital Audio Processing","authors":"Peter Hassaballah, M. A. Salem, Hisham Othman","doi":"10.1109/ICCES48960.2019.9068106","DOIUrl":"https://doi.org/10.1109/ICCES48960.2019.9068106","url":null,"abstract":"Digital Audio Workstations (DAW) are tools for mastering and mixing audio files, in the broader context of large-scale audio processing. Among many other processes, they allow users to perform advanced processes (e.g. Mastering and Equalization) on audio files and apply a chains of audio effects (e.g. Gain, reverb) using sophisticated GUI. DAWs has proven to be a useful resource for Digital Signal Processing (DSP) tasks, and in particular for music production. While the tools are powerful and stable, utilizing tools that require a certain level of knowledge and background in music production and sound processing can be messy and error prone. We propose a solution that allows batch processing of audio file in a fast and prompt manner carrying out some of the popular digital signal processing techniques. The proposed solution, py DAW, is in the form of an open-source tool for users who cannot afford using DAWs for their cost or complexity. pyDAW is a lean Python Command Line Interface (CLI) that provides a simple interface to complement regular DAWs GUI environments, making it easier to run DAWs functionalities in a batch and simple manner.","PeriodicalId":136643,"journal":{"name":"2019 14th International Conference on Computer Engineering and Systems (ICCES)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132050586","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 : 2019-12-01DOI: 10.1109/icces48960.2019.9068187
{"title":"Session AI1: Artificial Intelligence I","authors":"","doi":"10.1109/icces48960.2019.9068187","DOIUrl":"https://doi.org/10.1109/icces48960.2019.9068187","url":null,"abstract":"","PeriodicalId":136643,"journal":{"name":"2019 14th International Conference on Computer Engineering and Systems (ICCES)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123659290","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 : 2019-12-01DOI: 10.1109/ICCES48960.2019.9068174
Sara Khaled, Samy S. Soliman, Y. Fahmy
In this paper, user association and power allocation in the uplink transmission of ultra-dense networks are studied. Solutions are proposed for cell grouping and resource sharing based on cell locations. The performance of non-orthogonal multiple access (NOMA) is compared to other power allocation schemes used in literature, namely, power control, the waterfilling algorithm as well as uniform power allocation. It is shown that while NOMA guarantees fairness among transmitting nodes, other power allocation schemes achieve higher aggregate throughput at the expense of some nodes deprived their right for transmission. Therefore, in data-centric application, e.g. Internet of Things-based application and Machine Type Communication-based application, where higher data rate transmission is prioritized irrespective the transmitting nodes, NOMA cannot be recommended as an optimum solution.
{"title":"On the Performance of Power Allocation Schemes in Ultra Dense Networks","authors":"Sara Khaled, Samy S. Soliman, Y. Fahmy","doi":"10.1109/ICCES48960.2019.9068174","DOIUrl":"https://doi.org/10.1109/ICCES48960.2019.9068174","url":null,"abstract":"In this paper, user association and power allocation in the uplink transmission of ultra-dense networks are studied. Solutions are proposed for cell grouping and resource sharing based on cell locations. The performance of non-orthogonal multiple access (NOMA) is compared to other power allocation schemes used in literature, namely, power control, the waterfilling algorithm as well as uniform power allocation. It is shown that while NOMA guarantees fairness among transmitting nodes, other power allocation schemes achieve higher aggregate throughput at the expense of some nodes deprived their right for transmission. Therefore, in data-centric application, e.g. Internet of Things-based application and Machine Type Communication-based application, where higher data rate transmission is prioritized irrespective the transmitting nodes, NOMA cannot be recommended as an optimum solution.","PeriodicalId":136643,"journal":{"name":"2019 14th International Conference on Computer Engineering and Systems (ICCES)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130042121","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 : 2019-12-01DOI: 10.1109/ICCES48960.2019.9068181
A. Khalifa, Ayman M. Bahaa-Eldin, Mohamed Sobh
Advances in both quantum computation and blockchain systems necessitate a rigid analysis for the security of blockchains in the advent of powerful quantum computers. Computational problems that are proved or believed to be intractable by classical computers are known to be attacked by well-studied quantum algorithms. Such problems are used as basis to secure blockchains and hence the security of such systems must be defended. As proof-of-work is used in early blockchains to maintain consensus, proof-of-stake was proposed to lower its high energy consumption and provide a higher network throughput. Proof-of-Stake has hence got an increasing interest, variations, implementations and enhancements whilst its quantum security defenses remained almost the same. By comparing proof-of-work to proof-of-stake, we find that the latter is more vulnerable to certain attack vectors. We suggest general defenses for quantum-resilient blockchains and thoroughly analyze post-quantum signature schemes to select an appropriate alternative to the most serious threat on conventional digital signatures.
{"title":"Quantum Attacks and Defenses for Proof-of-Stake","authors":"A. Khalifa, Ayman M. Bahaa-Eldin, Mohamed Sobh","doi":"10.1109/ICCES48960.2019.9068181","DOIUrl":"https://doi.org/10.1109/ICCES48960.2019.9068181","url":null,"abstract":"Advances in both quantum computation and blockchain systems necessitate a rigid analysis for the security of blockchains in the advent of powerful quantum computers. Computational problems that are proved or believed to be intractable by classical computers are known to be attacked by well-studied quantum algorithms. Such problems are used as basis to secure blockchains and hence the security of such systems must be defended. As proof-of-work is used in early blockchains to maintain consensus, proof-of-stake was proposed to lower its high energy consumption and provide a higher network throughput. Proof-of-Stake has hence got an increasing interest, variations, implementations and enhancements whilst its quantum security defenses remained almost the same. By comparing proof-of-work to proof-of-stake, we find that the latter is more vulnerable to certain attack vectors. We suggest general defenses for quantum-resilient blockchains and thoroughly analyze post-quantum signature schemes to select an appropriate alternative to the most serious threat on conventional digital signatures.","PeriodicalId":136643,"journal":{"name":"2019 14th International Conference on Computer Engineering and Systems (ICCES)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122544936","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
扫码关注我们
求助内容：
应助结果提醒方式：