Pub Date : 2020-01-01DOI: 10.4018/978-1-7998-1763-5.ch015
Melesio Calderon Munoz, M. Moh
The electrical power grid forms the functional foundation of our modern societies, but in the near future our aging electrical infrastructure will not be able to keep pace with our demands. As a result, nations worldwide have started to convert their power grids into smart grids that will have improved communication and control systems. A smart grid will be better able to incorporate new forms of energy generation as well as be self-healing and more reliable. This paper investigates a threat to wireless communication networks from a fully realized quantum computer, and provides a means to avoid this problem in smart grid domains. We discuss and compare the security aspects, the complexities and the performance of authentication using public-key cryptography and using Merkel trees. As a result, we argue for the use of Merkle trees as opposed to public key encryption for authentication of devices in wireless mesh networks (WMN) used in smart grid applications.
{"title":"Authentication of Smart Grid","authors":"Melesio Calderon Munoz, M. Moh","doi":"10.4018/978-1-7998-1763-5.ch015","DOIUrl":"https://doi.org/10.4018/978-1-7998-1763-5.ch015","url":null,"abstract":"The electrical power grid forms the functional foundation of our modern societies, but in the near future our aging electrical infrastructure will not be able to keep pace with our demands. As a result, nations worldwide have started to convert their power grids into smart grids that will have improved communication and control systems. A smart grid will be better able to incorporate new forms of energy generation as well as be self-healing and more reliable. This paper investigates a threat to wireless communication networks from a fully realized quantum computer, and provides a means to avoid this problem in smart grid domains. We discuss and compare the security aspects, the complexities and the performance of authentication using public-key cryptography and using Merkel trees. As a result, we argue for the use of Merkle trees as opposed to public key encryption for authentication of devices in wireless mesh networks (WMN) used in smart grid applications.","PeriodicalId":36072,"journal":{"name":"Cryptography","volume":"1 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70443163","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 : 2020-01-01DOI: 10.4018/978-1-4666-8687-8.CH009
Vishnu Suryavanshi, G. C. Manna
At present a majority of computer and telecommunication systems requires data security when data is transmitted the over next generation network. Data that is transient over an unsecured Next Generation wireless network is always susceptible to being intercepted by anyone within the range of the wireless signal. Hence providing secure communication to keep the user's information and devices safe when connected wirelessly has become one of the major concerns. Quantum cryptography algorithm provides a solution towards absolute communication security over the next generation network by encoding information as polarized photons, which can be sent through the air security issues and services using cryptographic algorithm explained in this chapter.
{"title":"Cryptographic Algorithms for Next Generation Wireless Networks Security","authors":"Vishnu Suryavanshi, G. C. Manna","doi":"10.4018/978-1-4666-8687-8.CH009","DOIUrl":"https://doi.org/10.4018/978-1-4666-8687-8.CH009","url":null,"abstract":"At present a majority of computer and telecommunication systems requires data security when data is transmitted the over next generation network. Data that is transient over an unsecured Next Generation wireless network is always susceptible to being intercepted by anyone within the range of the wireless signal. Hence providing secure communication to keep the user's information and devices safe when connected wirelessly has become one of the major concerns. Quantum cryptography algorithm provides a solution towards absolute communication security over the next generation network by encoding information as polarized photons, which can be sent through the air security issues and services using cryptographic algorithm explained in this chapter.","PeriodicalId":36072,"journal":{"name":"Cryptography","volume":"1 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70429208","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 : 2020-01-01DOI: 10.4018/978-1-5225-0536-5.CH004
S. Prajapat, R. S. Thakur
“Key” plays a vital role in every symmetric key cryptosystem. The obvious way of enhancing security of any cryptosystem is to keep the key as large as possible. But it may not be suitable for low power devices since higher computation will be done for longer keys and that will increase the power requirement which decreases the device's performance. In order to resolve the former specified problem an alternative approach can be used in which the length of key is fixed and its value varies in every session. This is Time Variant Key approach or Automatic Variable Key (AVK) approach. The Security of AVK based cryptosystem is enhanced by exchanging some parameters instead of keys between the communicating parties, then these parameters will be used to generate required keys at the receiver end. This chapter presents implementation of the above specified Mechanism. A model has been demonstrated with parameterized scheme and issues in AVK approach. Further, it has been analyzed from different users' perspectives. This chapter also highlights the benefits of AVK model to ensure two levels of security with characterization of methods for AVK and Estimation of key computation based on parameters only. The characteristic components of recent styles of key design with consideration of key size, life time of key and breaking threshold has also been pointed out. These characteristics are essential in the design of efficient symmetric key cryptosystem. The novel approach of AVK based cryptosystem is suitable for low power devices and useful for exchanging very large objects or files. This scheme has been demonstrated with Fibonacci-Q matrix and sparse matrix based diffused key information exchange procedures. These models have been further tested from perspective of hackers and cryptanalyst, to exploit any weakness with fixed size dynamic keys.
{"title":"Towards Parameterized Shared Key for AVK Approach","authors":"S. Prajapat, R. S. Thakur","doi":"10.4018/978-1-5225-0536-5.CH004","DOIUrl":"https://doi.org/10.4018/978-1-5225-0536-5.CH004","url":null,"abstract":"“Key” plays a vital role in every symmetric key cryptosystem. The obvious way of enhancing security of any cryptosystem is to keep the key as large as possible. But it may not be suitable for low power devices since higher computation will be done for longer keys and that will increase the power requirement which decreases the device's performance. In order to resolve the former specified problem an alternative approach can be used in which the length of key is fixed and its value varies in every session. This is Time Variant Key approach or Automatic Variable Key (AVK) approach. The Security of AVK based cryptosystem is enhanced by exchanging some parameters instead of keys between the communicating parties, then these parameters will be used to generate required keys at the receiver end. This chapter presents implementation of the above specified Mechanism. A model has been demonstrated with parameterized scheme and issues in AVK approach. Further, it has been analyzed from different users' perspectives. This chapter also highlights the benefits of AVK model to ensure two levels of security with characterization of methods for AVK and Estimation of key computation based on parameters only. The characteristic components of recent styles of key design with consideration of key size, life time of key and breaking threshold has also been pointed out. These characteristics are essential in the design of efficient symmetric key cryptosystem. The novel approach of AVK based cryptosystem is suitable for low power devices and useful for exchanging very large objects or files. This scheme has been demonstrated with Fibonacci-Q matrix and sparse matrix based diffused key information exchange procedures. These models have been further tested from perspective of hackers and cryptanalyst, to exploit any weakness with fixed size dynamic keys.","PeriodicalId":36072,"journal":{"name":"Cryptography","volume":"1 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70430950","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 : 2020-01-01DOI: 10.4018/978-1-5225-0920-2.CH013
B. P. Singh, Manjit Singh, Dixit Sharma
Remote health-care monitoring systems communicate biomedical information (e.g. Electrocardiogram (ECG)) over insecure networks. Protection of the integrity, authentication and confidentiality of the medical data is a challenging issue. This chapter proposed an encryption process having a 4-round five steps -encryption structure includes: the random pixel insertion, row separation, substitution of each separated row, row combination and rotation. Accuracy and security analysis of proposed method for 2D ECG encryption is evaluated on MIT-BIH arrhythmia database.
{"title":"Chaotic Function Based ECG Encryption System","authors":"B. P. Singh, Manjit Singh, Dixit Sharma","doi":"10.4018/978-1-5225-0920-2.CH013","DOIUrl":"https://doi.org/10.4018/978-1-5225-0920-2.CH013","url":null,"abstract":"Remote health-care monitoring systems communicate biomedical information (e.g. Electrocardiogram (ECG)) over insecure networks. Protection of the integrity, authentication and confidentiality of the medical data is a challenging issue. This chapter proposed an encryption process having a 4-round five steps -encryption structure includes: the random pixel insertion, row separation, substitution of each separated row, row combination and rotation. Accuracy and security analysis of proposed method for 2D ECG encryption is evaluated on MIT-BIH arrhythmia database.","PeriodicalId":36072,"journal":{"name":"Cryptography","volume":"1 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70431386","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 : 2020-01-01DOI: 10.4018/978-1-4666-8723-3.CH006
Adrita Barari, S. Dhavale
The aim of this chapter is to review the application of the technique of Visual cryptography in non-intrusive video watermarking. The power of saliency feature extraction is also highlighted in the context of Visual Cryptography based watermarking systems for videos. All schemes in literature related to Visual cryptography based video watermarking, have been brought together with special attention on the role of saliency feature extraction in each of these schemes. Further a novel approach for VC based video watermarking using motion vectors (MVP Algorithm) as a salient feature is suggested. Experimental results show the robustness of proposed MVP Algorithm against various video processing attacks. Also, compression scale invariance is achieved.
{"title":"Video Saliency Detection for Visual Cryptography-Based Watermarking","authors":"Adrita Barari, S. Dhavale","doi":"10.4018/978-1-4666-8723-3.CH006","DOIUrl":"https://doi.org/10.4018/978-1-4666-8723-3.CH006","url":null,"abstract":"The aim of this chapter is to review the application of the technique of Visual cryptography in non-intrusive video watermarking. The power of saliency feature extraction is also highlighted in the context of Visual Cryptography based watermarking systems for videos. All schemes in literature related to Visual cryptography based video watermarking, have been brought together with special attention on the role of saliency feature extraction in each of these schemes. Further a novel approach for VC based video watermarking using motion vectors (MVP Algorithm) as a salient feature is suggested. Experimental results show the robustness of proposed MVP Algorithm against various video processing attacks. Also, compression scale invariance is achieved.","PeriodicalId":36072,"journal":{"name":"Cryptography","volume":"1 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70429273","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 : 2020-01-01DOI: 10.4018/978-1-5225-2296-6.CH009
J. Mondal, Debabala Swain
Images unduly assist digital communication in this aeon of multimedia. During times a person transmits confidential images over a flabby communication network, sheer protection is an accost contention to preserve the privacy of images. Encryption is one of the practice to clutch the reticence of images. Image encryption contributes a preeminent bite to charter security for secure sight data communication over the internet. Our work illustrates a survey on image encryption in different domains providing concise exordium to cryptography, moreover, furnishing the review of sundry image encryption techniques.
{"title":"A Contemplator on Topical Image Encryption Measures","authors":"J. Mondal, Debabala Swain","doi":"10.4018/978-1-5225-2296-6.CH009","DOIUrl":"https://doi.org/10.4018/978-1-5225-2296-6.CH009","url":null,"abstract":"Images unduly assist digital communication in this aeon of multimedia. During times a person transmits confidential images over a flabby communication network, sheer protection is an accost contention to preserve the privacy of images. Encryption is one of the practice to clutch the reticence of images. Image encryption contributes a preeminent bite to charter security for secure sight data communication over the internet. Our work illustrates a survey on image encryption in different domains providing concise exordium to cryptography, moreover, furnishing the review of sundry image encryption techniques.","PeriodicalId":36072,"journal":{"name":"Cryptography","volume":"1 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70432339","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 : 2020-01-01DOI: 10.4018/978-1-7998-1763-5.ch013
Syed Taqi Ali
In the early years after the invention of public key cryptography by Diffie and Hellman in 1976, the design and evaluation of public key cryptosystems has been done merely in ad-hoc manner based on trial and error. The public key cryptosystem said to be secure as long as there is no successful cryptanalytic attack on it. But due to various successful attacks on the cryptosystems after development, the cryptographic community understood that this ad-hoc approach might not be good enough. The paradigm of provable security is an attempt to get rid of ad hoc design. The goals of provable security are to define appropriate models of security on the one hand, and to develop cryptographic designs that can be proven to be secure within the defined models on the other. There are two general approaches for structuring the security proof. One is reductionist approach and other is game-based approach. In these approaches, the security proofs reduce a well known problem (such as discrete logarithm, RSA) to an attack against a proposed cryptosystem. With this approach, the security of public key cryptosystem can be proved formally under the various models viz. random oracle model, generic group model and standard model. In this chapter, we will briefly explain these approaches along with the security proofs of well known public key cryptosystems under the appropriate model.
{"title":"Provable Security for Public Key Cryptosystems","authors":"Syed Taqi Ali","doi":"10.4018/978-1-7998-1763-5.ch013","DOIUrl":"https://doi.org/10.4018/978-1-7998-1763-5.ch013","url":null,"abstract":"In the early years after the invention of public key cryptography by Diffie and Hellman in 1976, the design and evaluation of public key cryptosystems has been done merely in ad-hoc manner based on trial and error. The public key cryptosystem said to be secure as long as there is no successful cryptanalytic attack on it. But due to various successful attacks on the cryptosystems after development, the cryptographic community understood that this ad-hoc approach might not be good enough. The paradigm of provable security is an attempt to get rid of ad hoc design. The goals of provable security are to define appropriate models of security on the one hand, and to develop cryptographic designs that can be proven to be secure within the defined models on the other. There are two general approaches for structuring the security proof. One is reductionist approach and other is game-based approach. In these approaches, the security proofs reduce a well known problem (such as discrete logarithm, RSA) to an attack against a proposed cryptosystem. With this approach, the security of public key cryptosystem can be proved formally under the various models viz. random oracle model, generic group model and standard model. In this chapter, we will briefly explain these approaches along with the security proofs of well known public key cryptosystems under the appropriate model.","PeriodicalId":36072,"journal":{"name":"Cryptography","volume":"1 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70443023","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}
{"title":"Shannon’s Theory, Perfect Secrecy, and the One-Time Pad","authors":"Douglas R Stinson, Maura B. Paterson","doi":"10.1201/9781315282497-3","DOIUrl":"https://doi.org/10.1201/9781315282497-3","url":null,"abstract":"","PeriodicalId":36072,"journal":{"name":"Cryptography","volume":"1 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2018-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41600937","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}
{"title":"Signature Schemes","authors":"Douglas R Stinson, Maura B. Paterson","doi":"10.1201/9781315282497-8","DOIUrl":"https://doi.org/10.1201/9781315282497-8","url":null,"abstract":"","PeriodicalId":36072,"journal":{"name":"Cryptography","volume":" ","pages":""},"PeriodicalIF":1.6,"publicationDate":"2018-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43326320","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 : 2018-08-14DOI: 10.1007/978-3-319-79063-3
Douglas R Stinson, Maura B. Paterson
{"title":"Post-Quantum Cryptography","authors":"Douglas R Stinson, Maura B. Paterson","doi":"10.1007/978-3-319-79063-3","DOIUrl":"https://doi.org/10.1007/978-3-319-79063-3","url":null,"abstract":"","PeriodicalId":36072,"journal":{"name":"Cryptography","volume":" ","pages":""},"PeriodicalIF":1.6,"publicationDate":"2018-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/978-3-319-79063-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43765201","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
扫码关注我们
求助内容：
应助结果提醒方式：