Segui questo link per vedere altri tipi di pubblicazioni sul tema: Decryption.
Articoli di riviste sul tema "Decryption"
Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili
Vedi i top-50 articoli di riviste per l'attività di ricerca sul tema "Decryption".
Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.
Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.
Vedi gli articoli di riviste di molte aree scientifiche e compila una bibliografia corretta.
1
Partala, Juha. "Symmetric Blind Decryption with Perfect Secrecy." Journal of Computer Networks and Communications 2017 (2017): 1–15. http://dx.doi.org/10.1155/2017/6575907.
Testo completoAbstract (sommario):
A blind decryption scheme enables a user to query decryptions from a decryption server without revealing information about the plain-text message. Such schemes are useful, for example, for the implementation of privacy-preserving encrypted file storages and payment systems. In terms of functionality, blind decryption is close to oblivious transfer. For noiseless channels, information-theoretically secure oblivious transfer is impossible. However, in this paper, we show that this is not the case for blind decryption. We formulate a definition of perfect secrecy of symmetric blind decryption for the following setting: at most one of the scheme participants is a passive adversary (honest-but-curious). We also devise a symmetric blind decryption scheme based on modular arithmetic on a ring Zp2, where p is a prime, and show that it satisfies our notion of perfect secrecy.
2
Zheng, Ting, and Zhi Zhong Zhang. "A Method Based on Hash Table to Implement the NAS Layer Decryption in LTE Big Data Platform." Applied Mechanics and Materials 716-717 (December 2014): 1430–33. http://dx.doi.org/10.4028/www.scientific.net/amm.716-717.1430.
Testo completoAbstract (sommario):
Firstly, this paper introduces the overall framework and design ideas of LTE big data platform. Secondly, it describes the principles of decrypting encrypted data. In view of the distribution characters of keys required by NAS layer decryption, a decryption scheme for analysis and implementation based on the data structure of hash bucket is proposed. Finally, this scheme is validated and analyzed. Aiming to studying decryption scheme of NAS date, applying this scheme to analyze the LTE big data platform and implementing the function of encrypt the NAS PDU in LTE big data platform. The scheme has a good application value in the field of network testing and a great signification to the operation and maintenance of LTE big data platform.
3
Brygilevych, Volodymyr, Nazar Pelypets, and Vasyl Rabyk. "Encryption of text messages using multilayer neural networks." Computational Problems of Electrical Engineering 10, no. 2 (December 2, 2020): 1–6. http://dx.doi.org/10.23939/jcpee2020.02.001.
Testo completoAbstract (sommario):
The article considers an algorithm for encrypting / decrypting text messages using multilayer neural networks (MLNN). The algorithm involves three steps: training a neural network based on the training pairs formed from a basic set of characters found in the text; encryption of the message using the weight coefficients of the hidden layers; its decryption using the weight coefficients of the output layer. The conditions necessary for successful encryption / decryption with this algorithm are formed, its limitations are emphasized. The MLNN architecture and training algorithm are described. The results of experimental research done by using the NeuralNet program are given: training the MLNN employing the BP (Sequential), BP (Batch), Rprop, QuickProp methods; an example of encrypting / decrypting a text message.
4
Kundu, Srijita, and Ernest Y. Z. Tan. "Device-independent uncloneable encryption." Quantum 9 (January 8, 2025): 1582. https://doi.org/10.22331/q-2025-01-08-1582.
Testo completoAbstract (sommario):
Uncloneable encryption, first introduced by Broadbent and Lord (TQC 2020) is a quantum encryption scheme in which a quantum ciphertext cannot be distributed between two non-communicating parties such that, given access to the decryption key, both parties cannot learn the underlying plaintext. In this work, we introduce a variant of uncloneable encryption in which several possible decryption keys can decrypt a particular encryption, and the security requirement is that two parties who receive independently generated decryption keys cannot both learn the underlying ciphertext. We show that this variant of uncloneable encryption can be achieved device-independently, i.e., without trusting the quantum states and measurements used in the scheme, and that this variant works just as well as the original definition in constructing quantum money. Moreover, we show that a simple modification of our scheme yields a single-decryptor encryption scheme, which was a related notion introduced by Georgiou and Zhandry. In particular, the resulting single-decryptor encryption scheme achieves device-independent security with respect to a standard definition of security against random plaintexts. Finally, we derive an ``extractor'' result for a two-adversary scenario, which in particular yields a single-decryptor encryption scheme for single bit-messages that achieves perfect anti-piracy security without needing the quantum random oracle model.
5
Popescu, Narcis I., Cristina Lupu, and Florea Lupu. "Calcium Ionophore-Induced Tissue Factor (TF) Decryption Induces TF Immobilization Into Lipid Rafts and Negative Regulation of TF Procoagulant Activity." Blood 116, no. 21 (November 19, 2010): 1131. http://dx.doi.org/10.1182/blood.v116.21.1131.1131.
Testo completoAbstract (sommario):
Abstract Abstract 1131 Cell exposed tissue factor (TF), the physiologic initiator of blood coagulation, is normally expressed in a low procoagulant, or cryptic conformation, and requires activation, or decryption, to fully exhibit its procoagulant potential. TF decryption is not fully understood and multiple decrypting mechanisms have been proposed including phosphatidylserine (PS) exposure, TF monomerization, association with lipid rafts and redox modulation of TF. Calcium ionophores have been extensively used as TF decrypting agents, and both PS-dependent and independent mechanisms have been associated with ionophore-induced TF decryption. In the present study we analyzed the changes that occur in the lateral mobility of cell exposed TF during calcium ionophore-induced decryption, using a TF chimera with monomeric yellow fluorescent protein (YFP-TF). The YFP-TF expressed by endothelial cells (EC) retains TF procoagulant activity, is mainly exposed on the cell surface and can be decrypted similarly with endogenous TF by the calcium ionophore ionomycin. We analyzed the changes in TF membrane mobility during decryption using live cell imaging of YFP-TF expressed in EC. Fluorescence recovery after photobleaching (FRAP) analysis revealed a decreased mobility of TF in EC treated with the decrypting agent ionomycin. The YFP-TF fluorescence in the region of interest was more easily bleached in ionomycin–treated cells as compared with controls. The observed maximum recovery (Rmax) of YFP-TF fluorescence in the bleached region of interest was significantly higher in control cells (80.84% recovery) as compared with ionomycin treated EC (39.29% recovery). These correlated with a decrease in YFP-TF mobile fraction from 50% for the control cells to 18% for the ionomycin treated EC. The lateral diffusion of the YFP-TF mobile fraction was similar between the two conditions, with halftime of fluorescence recovery of 7.69 sec in ionophore-treated cells and 10.69 sec in controls. These results suggest an immobilization of YFP-TF during decryption, which can be achieved by either lipid raft translocation or cytoskeleton floating. Similar to previous observations where TF cytoplasmic domain did not influence TF decryption, deletion of the TF cytoplasmic domain did not affect the lateral mobility of YFP-TF in FRAP analysis. To analyze decryption-induced changes in TF association with lipid domains, membrane fractions were isolated on a discontinuous Opti-Prep density gradient. Ionomycin treatment induced YFP-TF translocation from higher density, non-raft membrane fractions toward higher-buoyancy, raft fractions. Furthermore, the observed TF translocation into lipid rafts occurs without the formation of the quaternary complex with coagulation factors FVIIa, FXa and tissue factor pathway inhibitor (TFPI), as previously described. To address the functional modulation of TF procoagulant potential in response to lipid raft translocation, cell membrane cholesterol was either depleted with methyl-β-cyclodextrine (MβCD) or supplemented from an aqueous mixture of cholesterol-MβCD. Membrane cholesterol depletion decrypted TF in EC, likely through PS exposure, while also enhancing the procoagulant potential of ionomycin-decrypted TF. In contrast, cholesterol supplementation decreases the procoagulant potential of ionomycin-decrypted TF. Taken together, these observations support the model of tonic inhibition of TF procoagulant activity by the lipid raft environment. In conclusion, by live cell imaging we show that TF membrane mobility changes during calcium-ionophore induced decryption resulting in an immobilization of TF in lipid rafts. The immobilization is not influenced by the cytoplasmic domain of TF and does not require the formation of the TF-FVIIa-FXa-TFPI quaternary complex. Translocation into lipid rafts provides tonic inhibition of TF procoagulant potential and, as a consequence, we show for the first time that decrypting agents can also initiate negative regulation of TF procoagulant function. This negative feedback loop may help convert the decrypted TF back to its cryptic, low coagulant form. Disclosures: No relevant conflicts of interest to declare.
6
Liang, Hangyu. "The Battle of Advantage between Stealing and Decrypting the German Naval Enigma Key in the Battle of the Atlantic (1940-1941)." Transactions on Social Science, Education and Humanities Research 12 (August 29, 2024): 346–54. http://dx.doi.org/10.62051/1ny8bm98.
Testo completoAbstract (sommario):
In the early years of World War II, German Navy used Enigma to encode messages and prevent their intelligence by Allies. This work considers advantages of stealing and technically decrypting the German Naval Enigma key during the Battle of Atlantic from 1940-41; while Allies had already succeeded in decrypting the German Army Enigma prior to the war. The complexities of Naval Enigma introduced new challenges. Yet British codebreakers persisted with technological decryption — an approach they adopted following their earlier successes. However, details embedded within Naval Enigma plus changes implemented by Germans stood as obstacles against their progress. Solving the encryption required more than what had been previously done. This led them to take an unconventional path: stealing materials related to Enigma. This decision was resource-intensive but it paid off quickly in yielding results that were more practical and morally justifiable than pure decryption efforts made until then. The successful thefts like that which took place during the Lofoten Islands raid and in May 1941 when German ships were captured provided critical Enigma keys and quickened decryption, allowing Allies to obtain valuable intelligence, reroute convoys, and better address the U-boat threat. The work concludes that from a utilitarian perspective stealing Enigma materials was morally justified because it minimized Allied casualties. It also notes that the non-malicious intentions behind theft conformed to deontological principles, underscoring the ethical standing of British actions vis-a-vis Germans'. Ultimately, the British strategy of technological decryption combined with thefts led decisively to turning the tide against Nazis during Battle of Atlantic: hence this paper investigates whether we might perhaps say they were acting ethically (even if illegally) by stealing Enigma-related material.
7
Safitri, Sukmawati Indah, Muhammad Khudzaifah, and Mohammad Nafie Jauhari. "Penyandian Pesan Hybrid dengan Myszkowski Cipher dan Rivest, Shamir, Adleman (RSA)." Jurnal Riset Mahasiswa Matematika 2, no. 6 (September 1, 2023): 214–20. http://dx.doi.org/10.18860/jrmm.v2i6.22017.
Testo completoAbstract (sommario):
Classical and modern cryptography have advantages and disadvantages in securing text messages. Hybrid algorithms can combine two algorithms to produce a higher level of message security when compared to one type of algorithm. This study discusses a hybrid algorithm that combines Myszkowski Cipher and RSA. The purpose of this research is to obtain ciphertext that is more difficult to crack by cryptanalysis. The hybrid algorithm process is done by encrypting text messages with the Myszkowski Cipher algorithm then the key used in the Myszkowski Cipher algorithm are encrypted using the RSA algorithm with the equation . Then the ciphertext and cipherkey will be obtained in numerical. The decryption process is done by decrypting the cipherkey by specifying the value of as the private key so that using the equation . Next is by trying the value of until a value is obtained, after which decryption to the equation , then the process of decrypting ciphertext using Myszkowski Cipher can be done. The benefit of this research is can improve the security of messages because it applies the advantages of each algorithm in its encoding.
8
Patil, Vedika, Sakshi Jain, and Yogita Shah. "Secure Cryptography by Using Hash Application." Journal of Cyber Security in Computer System 1, no. 1 (May 11, 2022): 18–24. http://dx.doi.org/10.46610/jcscs.2022.v01i01.002.
Testo completoAbstract (sommario):
This project is basically design for ensuring security to all kinds of data format file such as pdf, text, images, audio, videos etc. This is carried out using various keys and hashing algorithm. This project basically helps the end user to protect his/her personal files from the unauthorized user and can also restrict its access to the limited people. This complete process is carried out in two methods that are encryption and decryption. Encryption process required varchar key while encryption the data file which convert the original file in to incomprehensible format. Further in decryption process, again by providing the same key file can be converted in to its original format. This helps the user to protect personal file on a public systems like schools, colleges, cyber cafes, hospitals, banks etc. The cryptography is acquired through various algorithms and keys. We are using a XOR key function and Hash function for encrypting and decrypting the data. In this certain key given by user will be XOR with the actual byte code of file for encryption and vice versa for decryption. This ensures to restrict the personal files on a public system.
9
Irwanto, Dola. "File Encryption and Decryption Using Algorithm Aes-128 Bit Based Website." MALCOM: Indonesian Journal of Machine Learning and Computer Science 4, no. 2 (April 1, 2024): 670–77. http://dx.doi.org/10.57152/malcom.v4i2.1305.
Testo completoAbstract (sommario):
Digital data security has become very important in the current information era. One way to maintain data security is to use encryption and decryption techniques. The Advanced Encryption Standard (AES) algorithm has been proven effective in protecting data with a high level of security. This research aims to implement the AES-128 bit algorithm for online file encryption and decryption via a website. The method used in this research includes developing a website that provides a user interface for uploading and encrypting files, as well as for decrypting files that have been previously encrypted. The AES-128 bit algorithm is used to carry out the file encryption and decryption process. Users can choose their own encryption key or use a random key generated by the system. The result of this research is a website that can be used to efficiently secure sensitive files using the AES-128 bit algorithm. By using this website, users can easily encrypt the files they want to protect and also decrypt files that have been encrypted previously. The security of user data is guaranteed through the use of strong encryption algorithms and well-managed keys.
10
Liu, Bao Long, Hua Chen, and Yi Guo. "Encrypted XML Data Query Processing with Range Query." Applied Mechanics and Materials 65 (June 2011): 241–45. http://dx.doi.org/10.4028/www.scientific.net/amm.65.241.
Testo completoAbstract (sommario):
Without decrypting the encrypted blocks, it is difficult to query encrypted XML data. Inspired by Query-Aware decryption scheme, the paper extends the scheme to support range query with value index. Value index is based on order preserving encryption. The testing results indicate that the proposed scheme can complete a correct query processing, and support range query.
11
Wadehra, Shivangi, Shivam Goel, and Nidhi Sengar. "AES Algorithm: Encryption and Decryption." International Journal of Trend in Scientific Research and Development Volume-2, Issue-3 (April 30, 2018): 1075–77. http://dx.doi.org/10.31142/ijtsrd11221.
Testo completo
12
Novianti, Chofifah Alfin, Muhammad Khudzaifah, and Mohammad Nafie Jauhari. "Kriptografi Hibrida Cipher Block Chaining (CBC) dan Merkle-Hellman Knapsack untuk Pengamanan Pesan Teks." Jurnal Riset Mahasiswa Matematika 3, no. 1 (October 31, 2023): 10–25. http://dx.doi.org/10.18860/jrmm.v3i1.22292.
Testo completoAbstract (sommario):
A secret message is a message that can only be seen by those who are entitled. In its delivery, a procedure is needed to keep the secret message secure, which is called cryptography. This research uses hybrid cryptography Cipher Block Chaining (CBC) and Merkle-Hellman Knapsack. The purpose of this research is to find out the encryption and decryption process of hybrid cryptography Cipher Block Chaining (CBC) and Merkle-Hellman Knapsack. The stages in this research use a qualitative approach with the library research method. In the encryption process with CBC, plaintext is encrypted first and the result called ciphertext. Furthermore, the key and Initialization Vector (IV) from CBC are encrypted using Merkle-Hellman Knapsack by generating a public key first and producing cipherkey. In the decryption process cipherkey is first decrypted using Merkle-Hellman Knapsack by calculating the inverse modulo . The decryption process continues by decrypting ciphertext using CBC. The result of securing messages using hybrid cryptography Cipher Block Chaining (CBC) and Merkle-Hellman Knapsack has a higher level of security than using only one cryptographic algorithm. As for the future, this research can be used to expand knowledge about securing text messages using hybrid cryptography algorithm CBC and Merkle-Hellman Knapsack.
13
Nugroho, Widhi Bagus, Ajib Susanto, Christy Atika Sari, Eko Hari Rachmawanto, and Mohamed Doheir. "A ROBUST AND IMPERCEPTIBLE FOR DIGITAL IMAGE ENCRYPTION USING CHACHA20." Jurnal Teknik Informatika (Jutif) 5, no. 2 (April 4, 2024): 397–404. https://doi.org/10.52436/1.jutif.2024.5.2.1470.
Testo completoAbstract (sommario):
In the current era, data security is mandatory because it protects our personal data from being used by irresponsible people. The objective of this research is to show the robustness of the method we propose to encrypt images using the chacha20 algorithm which is included in the symmetric encryption cryptography technique and uses one key for both encryption and decryption processes. we use the encryption method by reading the bits from a digital image which is processed using the chacha20 algorithm to get the results of the digital image encryption. The results of this study indicate that the Chacha20 algorithm is secure to use when encrypting and decrypting digital images. The average MSE value generated by the chacha20 algorithm is 0.1232. The average PSNR value is 57.4784. The average value of UACI is 49.99%. The average value of NPCR is 99.602%. The test values were acquired by executing encryption and decryption processes on 5 distinct colour digital images with different size. Additionally, this study displays histograms for the original digital image, as well as for the encrypted and decrypted digital images, illustrating the pixel distribution in each. The histogram also serves as material for analysis of the success of the encryption and decryption processes in digital images.
14
Lee, Sang-Un, and Myeong-Bok Choi. "Integer Factorization for Decryption." Journal of the Institute of Webcasting, Internet and Telecommunication 13, no. 6 (December 31, 2013): 221–28. http://dx.doi.org/10.7236/jiibc.2013.13.6.221.
Testo completo
15
Ceruzzi, P. "Decryption Day by Day." Science 264, no. 5161 (May 13, 1994): 990–92. http://dx.doi.org/10.1126/science.264.5161.990.
Testo completo
16
Butenas, Saulius, and Jolanta Krudysz-Amblo. "Decryption of tissue factor." Thrombosis Research 129 (May 2012): S18—S20. http://dx.doi.org/10.1016/j.thromres.2012.02.022.
Testo completo
17
Balasubramanian, Dr Kannan, M. Arun, and Dr K. R. Sekar. "An Improved RSA Algorithm for Enhanced Security." Indian Journal of Cryptography and Network Security 2, no. 2 (November 30, 2022): 1–4. http://dx.doi.org/10.54105/ijcns.b1421.112222.
Testo completoAbstract (sommario):
The security of the Rivest-Shamir-Adelman (RSA) public key algorithm depends on the difficulty of factoring the modulus calculated by multiplying two large prime numbers. The usefulness of the RSA public key algorithm lies in using one key for encryption and another key for decryption. However, a poor choice of the keys used in encryption and decryption can affect the security of the RSA cryptosystem. Many proposals have been made to modify the RSA cryptosystem in such a way that the attacks on the RSA cryptosystem can be overcome. In this article, we propose concealing the publicly disclosed parameters, the encryption key and the common modulus of the RSA cryptosystem by altering the values sent publicly. The values sent publicly are different from the one used in the algorithm which conceals the actual parameters to others. The implementation of this idea uses two different algorithms and randomly choosing between the algorithms. The choice of the algorithm is done using a random number generator and this choice of the algorithm has to be communicated so the decryptor uses the correct algorithm to decrypt the encrypted data. Finally we explore a faster way to implement the modular exponentiation algorithm used in the RSA encryption and decryption.
18
Dr., Kannan Balasubramanian, Arun M., and K. R. Sekar Dr. "An Improved RSA Algorithm for Enhanced Security." Indian Journal of Cryptography and Network Security (IJCNS) 2, no. 2 (November 30, 2022): 1–4. https://doi.org/10.54105/ijcns.B1421.112222.
Testo completoAbstract (sommario):
<strong>Abstract: </strong>The security of the Rivest-Shamir-Adelman (RSA) public key algorithm depends on the difficulty of factoring the modulus calculated by multiplying two large prime numbers. The usefulness of the RSA public key algorithm lies in using one key for encryption and another key for decryption. However, a poor choice of the keys used in encryption and decryption can affect the security of the RSA cryptosystem. Many proposals have been made to modify the RSA cryptosystem in such a way that the attacks on the RSA cryptosystem can be overcome. In this article, we propose concealing the publicly disclosed parameters, the encryption key and the common modulus of the RSA cryptosystem by altering the values sent publicly. The values sent publicly are different from the one used in the algorithm which conceals the actual parameters to others. The implementation of this idea uses two different algorithms and randomly choosing between the algorithms. The choice of the algorithm is done using a random number generator and this choice of the algorithm has to be communicated so the decryptor uses the correct algorithm to decrypt the encrypted data. Finally we explore a faster way to implement the modular exponentiation algorithm used in the RSA encryption and decryption.
19
Levchenko, V., I. Shulga, А. Romanyuk, and L. Bezverkha. "USE OF REMOTE GEOINFORMATION TECHNOLOGIES FOR FOREST PATHOLOGY MONITORING IN THE ZHYTOMYR POLISSYA." Innovative Solution in Modern Science 2, no. 38 (March 30, 2020): 20. http://dx.doi.org/10.26886/2414-634x.2(38)2020.3.
Testo completoAbstract (sommario):
Topical issues of remote assessment of the forest pathological condition of forests are substantiated, in particular, it is emphasized that today this type of decryption is the least developed link in the section of forest decoding. This is due to the unstable manifestation and diagnosis on the materials of aeronautical surveys of signs of deciphering trees and plantations of varying degrees of attenuation and drying. Forest decoding of aerospace imagery materials today is the process of recognizing aerial objects depicted on aerospace images and establishing their quantitative and qualitative characteristics. The subject of the work is the fundamental aspects of forest decoding, which in turn can be visual (eye, analytical), measuring, automatic (machine), as well as complex-analytical or automated (interactive). For all types of visual decoding of the investigated forest objects, as a rule, characterize, on the basis of decryption signs, its image on an aerial photo or space picture (on paper or computer screen) with the naked eye or by means of magnifying or stereoscopic devices. Therefore, methodological correctness and clarity in deciphering satellite images of forest arrays obtained through satellite communication channels is quite important today, using satellite and internet technologies. The purpose of the study is to study and systematize materials for deciphering geoinformation images of forests that were obtained by satellite sounding of forests in Ukraine as a whole, and in the Zhytomyr region in particular. The main methods of carrying out the works are the computational-analytical on the collection and processing of the results of space images of satellite sounding of forests located in the territory of Zhytomyr region. In addition, it should be noted that remote satellite sensing of forests enables, with the correct methodological decryption of space images, not only to monitor, but also to make a prediction of the spread of harmful organisms in the forests of Zhytomyr region. The main methods of carrying out the works are the computational-analytical on the collection and processing of the results of space images of satellite sounding of forests located in the territory of Zhytomyr region. In addition, it should be noted that remote satellite sensing of forests enables, with the correct methodological decryption of space images, not only to monitor, but also to make a prediction of the spread of harmful organisms in the forests of Zhytomyr region. According to the results of the work, it is established that the information from the aerospace image is read and analyzed by means of visual and logical devices of the decoder. Therefore, analytical decryption, and especially with the use of certified computer software, allows not only a high-quality reading of space images of forest covered areas of Zhytomyr region, but also to make a long-term forecast for the spread and spread of pests and diseases of the forest in a certain area. The scope of the research results are forestry enterprises of the Zhytomyr Regional Forestry and Hunting Directorate, Ecological and Naturalistic Centers, State environmental inspections including in the Zhytomyr region for space monitoring of the state of forest ecosystems, as well as conducting forestry and nature activities forest of Zhytomyr Polesie. The conclusions of the research are that in Zhytomyr Polissya, when measuring decryption, all or some of the parameters and characteristics of the decrypted objects are measured in pictures using mechanical, opto-mechanical, opto-electronic and other measuring instruments, devices, devices and systems. In analytical-measuring decryption, a visual-logical analysis of the image is combined with the measurement of different parameters of the decrypted objects. Automatic decryption is based on the recognition of spectral and morphometric characteristics of decrypted objects, their quantitative and qualitative indicators. In this case, the decryption process is performed using image processing equipment. The role of the individual is to create a system, define a specific task and process the captured information with the help of appropriate programs, and to maintain the normal functioning of the system. Automated (interactive) decryption combines elements of analytic-measuring, performed by the decryptor-operator on the image on the computer screen, with automatic decryption. In this case, the collected information is analyzed and processed using technical means of image processing with the active participation of the decoder. Depending on the location, the decryption can be field, camera (laboratory), aerial or combined. Field decryption is carried out directly on the ground by comparing the image on aerial or space images with nature. The field decryption method is the simplest and most accurate, but it takes a lot of time and labor. Cameral decryption is carried out in the laboratory, while reducing the cost of engineering staff and workers, there is an acceleration of work and a significant reduction in their cost. Camera decryption is always done with the help of additional cartographic, regulatory and other stock materials. Aero-visual decryption is performed by comparing images of identified objects in aerial or space imagery with terrain when flying on planes or helicopters. The analysis of the informative content of the shooting materials shows that their practical application is possible, as a rule, on the basis of a rational combination of methods of terrestrial and remote observations.Keywords: remote evaluation, forest pathological condition, aerial photos, aerial photos, remote satellite sounding of forests, signs of decryption, space monitoring of forests in Zhytomyr region.
20
Abu-Faraj, Mua’ad, Abeer Al-Hyari, and Ziad Alqadi. "A DUAL APPROACH TO DIGITAL AUDIO SIGNAL CRYPTOGRAPHY." Journal of Southwest Jiaotong University 57, no. 1 (February 28, 2022): 24–33. http://dx.doi.org/10.35741/issn.0258-2724.57.1.3.
Testo completoAbstract (sommario):
Nowadays, the digital audio file is considered one of the most important digital data that requires good protection because it may be confidential or of a special nature. This research paper will present an easy-to-implement method to apply the protection process to a very high degree. We will implement this method to prove its efficiency by reducing the encryption and decryption time and thus increasing the throughput of the encryption process. We will calculate the quality parameters to ensure that the quality of the speech is achieved during the encryption and decryption phases passed on the obtained experimental values of MSE and PSNR. The new addition in this research is a proposed method for protecting audio files, which is implemented by following simple, specific, and effective steps to eliminate the disadvantages and defects associated with using DES-based methods, especially in encrypting-decrypting audio files.
21
Smelova, Svetlana Stanislavovna, and Mikhail Sergeevich Zverkov. "Using of remote sensing data and field surveys to solve the problems of geobotanical mapping of reclaimed lands." Ekologiya i stroitelstvo, no. 2 (June 25, 2022): 23–33. https://doi.org/10.35688/2413-8452-2022-02-003.
Testo completoAbstract (sommario):
It is noted that geobotanical research is important among other various surveys carried out on reclaimed lands. With the increased availability of digital tools, it became possible to increase the information content and accuracy of these studies in solving mapping problems. Geobotanical surveys on unused lands and lands in unsatisfactory condition are especially relevant. The authors examined two landsof unused reclamation systems using near remote sensing of the Earth. Unmanned aerial vehicle «Hubsan Zino PRO» was used to obtain data. Geobotanical descriptions of vegetation are made in situ according to standard methods and have coordinates on the ground, which makes it possible to compare the image in the picture with specific vegetation for the purpose of subsequent extrapolation when decrypting orthophotomaps of the reclamation systems. Based on the results of decryption of orthophotomaps and office data processing, orthophotoschems and original maps with legends were compiled. Examples of decryption features are given.
22
Gao, Ming Hu, and Hong Yuan Huang. "A New Efficient Variant of the Batch RSA Cryptosystem." Advanced Materials Research 756-759 (September 2013): 2660–62. http://dx.doi.org/10.4028/www.scientific.net/amr.756-759.2660.
Testo completoAbstract (sommario):
This paper aims at speeding up Batch RSA decryption. The performance of Batch RSA decryption has directs relationship with the efficiency of the full-sized modular exponentiation implementation in the Exponentiation Phase. This paper proposes a variant (BS1PRSA-Batch RSA-S1 Multi-Power RSA) to improve the Batch RSA decryption performance. The experimental results show that the speed of the decryption has been substantially improved.
23
Jin, Zhihong. "A Brief Discussion on Data Encryption and Decryption Technology and Its Applications." Journal of Electronic Research and Application 9, no. 2 (March 28, 2025): 159–65. https://doi.org/10.26689/jera.v9i2.9915.
Testo completoAbstract (sommario):
With the rapid development of information technology, data security issues have received increasing attention. Data encryption and decryption technology, as a key means of ensuring data security, plays an important role in multiple fields such as communication security, data storage, and data recovery. This article explores the fundamental principles and interrelationships of data encryption and decryption, examines the strengths, weaknesses, and applicability of symmetric, asymmetric, and hybrid encryption algorithms, and introduces key application scenarios for data encryption and decryption technology. It examines the challenges and corresponding countermeasures related to encryption algorithm security, key management, and encryption-decryption performance. Finally, it analyzes the development trends and future prospects of data encryption and decryption technology. This article provides a systematic understanding of data encryption and decryption techniques, which has good reference value for software designers.
24
Gao, Ronghai, Jiwen Zeng, and Lunzhi Deng. "An efficient certificateless multi-receiver threshold decryption scheme." RAIRO - Theoretical Informatics and Applications 53, no. 1-2 (January 2019): 67–84. http://dx.doi.org/10.1051/ita/2019001.
Testo completoAbstract (sommario):
Threshold decryption allows only quorum cooperate users to decrypt ciphertext encrypted under a public key. However, such threshold decryption scheme cannot be applied well in this situation where all users have their public and private key pairs, but do not share any private keys corresponding to the public keys, such as mobile network featured with dynamic character. The direct way to achieve threshold decryption in this case is to divide the message into several pieces and then encrypt these pieces with the public keys of different users. However, this is very inefficient. Multireceiver threshold decryption scheme that could be applied efficiently in the above situation. Recently, some certificateless (ID-based) multireceiver threshold decryption (signcryption) schemes are introduced. But the bilinear pairings are used in most of the existing schemes. In this paper, we propose an efficient certificateless threshold decryption scheme using elliptic curve cryptography (ECC) without bilinear pairing. Performance analysis shows that the proposed scheme has lower computation cost than existing some threshold decryption schemes in both encryption and decryption process. Security analysis shows that our scheme is IND-CCA secure, and no one outside of selected receivers can disclose receivers identities, against the adversaries defined in CL-PKC system under the random oracle model.
25
Ruan, Wei Hua, and Qing Sheng Hu. "A Kind of Logarithmic Function Hardware Encryptor and Decryptor." Applied Mechanics and Materials 427-429 (September 2013): 2956–59. http://dx.doi.org/10.4028/www.scientific.net/amm.427-429.2956.
Testo completoAbstract (sommario):
This paper presents the realization of a kind of hardware encryptor and decryptor, which is based on Logarithmic Function principle. It shows how to design the encryption circuit and the decryption circuit by the sequential circuit. It had been designed in VHDL and simulated by Modelsim software, and then synthesized as well as realized on the FPGA chip EP2C5T144 by QuartusII software, last finished the test.
26
Vagizov, M. R., S. Y. Stepanov, Y. A. Petrov, and A. Y. Sidorenko. "Method of decryption and inventory of forest plantations by means of GIS AutoCad Map." Geoinformatika, no. 4 (2020): 20–27. http://dx.doi.org/10.47148/1609-364x-2020-4-20-27.
Testo completoAbstract (sommario):
The authors' article discusses the proposed methodology for the inventory of woody plants using the tools of geographic information systems. The tasks of the study included a tree inventory of plantations in the city, this task is of practical interest in the management and development of economic activities in an urbanized territory. To conduct sub-river decryption, the authors carried out work on creating thematic layers for each of the identified trees. The article describes a step-by-step methodology for formalizing the features of plantations within the framework of the system under consideration and the possible transition from classical taxation of woodlands to partially automated methods for decrypting plantations at the level of separately considered tree species for the benefit of garden and park farming. The article indicates the necessary characteristics for creating a database of plantings features using the Autocad Map GIS. Key words: GIS, plant inventory, remote methods, decryption of woody plants.
27
Song, Qinghua, Samira Khadir, Stéphane Vézian, Benjamin Damilano, Philippe de Mierry, Sébastien Chenot, Virginie Brandli, Romain Laberdesque, Benoit Wattellier, and Patrice Genevet. "Printing polarization and phase at the optical diffraction limit: near- and far-field optical encryption." Nanophotonics 10, no. 1 (July 27, 2020): 697–704. http://dx.doi.org/10.1515/nanoph-2020-0352.
Testo completoAbstract (sommario):
AbstractSecuring optical information to avoid counterfeiting and manipulation by unauthorized persons and agencies requires innovation and enhancement of security beyond basic intensity encryption. In this paper, we present a new method for polarization-dependent optical encryption that relies on extremely high-resolution near-field phase encoding at metasurfaces, down to the diffraction limit. Unlike previous intensity or color printing methods, which are detectable by the human eye, analog phase decoding requires specific decryption setup to achieve a higher security level. In this work, quadriwave lateral shearing interferometry is used as a phase decryption method, decrypting binary quick response (QR) phase codes and thus forming phase-contrast images, with phase values as low as 15°. Combining near-field phase imaging and far-field holographic imaging under orthogonal polarization illumination, we enhanced the security level for potential applications in the area of biometric recognition, secure ID cards, secure optical data storage, steganography, and communications.
28
Pronika, Pronika, and S. S. Tyagi. "Performance analysis of encryption and decryption algorithm." Indonesian Journal of Electrical Engineering and Computer Science 23, no. 2 (August 1, 2021): 1030–38. https://doi.org/10.11591/ijeecs.v23.i2.pp1030-1038.
Testo completoAbstract (sommario):
In this tumultuous 21st century, we are surrounding by lots of applications such as social media websites all over the internet or this era can also define as digital era in which everything is accessible over the internet. There are billions of internet users all over the world and they share their information over the same and because of this lots of people intentionally trying to steal the confidential data of other people, so it is always advisable to share and store data in encrypted form. In this paper, we discuss different encryption and decryption algorithms and compare them with respect to time take by these algorithms for encrypting and decrypting different sizes of files.
29
Chiriac, Liubomir, Aurel Danilov, and Violeta Bogdanova. "Encryption and decryption algorithm based on the Latin groupoid isotopes." Acta et commentationes Ştiinţe Exacte şi ale Naturii 14, no. 2 (December 2022): 117–31. http://dx.doi.org/10.36120/2587-3644.v14i2.117-131.
Testo completoAbstract (sommario):
This paper studies encryption and decryption algorithm, using isotopes of Latin groupoid. Cryptographic algorithms are computationally intensive processes which consume large amount of CPU time and space during the process of encryption and decryption. The goal of this paper is to study the encryption and decryption algorithm with the help of the concept of Latin groupoid and notion of isotopes. The proposed algorithm is safe in the implementation process and can be verified without much difficulty. An example of encryption and decryption based on the atin groupoid and the concept of isotopy is examined.
30
Brovets, Andrey I. "The deciphering stimulus of a compound word: the problem of definition and description." Russian Language Studies 17, no. 4 (December 15, 2019): 487–501. http://dx.doi.org/10.22363/2618-8163-2019-17-4-487-501.
Testo completoAbstract (sommario):
The article discusses the concept of abbreviated decryption of stimulus, which refers to a method of rolling out a contracted construct abbreviation in an equivalent phrase. The study is relevant because it implements and describes a new approach to abbreviation interpretation, stating that a complex word in a synchronous section of the language usually corresponds not to not, but to several equivalent phrases that appear as a result of actualizing alternative decryption stimuli of a contracted abbreviation construct in the text, while existing dictionaries of complex words give only one phrase as an equivalent, usually with a relative adjective. The purpose of the article is to define and describe the system of decoding stimuli of abbreviations in the Russian language. The novelty of this study lies in the fact that it states the existence of a branched system of equivalent phrases in the language, where parallel multiple decryption of a contracted construct of the abbreviation is carried out. The practical significance of the results is the possibility to use them in compiling dictionaries of abbreviations, as well as in translating and editing. The article describes two principles of interpreting decryption stimuli - cognitive and formal. It is concluded that cognitive bases of allocating decryption stimulus are associated with such parameters as stereotypy, uniqueness, regularity. Under the decryption stimulus in this case we understand background knowledge, provoking a particular variant of rolling out a contracted construct of the abbreviation, the stereotype of its explication. As a result of the study, we found that a presentative decryption stimulus is the most stereotyped one. The formal approach defines the decryption stimulus as specific, i.e. empirically observed equivalent phrase in the form of a contracted construct abbreviation in the texts. The perspectives of further research in this area is clarification of the classification of decryption stimuli and on its basis methods of their forecasting.
31
Zhang, Kai, Yanping Li, Yun Song, Laifeng Lu, Tao Zhang, and Qi Jiang. "A Traceable and Revocable Multiauthority Attribute-Based Encryption Scheme with Fast Access." Security and Communication Networks 2020 (December 22, 2020): 1–14. http://dx.doi.org/10.1155/2020/6661243.
Testo completoAbstract (sommario):
Multiauthority ciphertext-policy attribute-based encryption (MA-CP-ABE) is a promising technique for secure data sharing in cloud storage. As multiple users with same attributes have same decryption privilege in MA-CP-ABE, the identity of the decryption key owner cannot be accurately traced by the exposed decryption key. This will lead to the key abuse problem, for example, the malicious users may sell their decryption keys to others. In this paper, we first present a traceable MA-CP-ABE scheme supporting fast access and malicious users’ accountability. Then, we prove that the proposed scheme is adaptively secure under the symmetric external Diffie–Hellman assumption and fully traceable under the q -Strong Diffie–Hellman assumption. Finally, we design a traceable and revocable MA-CP-ABE system for secure and efficient cloud storage from the proposed scheme. When a malicious user leaks his decryption key, our proposed system can not only confirm his identity but also revoke his decryption privilege. Extensive efficiency analysis results indicate that our system requires only constant number of pairing operations for ciphertext data access.
32
Pronika, Pronika, and S. S. Tyagi. "Performance analysis of encryption and decryption algorithm." Indonesian Journal of Electrical Engineering and Computer Science 23, no. 2 (August 1, 2021): 1030. http://dx.doi.org/10.11591/ijeecs.v23.i2.pp1030-1038.
Testo completoAbstract (sommario):
<p class="Abstract">In this tumultuous 21st century, we are surrounding by lots of applications such as social media websites all over the internet or this era can also define as digital era in which everything is accessible over the internet. There are billions of internet users all over the world and they share their information over the same and because of this lots of people intentionally trying to steal the confidential data of other people, so it is always advisable to share and store data in encrypted form. In this paper, we discuss different encryption and decryption algorithms and compare them with respect to time take by these algorithms for encrypting and decrypting different sizes of files.</p>
33
Chen, Chao, Hongying Zhang, and Bin Wu. "Image Encryption Based on Arnod Transform and Fractional Chaotic." Symmetry 14, no. 1 (January 17, 2022): 174. http://dx.doi.org/10.3390/sym14010174.
Testo completoAbstract (sommario):
An image encryption and decryption algorithm based on Arnod transform and fractional chaos is proposed in this work for solving the problem that the encrypted image is easily cracked and the content of the decrypted image is distorted. To begin with, the Arnold transform is used to encrypt, so that the spatial confidence of the original image has been comprehensively disturbed. Secondly, the XOR involving the fractional order chaotic sequence is used to encrypt. The key sequence is dynamically generated to ensure the randomness and difference of key generation. When decryption is required, the first decryption is performed using the key and XOR. Then, the second decryption is carried out by using the inverse Arnold transform, and finally the decrypted image is obtained. Experimental results show that the improved algorithm has achieved a better performance in encryption and decryption.
34
Ayush, Mittal, and Kumar Gupta Ravindra. "A Cryptographic Technique Involving Finite Fields and Logical Operators." Indian Journal of Science and Technology 13, no. 3 (March 28, 2020): 316–28. https://doi.org/10.17485/ijst/2020/v13i03/148904.
Testo completoAbstract (sommario):
Abstract <strong>Objectives:</strong> The aim of this study is to propose a new encryption/ decryption technique which involves logical operators and finite field. <strong>Methods/statistical analysis:</strong> The study proposes a new method for encrypting/decrypting messages which use logical operator XOR and finite field. The method involves sharing common keys between sender and receiver. Then converting plain text into ASCII values bit-form. XORing this with random matrix and then using finite field GF (2^5) for converting it into polynomial elements. These elements are then used for creating cipher text. Decrypting process is reverse of encrypting process. <strong>Findings:</strong> The technique uses 6×6 matrix form for encrypting messages which can be very difficult to crack with known plain text attacks. The use of XOR operations displaces bits in matrix which makes it difficult to break by brute force technique. <strong>Application/improvements:</strong> The technique is useful in areas where sensitive information is to be transferred like banking, military services. If the private key has got into third-party hands, the damage can be huge. To overcome this, the proposed algorithm can be used by randomizing the keys used for encrypting the messages which will provide different keys for encrypting different data blocks. <strong>Keywords:</strong> Encryption, Decryption, Finite Fields, Logical Operator XOR.
35
Al-Fayoumi, Mohammed, and Sttar Aboud. "Blind Decryption and Privacy Protection." American Journal of Applied Sciences 2, no. 4 (April 1, 2005): 873–76. http://dx.doi.org/10.3844/ajassp.2005.873.876.
Testo completo
36
Hewage, Chaminda, Ambikesh Jayal, Glenn Jenkins, and Ryan J. Brown. "A Learned Polyalphabetic Decryption Cipher." SNE Simulation Notes Europe 28, no. 4 (December 2018): 141–48. http://dx.doi.org/10.11128/sne.28.tn.10441.
Testo completo
37
SIROMONEY, RANI, K. G. SUBRAMANIAN, and P. J. ABISHA. "ENCRYPTION-DECRYPTION TECHNIQUES FOR PICTURES." International Journal of Pattern Recognition and Artificial Intelligence 03, no. 03n04 (December 1989): 497–503. http://dx.doi.org/10.1142/s0218001489000371.
Testo completoAbstract (sommario):
Language theoretic public key cryptosystems for strings and pictures are discussed. Two methods of constructing public key cryptosystems for the safe transmission or storage of chain code pictures are presented; the first one encrypts a chain code picture as a string and the second one as a two-dimensional array.
38
Cheatham, Tom. "MESSAGE DECRYPTION AND SPELLING CHECKERS." Cryptologia 11, no. 2 (April 1987): 115–18. http://dx.doi.org/10.1080/0161-118791861901.
Testo completo
39
VS, Barath. "Secured Folder Encryption and Decryption." International Journal for Research in Applied Science and Engineering Technology 12, no. 11 (November 30, 2024): 121–29. http://dx.doi.org/10.22214/ijraset.2024.64953.
Testo completoAbstract (sommario):
In today's digital world, when sensitive data is routinely targeted by thieves, strong encryption technologies are critical for preventing breaches and ransomware attacks. Our research solves this need by creating a Secure Folder Encryption System that employs AES-GCM (Advanced Encryption Standard - Galois/Counter Mode) and HMAC (Hash-based Message Authentication Code) to secure data confidentiality and integrity when stored on cloud servers. Drawing on research on ECG image file encryption using ECDH and AES-GCM, we choose AES-GCM for its high resistance to manipulation and unauthorized access, while ECDSA (Elliptic Curve Digital Signature Algorithm) improves data authenticity. This method encrypts files before uploading them to the cloud, data is secure even if intercepted. In addition to a user friendly interface, the system is tuned for performance, evaluating encryption and decryption times and file sizes. Given the concerning trend of stolen encrypted data being sold on the dark web, as reported in recent headlines, our project offers a secure and effective method for safeguarding critical information in cloud storage
40
Encinas, L. Hernández, J. Muñoz Masqué, and A. Queiruga Dios. "Large decryption exponents in RSA." Applied Mathematics Letters 16, no. 3 (April 2003): 293–95. http://dx.doi.org/10.1016/s0893-9659(03)80046-0.
Testo completo
41
Millen, Jonathan. "On the freedom of decryption." Information Processing Letters 86, no. 6 (June 2003): 329–33. http://dx.doi.org/10.1016/s0020-0190(03)00211-4.
Testo completo
42
Rao, L. Vijaya Mohan. "Tissue factor mechanisms of decryption." Frontiers in Bioscience E4, no. 4 (2012): 1513–27. http://dx.doi.org/10.2741/e477.
Testo completo
43
Devi, SistlaVasundhara, and Harika Devi Kotha. "AES encryption and decryption standards." Journal of Physics: Conference Series 1228 (May 2019): 012006. http://dx.doi.org/10.1088/1742-6596/1228/1/012006.
Testo completo
44
Nayak, Nikhilesh, Akshay Chandak, Nisarg Shah, and B. Karthikeyan. "Encryption and decryption using FPGA." IOP Conference Series: Materials Science and Engineering 263 (November 2017): 052030. http://dx.doi.org/10.1088/1757-899x/263/5/052030.
Testo completo
45
Bhargava, Puvvula, and Kuppam Hari Kishan. "144-BIT Encryption/Decryption Technique." International Journal of Computer Applications 1, no. 21 (February 25, 2010): 67–74. http://dx.doi.org/10.5120/53-647.
Testo completo
46
Rathi, Amit, Raj Saini, Abhinav Mishra, Vivek Kumar Sharma, and Jagbeer Singh. "File Encryption and Decryption Software." Journal of Computer Based Parallel Programming 8, no. 1 (April 19, 2023): 5–13. http://dx.doi.org/10.46610/jocpp.2023.v08i01.002.
Testo completoAbstract (sommario):
Since the advent of information technology (the internet) a few decades ago, there have been many changes made to the way information is shared and moved between people, between nations, and throughout the whole world. Information security experts are growing worried about how to solve the issue of information "theft," which has been for a long. Today, it is clear that information security is the solution due to the present spread of several recently developed cryptanalysis techniques. To create a file that can be hashed and firmly decrypted by reliable file storage software, our technique in this work is to use the encryption methods of AES and MD5 after a few steps in the encryption process. The key feature of our programme is the addition of those components throughout the encryption process to create a hashed result that is intertwined and immune to eavesdroppers' nasty techniques. Since any form of a file, including binary, text, and other types, may be effectively encrypted, the encryption results have demonstrated that the programme can provide a broad range of file encryption.
47
Ladda, Priyanka, Shyama Yadav, and Shashank Vyas. "Decryption and Encryption of Data." Journal of Nonlinear Analysis and Optimization 14, no. 01 (2023): 86–93. http://dx.doi.org/10.36893/jnao.2023.v14i1.087-093.
Testo completoAbstract (sommario):
In the digital age, the security of data has become a paramount concern. This research paper explores the fundamental concepts and practical applications of encryption and decryption as essential tools for ensuring data security. It delves into the historical evolution of encryption methods and the mathematical foundations of cryptographic algorithms. The paper provides a comprehensive overview of popular encryption algorithms, key management techniques, and the role of encryption in protecting data at rest, in transit, and during processing. Decryption techniques and potential vulnerabilities are also discussed, along with cryptographic attacks and countermeasures. The legal and ethical implications of encryption, including issues related to privacy and government access, are examined in the context of recent legislative developments. Real-world case studies illustrate the impact of encryption on cybersecurity incidents. The paper concludes by looking ahead to future trends in encryption and decryption technologies, addressing emerging challenges and opportunities in data security.
48
Salmanov, V. "POLYMORPHİC ENCRYPTİON AND DECRYPTİON ALGORİTHMS." Sciences of Europe, no. 98 (August 8, 2022): 76–79. https://doi.org/10.5281/zenodo.6973815.
Testo completoAbstract (sommario):
Based on the analysis, an algorithm for improving the development of automated distance learning systems is considered. The algorithm, designed to be integrated into existing educational systems, has been designed to be supported during use outside of robust computing systems. When preparing software based on the proposed algorithm, new data encryption technologies can be used. This completely eliminates the need for hardware.
49
Shivangi, Wadehra, Goel Shivam, and Sengar Nidhi. "AES Algorithm Encryption and Decryption." International Journal of Trend in Scientific Research and Development 2, no. 3 (December 16, 2019): 1075–77. https://doi.org/10.31142/ijtsrd11221.
Testo completoAbstract (sommario):
Advanced Encryption Standard AES algorithm is one of the most common and widely used symmetric block cipher algorithm. This algorithm has its own particular structure to encrypt and decrypt sensitive data and is applied in hardware and software, all over the world. It is extremely difficult for hackers to get the real data when encrypting by AES algorithm. In AES algorithm, encryption and decryption involves a number of rounds that depends on the length of the key and the number of block columns. So, to improve the strength of the AES the number of rounds is increased. Till date there is not any evidence to crack this algorithm. AES has the ability to deal with three different key sizes such as AES 128, 192 and 256 bit and each of this ciphers has 128 bit block size. This paper will provide an overview of AES algorithm and explain several crucial features of this algorithm in detail. Shivangi Wadehra | Shivam Goel | Nidhi Sengar "AES Algorithm: Encryption and Decryption" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-2 | Issue-3 , April 2018, URL: https://www.ijtsrd.com/papers/ijtsrd11221.pdf
50
Kumar, Dilip, Manoj Kumar, and Gaurav Gupta. "An Outsourced Decryption ABE Model using ECC in Internet of Things." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 29, no. 06 (December 2021): 949–64. http://dx.doi.org/10.1142/s0218488521500422.
Testo completoAbstract (sommario):
Internet of Things (IoT) is a modern technology that is applicable almost everywhere nowadays. Everything is connected to the Internet in the modern digital era. IoT is a collection of things that are interconnected to share information. Devices connected to IoT networks have some limitations in performing heavy computational tasks because of the availability of less computational and battery power. Attribute Based Encryption (ABE) is a modern public-key cryptographic technique that provides privacy with access control. The bilinear map is an expensive operation that is used in most of the ABE schemes. Elliptic Curve Cryptography (ECC) is an alternative for bilinear pairing to reduce the computation of encryption and decryption in ABE schemes. The process of encryption and decryption of ABE is a heavy computational task for resource-constrained devices. In this paper, an outsourcing-based decryption of ABE using ECC is proposed to reduce the decryption overhead of devices that have limited computational resources. Our scheme divides the computation of the decryption of ABE into two stages: first, the partial decryption of ciphertext in the cloud server, and second, the final decryption of partially decrypted ciphertext by the data user to retrieve the original message. This scheme is secure against the malicious cloud server by adding a blinding factor into the secret to be shared. The blinding factor is shared with intended users through attribute authority. The experimental results demonstrate that our scheme can reduce the decryption complexity and save the computational time of devices, compared to the existing schemes. Thus the proposed scheme is applicable for lightweight devices used in IoT.