To see the other types of publications on this topic, follow the link: Data encryption.
Dissertations / Theses on the topic 'Data encryption'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Data encryption.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Meissner, Robert. "Data Encryption Standard." Universitätsbibliothek Chemnitz, 2002. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-200200590.
Full textAbstract:
Die heutige Informationsgesellschaft hat die Formen des menschlichen Handelns in vielen Bereichen des taeglichen Lebens veraendert. Die Moeglichkeit, Informationen über das Internet auszutauschen, draengt konventionelle Kommunikationsformen immer mehr in den Hintergrund. Gerade in den Bereichen eBusiness und ePayment, welche aufgrund der zunehmenden Globalisierung unabdingbar sind, spielen dabei die Sicherheit und die Authentitaet der uebertragenen Daten eine wichtige Rolle.
Meine Seminararbeit stellt den Data Encryption Standard (DES) in seiner Funktionsweise vor, diskutiert kritisch dessen Sicherheit und gibt einen Ausblick auf neue Verschluesselungstechnologien, welche im Begriff sind, den Data Encryption Standard und seine verschiedenen Versionen abzuloesen.
2
Fahmy, A. "Data encryption of communication data links." Thesis, University of Kent, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.385199.
Full text
3
Topsholm, Max. "Transactional Data Encryption View." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-147885.
Full textAbstract:
This thesis is about the theory behind and software development of TDE View. The application produces a graphical presentation containing graphical objects, such as charts and tables, which display real time data derived from online and currently available services in Swedbank. TDE View is a long term replacement of the previous solution, TDE System Monitor, the purpose of TDE View is to provide the ability to preview the aforementioned features online instead of local deployment. Moreover, the thesis will cover aspects regarding concepts and ideas in transferring data from different hosts in a specific network. (This report is written in English.)
4
Luque, González Jorge, and Fernandez Ignacio Arenchaga. "Data Encryption on a Network." Thesis, Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-9352.
Full textAbstract:
In this project you can find a study about different encryption algorithms, which are use to safeguard the information on messages over the network. We have developed a client-server application which will send information through the network which has to be secured. There are two kinds of encryption algorithms, the symmetric and the asymmetric key algorithms. Both were used to establish the communication, the asymmetric algorithm (RSA) is used to set up a symmetric key and then, all the communication process is done only with the symmetric algorithm (Blowfish).En este proyecto encontraras un estudio sobre diferentes algoritmos de encriptación, que son usados para salvaguardar la información en mensajes por la red. Además hemos desarrollado una aplicación cliente-servidor que enviara información a través de la red de forma segura. Hay dos tipos de algoritmos de encriptación, los simétricos y los asimétricos. Ambos tipos de algoritmos son utilizados para establecer la comunicación, el asimétrico (RSA) es utilizado para establecer la clave del simétrico y a partir de entonces se utilizara exclusivamente el algoritmo simétrico (Blowfish).
5
Yu, Lingfeng. "Multidimensional data encryption with virtual optics /." View Abstract or Full-Text, 2003. http://library.ust.hk/cgi/db/thesis.pl?MECH%202003%20YU.
Full text
6
Islam, Naveed. "Cryptography based Visual Data Protection." Thesis, Montpellier 2, 2011. http://www.theses.fr/2011MON20178/document.
Full textAbstract:
La transmission de données multimédia sur les réseaux sécurisés a une croissance exponentielle grâce aux progrès scientifique dans les technologies de l'information et de la communication. La sécurité des données dans certaines applications comme le stockage sécurisé, l'authentification, la protection des droits d'auteurs, la communication militaire ou la visioconférence confidentielles, nécessitent de nouvelles stratégies en matière de transmission sécurisée. Deux techniques sont couramment utilisées pour la transmission sécurisée de données visuelles, à savoir : la cryptographie et la stéganographie. La cryptographie sécurise les données en utilisant des clés secrètes afin de rendre les données illisibles, la stéganographie, elle, vise à insérer des données cruciales dans des signaux porteurs anodins.De plus, pour la confiance mutuelle et les systèmes distribués, le partage sécurisé de ressources est souvent une garantie suffisante pour les applications de communication. L'objectif principal de cette thèse est de réaliser une protection des données visuelles, en particulier les images numériques, par le biais des techniques modernes de cryptographie. Dans ce contexte, deux objectifs de recherche ont été développés durant ces travaux de thèse.La première partie de notre travail se concentre sur la sécurité des images numériques dans un environnement partagé. Ensuite, la deuxième partie porte sur l'intégrité des données visuelles pendant une transmission sécurisée.Nous avons proposé un nouveau schéma de partage des images qui exploite les propriétés d'addition et de multiplication homomorphique de deux crypto systèmes à clé publique largement utilisés : les algorithmes RSA et Paillier. Dans les schémas traditionnels de partage sécurisé, le ``dealer'' partitionne le secret en parties et le distribue à chacun des autres acteurs. Ainsi, aucun des acteurs impliqués ne participe à la création du partage sécurisé, mais il est toujours possible que le ``dealer'' transmette des données malveillantes. Au contraire, l'approche proposée utilise le système de partage de secret d'une manière qui limite l'influence du ‘‘dealer'' sur le protocole en permettant à chaque acteur de participer.La deuxième partie de ces travaux de thèse met l'accent sur l'intégrité des données visuelles lors de la transmission. L'intégrité des données signifie que les données gardent leurs structures complètes au cours d'une opération numérique comme le stockage, le transfert ou la récupération. Le changement d'un seul bit de données cryptées peut avoir un impact catastrophique sur les données décryptées. Nous abordons le problème de correction d'erreurs dans les images cryptées en utilisant le chiffrement à clé symétrique AES (Advanced Encryptions Standard) suivant différents modes. Trois mesures sont proposées afin d'exploiter les statistiques locales des données visuelles et l'algorithme de chiffrement, dans l'objectif de corriger les erreurs efficacementDue to the advancements in the information and communication technologies, the transmission of multimedia data over secure or insecure communication channels has increased exponentially. The security of data in applications like safe storage, authentications, copyright protection,remote military image communication or confidential video-conferencing require new strategies for secure transmission. Two techniques are commonly used for the secure transmission of visual data, i.e. cryptography and steganography. Cryptography achieves security by using secret keysto make the data illegible while steganography aims to hide the data in some innocent carrier signal. For shared trust and distributed environment, secret sharing schemes provide sufficient security in various communication applications. The principal objective of this thesis is to achieveprotection of visual data especially images through modern cryptographic techniques. In this context, the focus of the work in perspective, is twofolded. The first part of our work focuses on the security of image data in shared environment while the second part focuses on the integrity ofimage data in the encrypted domain during transmission.We proposed a new sharing scheme for images which exploits the additive and multiplicative homomorphic properties of two well known public key cryptosystems, namely, the RSA and the Paillier. In traditional secret sharing schemes, the dealer partitions the secret into shares and distributethe shares to each of the player. Thus, none of the involved players participate in the creation of the shared secret and there is always a possibilitythat the dealer can cheat some player. On the contrary, the proposed approach employs the secret sharing scheme in a way that limits the influence of the dealer over the protocol by allowing each player to participate. The second part of our thesis emphasizes on the integrity of visual data during transmission. Data integrity means that the data have its complete structure during any operation like storage, transfer or retrieval. A single bit change in encrypted data can have catastrophic impact over the decrypted data. We address the problem of error correction in images encrypted using symmetric key cryptosystem of the Advanced Encryption Standard (AES) algorithm. Three methods are proposed to exploit the local statistics of the visual data and the encryption algorithm to successfully correct the errors
7
Jones, John W. "Data encryption based on the logarithm problem." Thesis, University of Ottawa (Canada), 1986. http://hdl.handle.net/10393/4825.
Full text
8
Clevenger, Mark Allen. "Data encryption using RSA public-key cryptosystem." Virtual Press, 1996. http://liblink.bsu.edu/uhtbin/catkey/1014844.
Full textAbstract:
The RSA data encryption algorithm was developed by Ronald Rivest, Adi Shamir and Leonard Adelman in 1978 and is considered a de facto standard for public-key encryption. This computer science thesis demonstrates the author's ability to engineer a software system based on the RSA algorithm. This adaptation of the RSA encryption process was devised to be used on any type of data file, binary as well as text. In the process of developing this computer system, software tools were constructed that allow the exploration of the components of the RSA encryption algorithm. The RSA algorithm was further interpolated as a method of providing software licensing, that is, a manner in which authorization to execute a particular piece of software can be determined at execution time. This document summarizes the RSA encryption process and describes the tools utilized to construct a computer system based on this algorithm.Department of Computer Science
9
Moulianitakis, Feidias, and Konstantinos Asimakopoulos. "Benchmarking Framework for Transparent Data Encryption Systems." Thesis, Luleå tekniska universitet, Institutionen för system- och rymdteknik, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-75814.
Full textAbstract:
In the digital world of today, information is always at risk regardless of its state, at rest or in transit. Cryptography is the technology that promises to address the security issues that emerge. Hence, it was a reasonable consequence to introduce cryptography to databases. However, manually encrypting and decrypting data along with the key management is a burden for the regular user of a database. The need for removing this burden gave birth to Transparent Data Encryption (TDE). TDE technology is widely available nowadays and a number of vendors have developed their own solutions for protecting data at rest in a transparent way to the end user. However, cryptographic operations are resource intensive and introduce an overhead to the computational operations. The burden of cryptographic operations has drawn the interest of both academia and the industry for a long time before TDE appeared on the horizon. Hence, a lot of research has been done to measure the performance impact of those operations. Despite the extensive study for the performance of cryptographic algorithms, the performance of the TDE systems and the add-on computational burden for the introduced encryption has not yet been studied thoroughly. As a result, the current Thesis project tries to develop a theoretical benchmarking framework that evaluates the performance of Transparent Data Encryption systems. The study is conducted utilizing the Design Research methodology. The developed benchmarking framework focuses on the basic performance metrics of TDE systems, Elapsed time, CPU time and Hard Disk memory consumption. These metrics are calculated for varying key lengths, encryption algorithms and table sizes. The framework follows a five - step procedure that includes the creation of topology - lab environment, creation of databases and definition of scenarios, activation of TDE feature, sequencial execution of scenarios and analysis of the results. The developed framework is evaluated by applying it on real TDE systems.
10
Uehara, Takeyuki. "Contributions to image encryption and authentication." Access electronically, 2003. http://www.library.uow.edu.au/adt-NWU/public/adt-NWU20040920.124409/index.html.
Full text
11
Kalibjian, Jeff. "Data Security Architecture Considerations for Telemetry Post Processing Environments." International Foundation for Telemetering, 2017. http://hdl.handle.net/10150/626950.
Full textAbstract:
Telemetry data has great value, as setting up a framework to collect and gather it involve significant costs. Further, the data itself has product diagnostic significance and may also have strategic national security importance if the product is defense or intelligence related. This potentially makes telemetry data a target for acquisition by hostile third parties. To mitigate this threat, data security principles should be employed by the organization to protect telemetry data. Data security is in an important element of a layered security strategy for the enterprise. The value proposition centers on the argument that if organization perimeter/internal defenses (e.g. firewall, IDS, etc.) fail enabling hostile entities to be able to access data found on internal company networks; they will be unable to read the data because it will be encrypted.
After reviewing important encryption background including accepted practices, standards, and architectural considerations regarding disk, file, database and application data protection encryption strategies; specific data security options applicable to telemetry post processing environments will be discussed providing tangible approaches to better protect organization telemetry data.
12
Nordwall, Jennifer. "Software Encryption in Mobile Devices." Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-18656.
Full text
13
Maniccam, Suchindran S. "Image-video compression, encryption and information hiding /." Online version via UMI:, 2001.
Find full text
14
Lazebna, Anastasia Dmitrivna, and Анастасія Дмитрівна Лазєбна. "The problem of data encryption in international relations." Thesis, National Aviation University, 2021. https://er.nau.edu.ua/handle/NAU/51653.
Full textAbstract:
1. Утечка секретных документов “угрожает безопасности США” [Електронний ресурс]. Режим доступу: https://www.bbc.com/russian/
international/2010/07/100721_us_wikileaks
2. Blockchain Explained [Електронний ресурс]. Режим доступу: https:// www.investopedia.com/terms/b/blockchain.asp
3. Шифрование файлов[Електронний ресурс]. Режим доступу: https:// www.eset.com/ua-ru/support/information/entsiklopediya-ugroz/shifrovaniye/The problem of leaking confidential information and hacking the database is very relevant to contemporary international relations. It is often the case that political differences lead to information struggles for truth and power. The Government could not contain the situation at an adequate level, and the media made matters worse, at such times it was no longer possible to control the citizens of one country or another, and then the hackers began to attack. A prime example is the White House, which is attacked every year, and it’s getting harder to contain attacks. This occurred in 2010. The Wikileaks site specializes in publishing secret documents and information which became available as a result of «leaks». More than 90,000 reports and intelligence reports published there on the conflict in Afghanistan were produced during the last six years of the military operation, during which more than 300 British and more than 1,000 American soldiers were killed. This leak of classified information was perhaps the largest in US history.
Проблема витоку конфіденційної інформації та злому бази даних дуже актуальна для сучасних міжнародних відносин. Часто буває, що політичні розбіжності ведуть до інформаційної боротьби за правду та владу. Уряд не міг стримати ситуацію на належному рівні, а ЗМІ погіршили ситуацію, і в такі часи було неможливо контролювати громадян тієї чи іншої країни, і тоді хакери почали атакувати. Яскравий приклад - Білий дім, на якого щороку нападають, і стримувати напади стає все важче. Це сталося в 2010 році. Сайт Wikileaks спеціалізується на публікації секретних документів та інформації, які стали доступними в результаті «витоків». За останні шість років воєнної операції, під час якої загинуло понад 300 британських та понад 1000 американських солдатів, було опубліковано понад 90 000 звітів та звітів розвідки, опублікованих там. Цей витік секретної інформації був чи не найбільшим в історії США.
15
Meißner, Robert. "Data Encryption Standard (DES) [Einführung, Funktionsweise, Risiken, Alternativen] /." [S.l. : s.n.], 2002. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB10324753.
Full text
16
Lim, Jen A. "The security of arithmetic coding encryption schemes." Thesis, Queensland University of Technology, 1997. https://eprints.qut.edu.au/36834/1/36834_Lim_1997.pdf.
Full textAbstract:
This thesis examines a variety of arithmetic coding encryption schemes proposed in existing literature and the attacks against these schemes. A classification scheme for arithmetic coding encryption schemes is proposed and a new adaptive brute-force attack is described. Under certain conditions, it is shown that an adaptive brute-force attack is capable of recovering the key. The way in which the arithmetic coding encryption scheme is initialized appears to make a significant difference to the security of the system as a whole. Although there are modes of operation which are resistant to the adaptive brute-force attack, the security of arithmetic coding encryption schemes is not assured. The results are not conclusive, but are biased toward insecurity.
A periodic model resetting scheme was proposed as a means of improving security. However, empirical results indicate that any improvement in security is offset by an equivalent loss in compression performance. This result negates the benefits of unifying compression and encryption.
Currently, there is insufficient evidence to recommend arithmetic coding encryption schemes as an efficient and secure scheme for the unification of compression and encryption. The fact that an apparently small difference between the key initialization schemes can make such a dramatic difference to the security of the system is indication that more research is required. Consequently, arithmetic coding encryption schemes are not recommended for secure communication purposes.
17
Yu, Shucheng. "Data Sharing on Untrusted Storage with Attribute-Based Encryption." Digital WPI, 2010. https://digitalcommons.wpi.edu/etd-dissertations/321.
Full textAbstract:
"Storing data on untrusted storage makes secure data sharing a challenge issue. On one hand, data access policies should be enforced on these storage servers; on the other hand, confidentiality of sensitive data should be well protected against them. Cryptographic methods are usually applied to address this issue -- only encrypted data are stored on storage servers while retaining secret key(s) to the data owner herself; user access is granted by issuing the corresponding data decryption keys. The main challenges for cryptographic methods include simultaneously achieving system scalability and fine-grained data access control, efficient key/user management, user accountability and etc. To address these challenge issues, this dissertation studies and enhances a novel public-key cryptography -- attribute-based encryption (ABE), and applies it for fine-grained data access control on untrusted storage. The first part of this dissertation discusses the necessity of applying ABE to secure data sharing on untrusted storage and addresses several security issues for ABE. More specifically, we propose three enhancement schemes for ABE: In the first enhancement scheme, we focus on how to revoke users in ABE with the help of untrusted servers. In this work, we enable the data owner to delegate most computation-intensive tasks pertained to user revocation to untrusted servers without disclosing data content to them. In the second enhancement scheme, we address key abuse attacks in ABE, in which authorized but malicious users abuse their access privileges by sharing their decryption keys with unauthorized users. Our proposed scheme makes it possible for the data owner to efficiently disclose the original key owner's identity merely by checking the input and output of a suspicious user's decryption device. Our third enhancement schemes study the issue of privacy preservation in ABE. Specifically, our proposed schemes hide the data owner's access policy not only to the untrusted servers but also to all the users. The second part presents our ABE-based secure data sharing solutions for two specific applications -- Cloud Computing and Wireless Sensor Networks (WSNs). In Cloud Computing cloud servers are usually operated by third-party providers, which are almost certain to be outside the trust domain of cloud users. To secure data storage and sharing for cloud users, our proposed scheme lets the data owner (also a cloud user) generate her own ABE keys for data encryption and take the full control on key distribution/revocation. The main challenge in this work is to make the computation load affordable to the data owner and data consumers (both are cloud users). We address this challenge by uniquely combining various computation delegation techniques with ABE and allow both the data owner and data consumers to securely mitigate most computation-intensive tasks to cloud servers which are envisaged to have unlimited resources. In WSNs, wireless sensor nodes are often unattendedly deployed in the field and vulnerable to strong attacks such as memory breach. For securing storage and sharing of data on distributed storage sensor nodes while retaining data confidentiality, sensor nodes encrypt their collected data using ABE public keys and store encrypted data on storage nodes. Authorized users are given corresponding decryption keys to read data. The main challenge in this case is that sensor nodes are extremely resource-constrained and can just afford limited computation/communication load. Taking this into account we divide the lifetime of sensor nodes into phases and distribute the computation tasks into each phase. We also revised the original ABE scheme to make the overhead pertained to user revocation minimal for sensor nodes. Feasibility of the scheme is demonstrated by experiments on real sensor platforms. "
18
Watkins, Stan M. "FLEXIBLE SECURE DATA COMMUNICATIONS WITH THE RANGE ENCRYPTION MODULE." International Foundation for Telemetering, 1999. http://hdl.handle.net/10150/608536.
Full textAbstract:
International Telemetering Conference Proceedings / October 25-28, 1999 / Riviera Hotel and Convention Center, Las Vegas, NevadaThis paper discusses the design, application and flexibility of the Range Encryption Module (REM) developed by L3 Communications Conic Division for the Range Application Joint Program Office (RAJPO) located at Eglin Air Force Base in Florida. The REM is a burst encrypter that utilizes the National Security Agency Thornton CTIC/DS- 101 Hybrid (CDH) encryption algorithm. The CDH device operates under the control of a Conic-designed digital ASIC. The CDH, ASIC, Power Management and parallel bus interface circuits reside on a single card within the REM called the Common Encryption Core (CEC). The REM and CEC card within the REM offer flexibility in many operational features, as described below.
19
Ramotsoela, Tsotsope Daniel. "Data aggregation using homomorphic encryption in wireless sensor networks." Diss., University of Pretoria, 2015. http://hdl.handle.net/2263/61330.
Full textAbstract:
Wireless sensor networks have become increasingly popular in many applications such as environment monitoring and law enforcement. Data aggregation is a method used to reduce network traffic but cannot be used together with conventional encryption schemes because it is not secure and introduces extra overhead. Homomorphic encryption is an encryption scheme that allows data processing on encrypted data as opposed to plaintext. It has the benefit that each intermediate node does not have to decrypt each packet, but the resulting cyphertext is usually much larger than the original plaintext. This could negatively affect system performance because the energy consumption of each node is directly proportional to the amount of data it transmits.
This study investigates the benefits and drawback of using homomorphic encryption in the aggregation process particularly in the context of scalable networks. It was found that conventional encryption outperforms the homomorphic encryption for smaller networks, but as the network size grows, homomorphic encryption starts outperforming conventional encryption. It was also found that the homomorphic encryption scheme does significantly reduce the performance of plaintext aggregation. This performance reduction will however be acceptable for most applications where security is a concern.Draadlose sensornetwerke raak toenemend meer gewild vir heelwat verskillende toepassings, soos byvoorbeeld opgewingsmonitering en wetstoepassing. Data-aggregasie is n metode wat gebruik word om netwerkverkeer te verminder, maar kan nie gebruik word saam met konvensionele enkripsie-skemas nie, omdat dit nie veilig is nie en oorhoofse koste verhoog. Homomorfiese enkripsie is n enkripsie-skema wat dataverwerking toelaat op geënkripteerde in teenstelling met gewone-teks. Dit het die voordeel dat elke intermediêre nie nodig het om elke pakkie te dekripteer nie, maar die resulterende kodeteks is gewoonlik heelwat groter as die gewone-teks. Dit kan die stelselgedrag negatief beÏnvloed omdat die energieverbruik van elke node eweredig is aan die hoeveelheid data wat dit versend. Hierdie studie ondersoek die voor- en nadele van homomorfiese enkripsie in die aggregasieproses, veral in die konteks van skaleerbare netwerke. Daar is gevind dat konvensionele enkripsie beter vaar as homomorfies enkripsie in kleiner netwerke. Die omgekeerde is waar vir groter netwerke. Dit is ook gevind dat homomorfiese enkripsie gewone-teks-aggregasie negatief beÏnvloed, maar dit word as aanvaarbaar beskou vir toepassings waar sekuriteit belangrik is.
Dissertation (MEng)--University of Pretoria, 2015.
Electrical, Electronic and Computer Engineering
Meng
Unrestricted
20
Brockmann, Andrew. "A Plausibly Deniable Encryption Scheme for Personal Data Storage." Scholarship @ Claremont, 2015. http://scholarship.claremont.edu/hmc_theses/88.
Full textAbstract:
Even if an encryption algorithm is mathematically strong, humans inevitably make for a weak link in most security protocols. A sufficiently threatening adversary will typically be able to force people to reveal their encrypted data. Methods of deniable encryption seek to mend this vulnerability by allowing for decryption to alternate data which is plausible but not sensitive. Existing schemes which allow for deniable encryption are best suited for use by parties who wish to communicate with one another. They are not, however, ideal for personal data storage. This paper develops a plausibly-deniable encryption system for use with personal data storage, such as hard drive encryption. This is accomplished by narrowing the encryption algorithm’s message space, allowing different plausible plaintexts to correspond to one another under different encryption keys.
21
Chen, Hang. "Optical Encryption Techniques for Color Image and Hyperspectral Data." Thesis, Université de Lorraine, 2017. http://www.theses.fr/2017LORR0374.
Full textAbstract:
La sécurité est un problème important dans la transmission et le stockage de l'image, tandis que le cryptage est un moyen d'assurer la sécurité qui est requise dans de nombreuses applications (télévision par câble, la communication d'images militaires, systèmes d'imagerie confidentielle, etc.). Toutefois, à l'instar du message texte, les données images présentent des caractéristiques spéciales telles que la haute capacité, la redondance et la haute corrélation entre les pixels, et nécessite souvent une transmission et des traitements temps réel pour certaines applications. Construire un système rapide et efficace de cryptographie d'images suscite un intérêt considérable. C'est dans ce contexte qu’ont été menés ces travaux thèse qui portent sur l’élaboration d’un corrélateur optique en termes de cryptage/décryptage des données pour son implémentation dans un montage optique innovant. L’objectif de ces travaux est de réaliser un système optique de chiffrement sur la base d'exploitation de transformation optique et de générateurs chaotiques. L'idée originale des travaux consiste à exploiter la non-linéarité des systèmes chaotiques comme clés de chiffrement pour les systèmes optiques de chiffrement d'images multispectrales. Dans ces travaux de thèse, nous avons proposés et évalués plusieurs chiffrements d'images à base d’un système hyperchaotique et de transformées optiques (gyrator, Fourier, Baker , Arnold et Gerchberg- Saxton) à partir d’un processus de cryptage reposant sur une décomposition composants RVB et un encodage dans un flux dimensionnel d’images couleurs. L'originalité des solutions de chiffrement adoptée reposent sur l'exploitation de signaux réellement aléatoires à travers la mise en œuvre de générateurs hyperchaotiques pour la génération de données aléatoires sous forme images comme base de matrices de clés de chiffrement. En effet, ces générateurs présentent des propriétés et des caractéristiques fondamentales en termes de cryptage car il présente une non-linéarité, une imprédictibilité et une extrême sensibilité aux conditions initiales les rendant très intéressantes pour le développement de clés de chiffrement par flot. L’algorithme mis en œuvre permet d'extraire en temps réel les caractéristiques de texture dans les différentes bandes spectrales d'images en vue d’évaluer et de détecter les teneurs potentielles en information et dont les transmissions doivent être sécurisée via une transmission optiqueOptical information security is one of the most important research directions in information science and technology, especially in the field of copyright protection, confidential information transmission/storage and military remote sensing. Since double random phase encoding technology (DRPE) was proposed, optical image encryption technology has become the main topic of optical information security and it has been developed and studied deeply. Optical encryption techniques offer the possibility of high-speed parallel processing of two dimension image data and hiding information in many different dimensions. In this context, much significant research and investigation on optical image encryption have been presented based on DRPE or further optical operation, such as digital holography, Fresnel transform, gyrator transform. Simultaneously, the encrypted image has been extended from single gray image to double image, color image and multi-image. However, the hyperspectral image, as a significant element in military and commercial remote sensing, has not been deeply researched in optical encryption area until now. This work extends the optical encryption technology from color image to hyperspectral image. For better comprehension of hyperspectral image encryption, this work begins with the introduction and analysis of the characteristics of hyperspectral cube. Subsequently, several kinds of encryption schemes for color image, including symmetric and asymmetric cryptosystem, are presented individually. Furthermore, the optical encryption algorithms for hyperspectral cube are designed for securing both the spatial and spectral information simultaneously. Some numerical simulations are given to validate the performance of the proposed encryption schemes. The corresponding attack experiment results demonstrate the capability and robustness of the approaches designed in this work. The research in this dissertation provides reference for the further practicality of hyperspectral image encryption
22
Chen, Hang. "Optical Encryption Techniques for Color Image and Hyperspectral Data." Electronic Thesis or Diss., Université de Lorraine, 2017. http://www.theses.fr/2017LORR0374.
Full textAbstract:
La sécurité est un problème important dans la transmission et le stockage de l'image, tandis que le cryptage est un moyen d'assurer la sécurité qui est requise dans de nombreuses applications (télévision par câble, la communication d'images militaires, systèmes d'imagerie confidentielle, etc.). Toutefois, à l'instar du message texte, les données images présentent des caractéristiques spéciales telles que la haute capacité, la redondance et la haute corrélation entre les pixels, et nécessite souvent une transmission et des traitements temps réel pour certaines applications. Construire un système rapide et efficace de cryptographie d'images suscite un intérêt considérable. C'est dans ce contexte qu’ont été menés ces travaux thèse qui portent sur l’élaboration d’un corrélateur optique en termes de cryptage/décryptage des données pour son implémentation dans un montage optique innovant. L’objectif de ces travaux est de réaliser un système optique de chiffrement sur la base d'exploitation de transformation optique et de générateurs chaotiques. L'idée originale des travaux consiste à exploiter la non-linéarité des systèmes chaotiques comme clés de chiffrement pour les systèmes optiques de chiffrement d'images multispectrales. Dans ces travaux de thèse, nous avons proposés et évalués plusieurs chiffrements d'images à base d’un système hyperchaotique et de transformées optiques (gyrator, Fourier, Baker , Arnold et Gerchberg- Saxton) à partir d’un processus de cryptage reposant sur une décomposition composants RVB et un encodage dans un flux dimensionnel d’images couleurs. L'originalité des solutions de chiffrement adoptée reposent sur l'exploitation de signaux réellement aléatoires à travers la mise en œuvre de générateurs hyperchaotiques pour la génération de données aléatoires sous forme images comme base de matrices de clés de chiffrement. En effet, ces générateurs présentent des propriétés et des caractéristiques fondamentales en termes de cryptage car il présente une non-linéarité, une imprédictibilité et une extrême sensibilité aux conditions initiales les rendant très intéressantes pour le développement de clés de chiffrement par flot. L’algorithme mis en œuvre permet d'extraire en temps réel les caractéristiques de texture dans les différentes bandes spectrales d'images en vue d’évaluer et de détecter les teneurs potentielles en information et dont les transmissions doivent être sécurisée via une transmission optiqueOptical information security is one of the most important research directions in information science and technology, especially in the field of copyright protection, confidential information transmission/storage and military remote sensing. Since double random phase encoding technology (DRPE) was proposed, optical image encryption technology has become the main topic of optical information security and it has been developed and studied deeply. Optical encryption techniques offer the possibility of high-speed parallel processing of two dimension image data and hiding information in many different dimensions. In this context, much significant research and investigation on optical image encryption have been presented based on DRPE or further optical operation, such as digital holography, Fresnel transform, gyrator transform. Simultaneously, the encrypted image has been extended from single gray image to double image, color image and multi-image. However, the hyperspectral image, as a significant element in military and commercial remote sensing, has not been deeply researched in optical encryption area until now. This work extends the optical encryption technology from color image to hyperspectral image. For better comprehension of hyperspectral image encryption, this work begins with the introduction and analysis of the characteristics of hyperspectral cube. Subsequently, several kinds of encryption schemes for color image, including symmetric and asymmetric cryptosystem, are presented individually. Furthermore, the optical encryption algorithms for hyperspectral cube are designed for securing both the spatial and spectral information simultaneously. Some numerical simulations are given to validate the performance of the proposed encryption schemes. The corresponding attack experiment results demonstrate the capability and robustness of the approaches designed in this work. The research in this dissertation provides reference for the further practicality of hyperspectral image encryption
23
Chenette, Nathan Lee. "Symmetric schemes for efficient range and error-tolerant search on encrypted data." Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/48976.
Full textAbstract:
Large-scale data management systems rely more and more on cloud storage, where the need for efficient search capabilities clashes with the need for data confidentiality. Encryption and efficient accessibility are naturally at odds, as for instance strong encryption necessitates that ciphertexts reveal nothing about underlying data. Searchable encryption is an active field in cryptography studying encryption schemes that provide varying levels of efficiency, functionality, and security, and efficient searchable encryption focuses on schemes enabling sub-linear (in the size of the database) search time. I present the first cryptographic study of efficient searchable symmetric encryption schemes supporting two types of search queries, range queries and error-tolerant queries. The natural solution to accommodate efficient range queries on ciphertexts is to use order-preserving encryption (OPE). I propose a security definition for OPE schemes, construct the first OPE scheme with provable security, and further analyze security by characterizing one-wayness of the scheme. Efficient error-tolerant queries are enabled by efficient fuzzy-searchable encryption (EFSE). For EFSE, I introduce relevant primitives, an optimal security definition and a (somewhat space-inefficient, but in a sense efficient as possible) scheme achieving it, and more efficient schemes that achieve a weaker, but practical, security notion. In all cases, I introduce new appropriate security definitions, construct novel schemes, and prove those schemes secure under standard assumptions. The goal of this line of research is to provide constructions and provable security analysis that should help practitioners decide whether OPE or FSE provides a suitable efficiency-security-functionality tradeoff for a given application.
24
Jolfaei, Alireza. "Robust Encryption Schemes for 3D Content Protection." Thesis, Griffith University, 2016. http://hdl.handle.net/10072/367353.
Full textAbstract:
Since the 1970s, a large number of encryption schemes have been proposed, among which some have been standardised and widely adopted all over the world, such as data encryption standard (DES) and advanced encryption standard (AES). However, due to the special features of three-dimensional (3D) content, these encryption standards are not a suitable solution for 3D ap- plications. The problem of 3D content encryption is beyond the application of established and well-known encryption algorithms. This is primarily due to the structure of 3D content and the way it is used commercially. Unlike data encryption, where a complete bitstream is encrypted, 3D content encryption introduces several challenges. One of the greatest challenges of 3D con tent encryption is that, in comparison with traditional data and 2D images, 3D content implies a higher level representation or semantics, and in many 3D applications, it is necessary to maintain 3D semantics, such as the spatial and dimensional stability. The major aim of this thesis is to investigate innovative solutions for encrypting 3D content which ensures the usability of encrypted content through maintaining the spatial and dimensional semantics. To this end, we overviewed the relevant background of 3D content and data encryption. We also investigated the limitations of the current techniques in addressing the challenges of 3D content encryption. The literature review delineated the scope of the research and identified the existing problems and limitations.Thesis (PhD Doctorate)
Doctor of Philosophy (PhD)
School of Information and Communication Technology
Science, Environment, Engineering and Technology
Full Text
25
Kapusta, Katarzyna. "Protecting data confidentiality combining data fragmentation, encryption, and dispersal over a distributed environment." Electronic Thesis or Diss., Paris, ENST, 2018. http://www.theses.fr/2018ENST0061.
Full textAbstract:
La thèse revient sur les techniques de fragmentation en les rendant plus rapides et/ou moins gourmand en mémoire. Le but ultime est de fournir à un utilisateur un ensemble de méthodes de fragmentation rapide pouvant être directement appliqué dans un contexte industrielle afin de renforcer la confidentialité des données stockées ou d'accélérer le processus de protection. Premièrement, une enquête riche sur la fragmentation en tant que moyen de préserver la confidentialité des données a été effectué et a donné comme résultat une vaste analyse de l'état de l'art. Deuxièmement, la famille des algorithmes de type "all-or-nothing" (tout-ou-rien) a été agrandie avec trois nouvelles propositions. Elles sont conçues pour être utilisés dans trois contextes différents: pour la fragmentation des données dans un environnement multi-cloud, un système de stockage distribué quelconque et un environnement composé d'un seul fournisseur de stockage et un dispositif privé. Troisièmement, une manière d'accélérer la fragmentation a été présentée, qui offre de meilleurs performances que le chiffrement de données en utilisant l'algorithme de chiffrement à clé symétrique le plus courant (AES-NI). Quatrièmement, un schéma de fragmentation léger basé sur le codage, la permutation et la dispersion des données a été introduit. Enfin, la fragmentation au sein des réseaux de capteurs a été réexaminée, en particulier dans les réseaux de capteurs sans fils. Dans ce cas, l'accent est mis non seulement sur la performance en matière de fragmentation, mais également sur la réduction des coûts de stockage et de transmission grâce à l'agrégation des donnéesThis thesis dissertation revisits state-of-the-art fragmentation techniques making them faster and cost-efficient. The main focus is put on increasing data confidentiality without deteriorating the processing performance. The ultimate goal is to provide a user with a set of fast fragmentation methods that could be directly applied inside an industrial context to reinforce the confidentiality of the stored data and/or accelerate the fragmentation processing. First, a rich survey on fragmentation as a way of preserving data confidentiality is presented. Second, the family of all-or-nothing transforms is extended with three new proposals. They all aim at protecting encrypted and fragmented data against the exposure of the encryption key but are designed to be employed in three different contexts: for data fragmentation in a multi-cloud environment, a distributed storage system, and an environment composed of one storage provider and one private device. Third, a way of accelerating fragmentation is presented that achieves better performance than data encryption using the most common symmetric-key encryption algorithm. Fourth, a lightweight fragmentation scheme based on data encoding, permuting, and dispersing is introduced. It totally gets rid of data encryption allowing the fragmentation to be performed even faster; up to twice as fast as data encryption. Finally, fragmentation inside sensor networks is revisited, particularly in the Unattended Wireless Sensor Networks. The main focus in this case is put not solely on the fragmentation performance, but also on the reduction of storage and transmission costs by using data aggregation
26
Cathebras, Joël. "Hardware Acceleration for Homomorphic Encryption." Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLS576/document.
Full textAbstract:
Dans cette thèse, nous nous proposons de contribuer à la définition de systèmes de crypto-calculs pour la manipulation en aveugle de données confidentielles. L’objectif particulier de ce travail est l’amélioration des performances du chiffrement homomorphe. La problématique principale réside dans la définition d’une approche d’accélération qui reste adaptable aux différents cas applicatifs de ces chiffrements, et qui, de ce fait, est cohérente avec la grande variété des paramétrages. C’est dans cet objectif que cette thèse présente l’exploration d’une architecture hybride de calcul pour l’accélération du chiffrement de Fan et Vercauteren (FV).Cette proposition résulte d’une analyse de la complexité mémoire et calculatoire du crypto-calcul avec FV. Une partie des contributions rend plus efficace l’adéquation d’un système non-positionnel de représentation des nombres (RNS) avec la multiplication de polynôme par transformée de Fourier sur corps finis (NTT). Les opérations propres au RNS, facilement parallélisables, sont accélérées par une unité de calcul SIMD type GPU. Les opérations de NTT à la base des multiplications de polynôme sont implémentées sur matériel dédié de type FPGA. Des contributions spécifiques viennent en soutien de cette proposition en réduisant le coût mémoire et le coût des communications pour la gestion des facteurs de rotation des NTT.Cette thèse ouvre des perspectives pour la définition de micro-serveurs pour la manipulation de données confidentielles à base de chiffrement homomorpheIn this thesis, we propose to contribute to the definition of encrypted-computing systems for the secure handling of private data. The particular objective of this work is to improve the performance of homomorphic encryption. The main problem lies in the definition of an acceleration approach that remains adaptable to the different application cases of these encryptions, and which is therefore consistent with the wide variety of parameters. It is for that objective that this thesis presents the exploration of a hybrid computing architecture for accelerating Fan and Vercauteren’s encryption scheme (FV).This proposal is the result of an analysis of the memory and computational complexity of crypto-calculation with FV. Some of the contributions make the adequacy of a non-positional number representation system (RNS) with polynomial multiplication Fourier transform over finite-fields (NTT) more effective. RNS-specific operations, inherently embedding parallelism, are accelerated on a SIMD computing unit such as GPU. NTT-based polynomial multiplications are implemented on dedicated hardware such as FPGA. Specific contributions support this proposal by reducing the storage and the communication costs for handling the NTTs’ twiddle factors.This thesis opens up perspectives for the definition of micro-servers for the manipulation of private data based on homomorphic encryption
27
Budd, Chris. "Data Protection and Data Elimination." International Foundation for Telemetering, 2015. http://hdl.handle.net/10150/596395.
Full textAbstract:
ITC/USA 2015 Conference Proceedings / The Fifty-First Annual International Telemetering Conference and Technical Exhibition / October 26-29, 2015 / Bally's Hotel & Convention Center, Las Vegas, NVData security is becoming increasingly important in all areas of storage. The news services frequently have stories about lost or stolen storage devices and the panic it causes. Data security in an SSD usually involves two components: data protection and data elimination. Data protection includes passwords to protect against unauthorized access and encryption to protect against recovering data from the flash chips. Data elimination includes erasing the encryption key and erasing the flash. Telemetry applications frequently add requirements such as write protection, external erase triggers, and overwriting the flash after the erase. This presentation will review these data security features.
28
Yi, Shuang. "Reversible data hiding technologies for encrypted images." Thesis, University of Macau, 2018. http://umaclib3.umac.mo/record=b3951604.
Full text
29
Ullagaddi, Vishwanath. "Development of Data Encryption Algorithms for Secure Communication Using Public Images." University of Toledo / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1341524458.
Full text
30
Cash, Charles David. "On the security and efficiency of encryption." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/31733.
Full textAbstract:
Thesis (Ph.D)--Computing, Georgia Institute of Technology, 2010.Committee Chair: Boldreva, Alexandra; Committee Member: Ahamad, Mustaque; Committee Member: Randall, Dana; Committee Member: Tetali, Prasad; Committee Member: Traynor, Patrick. Part of the SMARTech Electronic Thesis and Dissertation Collection.
31
Tandon, Prateek. "High-performance advanced encryption standard (AES) security co-processor design." Thesis, Available online, Georgia Institute of Technology, 2004:, 2003. http://etd.gatech.edu/theses/available/etd-04082004-180433/unrestricted/tandon%5fprateek%5f200312%5fms.pdf.
Full text
32
Yamazato, Takaya, Iwao Sasase, and Shinsaku Mori. "Interlace Coding System Involving Data Compression Code, Data Encryption Code and Error Correcting Code." IEICE, 1992. http://hdl.handle.net/2237/7844.
Full text
33
Fernandez, Garcia Javier David, Sabrina Kirrane, Axel Polleres, and Simon Steyskal. "HDT crypt: Compression and Encryption of RDF Datasets." IOS Press, 2018. http://epub.wu.ac.at/6489/1/HDTCrypt%2DSWJ.pdf.
Full textAbstract:
The publication and interchange of RDF datasets online has experienced significant growth in recent years, promoted by different but complementary efforts, such as Linked Open Data, the Web of Things and RDF stream processing systems. However, the current Linked Data infrastructure does not cater for the storage and exchange of sensitive or private data. On the one hand, data publishers need means to limit access to confidential data (e.g. health, financial, personal, or other sensitive data). On the other hand, the infrastructure needs to compress RDF graphs in a manner that minimises the amount of data that is both stored and transferred over the wire. In this paper, we demonstrate how HDT - a compressed serialization format for RDF - can be extended to cater for supporting encryption. We propose a number of different graph partitioning strategies and discuss the benefits and tradeoffs of each approach.
34
Xia, Ying Han. "Establishing trust in encrypted programs." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/24761.
Full textAbstract:
Thesis (Ph.D.)--Electrical and Computer Engineering, Georgia Institute of Technology, 2009.Committee Chair: Owen, Henry; Committee Co-Chair: Abler, Randal; Committee Member: Copeland, John; Committee Member: Giffin, Jon; Committee Member: Hamblen, Jim.
35
Mantzouris, Panteleimon. "Computational algebraic attacks on the Advanced Encryption Standard (AES)." Thesis, Monterey, California : Naval Postgraduate School, 2009. http://edocs.nps.edu/npspubs/scholarly/theses/2009/Sep/09Sep%5FMantzouris.pdf.
Full textAbstract:
Thesis (M.S. in Electrical Engineering and M.S.in Applied Mathematics)--Naval Postgraduate School, September 2009.Thesis Advisor(s): Canright, David ; Butler, Jon. "September 2009." Description based on title screen as viewed on 5 November 2009. Author(s) subject terms: Advanced Encryption Standard (AES), Rijndael's algorithm, block cipher, decipher, round of the algorithm, sparse multivariate polynomial. Includes bibliographical references (p. 101). Also available in print.
36
Zhou, Jiantao. "Multimedia lightweight encryption via randomized entropy coding /." View abstract or full-text, 2009. http://library.ust.hk/cgi/db/thesis.pl?ECED%202009%20ZHOU.
Full text
37
Norman, Kelly Robert. "Encryption of Computer Peripheral Devices." Diss., CLICK HERE for online access, 2006. http://contentdm.lib.byu.edu/ETD/image/etd1232.pdf.
Full text
38
Griffy, Scott Sherlock. "Crumpled and Abraded Encryption: Implementation and Provably Secure Construction." PDXScholar, 2019. https://pdxscholar.library.pdx.edu/open_access_etds/5067.
Full textAbstract:
Abraded and crumpled encryption allows communication software such as messaging platforms to ensure privacy for their users while still allowing for some investigation by law enforcement. Crumpled encryption ensures that each decryption is costly and prevents law enforcement from performing mass decryption of messages. Abrasion ensures that only large organizations like law enforcement are able to access any messages. The current abrasion construction uses public key parameters such as prime numbers which makes the abrasion scheme difficult to analyze and allows possible backdoors. In this thesis, we introduce a new abrasion construction which uses hash functions to avoid the problems with the current abrasion construction. In addition, we present a proof-of-concept for using crumpled encryption on an email server.
39
Yip, Shu Kei. "Digital watermarking and data hiding /." View abstract or full-text, 2006. http://library.ust.hk/cgi/db/thesis.pl?ECED%202006%20YIP.
Full text
40
Li, Richard Yuk Ming. "Digital watermarking and data hiding /." View abstract or full-text, 2007. http://library.ust.hk/cgi/db/thesis.pl?ECED%202007%20LIR.
Full text
41
Asenjo, Juan C. "Data Masking, Encryption, and their Effect on Classification Performance: Trade-offs Between Data Security and Utility." NSUWorks, 2017. http://nsuworks.nova.edu/gscis_etd/1010.
Full textAbstract:
As data mining increasingly shapes organizational decision-making, the quality of its results must be questioned to ensure trust in the technology. Inaccuracies can mislead decision-makers and cause costly mistakes. With more data collected for analytical purposes, privacy is also a major concern. Data security policies and regulations are increasingly put in place to manage risks, but these policies and regulations often employ technologies that substitute and/or suppress sensitive details contained in the data sets being mined. Data masking and substitution and/or data encryption and suppression of sensitive attributes from data sets can limit access to important details. It is believed that the use of data masking and encryption can impact the quality of data mining results. This dissertation investigated and compared the causal effects of data masking and encryption on classification performance as a measure of the quality of knowledge discovery. A review of the literature found a gap in the body of knowledge, indicating that this problem had not been studied before in an experimental setting. The objective of this dissertation was to gain an understanding of the trade-offs between data security and utility in the field of analytics and data mining. The research used a nationally recognized cancer incidence database, to show how masking and encryption of potentially sensitive demographic attributes such as patients’ marital status, race/ethnicity, origin, and year of birth, could have a statistically significant impact on the patients’ predicted survival. Performance parameters measured by four different classifiers delivered sizable variations in the range of 9% to 10% between a control group, where the select attributes were untouched, and two experimental groups where the attributes were substituted or suppressed to simulate the effects of the data protection techniques. In practice, this represented a corroboration of the potential risk involved when basing medical treatment decisions using data mining applications where attributes in the data sets are masked or encrypted for patient privacy and security concerns.
42
Shin, Dong Il. "Improving trust and securing data accessibility for e-health decision making by using data encryption techniques." Thesis, Queensland University of Technology, 2012. https://eprints.qut.edu.au/50636/1/Dong_Il_Shin_Thesis.pdf.
Full textAbstract:
In the medical and healthcare arena, patients‟ data is not just their own personal history but also a valuable large dataset for finding solutions for diseases. While electronic medical records are becoming popular and are used in healthcare work places like hospitals, as well as insurance companies, and by major stakeholders such as physicians and their patients, the accessibility of such information should be dealt with in a way that preserves privacy and security. Thus, finding the best way to keep the data secure has become an important issue in the area of database security. Sensitive medical data should be encrypted in databases. There are many encryption/ decryption techniques and algorithms with regard to preserving privacy and security. Currently their performance is an important factor while the medical data is being managed in databases. Another important factor is that the stakeholders should decide more cost-effective ways to reduce the total cost of ownership. As an alternative, DAS (Data as Service) is a popular outsourcing model to satisfy the cost-effectiveness but it takes a consideration that the encryption/ decryption modules needs to be handled by trustworthy stakeholders.
This research project is focusing on the query response times in a DAS model (AES-DAS) and analyses the comparison between the outsourcing model and the in-house model which incorporates Microsoft built-in encryption scheme in a SQL Server. This research project includes building a prototype of medical database schemas. There are 2 types of simulations to carry out the project. The first stage includes 6 databases in order to carry out simulations to measure the performance between plain-text, Microsoft built-in encryption and AES-DAS (Data as Service). Particularly, the AES-DAS incorporates implementations of symmetric key encryption such as AES (Advanced Encryption Standard) and a Bucket indexing processor using Bloom filter. The results are categorised such as character type, numeric type, range queries, range queries using Bucket Index and aggregate queries. The second stage takes the scalability test from 5K to 2560K records.
The main result of these simulations is that particularly as an outsourcing model, AES-DAS using the Bucket index shows around 3.32 times faster than a normal AES-DAS under the 70 partitions and 10K record-sized databases. Retrieving Numeric typed data takes shorter time than Character typed data in AES-DAS. The aggregation query response time in AES-DAS is not as consistent as that in MS built-in encryption scheme. The scalability test shows that the DBMS reaches in a certain threshold; the query response time becomes rapidly slower. However, there is more to investigate in order to bring about other outcomes and to construct a secured EMR (Electronic Medical Record) more efficiently from these simulations.
43
Peng, Tie. "VLSI implementation of high-speed cellular automata encryption algorithm for data communications." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape8/PQDD_0002/MQ43345.pdf.
Full text
44
Hoff, Christopher David. "Cryptic Backup a framework for automated compression, encryption, and backup of data /." [Ames, Iowa : Iowa State University], 2008.
Find full text
45
Peng, Tie Carleton University Dissertation Engineering Electronics. "VLSI implementation of high-speed cellular automata encryption algorithm for data communications." Ottawa, 1999.
Find full text
46
Zuber, Martin. "Contributions to data confidentiality in machine learning by means of homomorphic encryption." Electronic Thesis or Diss., université Paris-Saclay, 2020. http://www.theses.fr/2020UPASG048.
Full textAbstract:
L’objectif de mes travaux tout au long de cette thèse a été de permettre à des algorithmes complexes d’apprentissage machine de pouvoir être appliqués (lors de leur phase d’inférence) sur des données dont la confidentialité est préservée. Un contexte d’application est l’envoi de données sur un serveur distant sur lequel un algorithme est évalué. Selon les cas, pour des raisons éthiques, légales ou commerciales, la confidentialité des données qui sont envoyées doit pouvoir être respectée. Il est possible pour cela de désigner des autorités en lesquels tous les acteurs du protocole peuvent avoir confiance. Pourquoi accorder à des entités un tel niveau de confiance dans des cas où la confidentialité des données d’un utilisateur est essentielle ? La cryptographie offre en effet des alternatives, dont le chiffrement totalement homomorphe.Le chiffrement homomorphe permet, en théorie, l’évaluation de n’importe quelle fonction dans le domaine chiffré. Son utilisation peut donc être imaginée dans le cas ou un utilisateur envoie des données chiffrées sur un serveur distant qui détient un algorithme puissant d’apprentissage machine. La phase d’inférence de cet algorithme est alors effectuée sur donnes chiffrées et le résultat est renvoyé à l’utilisateur pour déchiffrement. La cryptographie propose d’autre méthodes de calcul sur données chiffrées qui sont présentées succinctement dans le manuscrit. Pour faire court, la particularité du chiffrement homomorphe est qu’il ne nécessite aucune interaction entre l’utilisateur et le serveur. Dans ma thèse, je présente trois principaux algorithmes d’apprentissage machine sécurisés : une évaluation sur données et modèle chiffrés d’un réseau de neurone récursif et discret, le réseau de Hopfield ; une reconnaissance de locuteur sur modèle chiffré pour un réseau autoencodeur, le système VGGVox; une évaluation sur données chiffrées d’un classifieur des k plus proches voisins (ou classifieur k-NN). Notamment, notre classifieur k-NN sécurisé est le premier tel algorithme évalué de manière totalement homomorphe. Nos travaux ouvrent de nombreuses perspectives, notamment dans le domaine de l’apprentissage collaboratif sécuriséWe aim to provide a set tools allowing for machine learning algorithms to yield their intended results while ensuring confidentiality properties are achieved for the underlying data. This can be achieved through regulatory measures such as prohibiting the use of a sensitive database in certain cases and restricting its access to certain law enforcement agencies. The fundamental reason for the existence of our work - and every other work like it - is the following: why trust that an outside entity will not misuse personal data when you can have assurances of that fact ? This applies both in the case of a private company that may use/sell your data for profit, legally or illegally. It also applies to use by a government which may or may not have the proper safeguards against abuse, as well as the proper security for data storage and access. In our case, we provide such confidentiality properties though the use of Fully Homomorphic Encryption (FHE). Precisely, most of our work focuses on finding new algorithms for secure outsourced machine learning evaluation using FHE. While other privacy and confidentiality preserving methods are touched upon briefly, we focused our research on homomorphic encryption and strive to explain our choice and its general context. We present three main novel secure machine learning applications: a confidentiality-preserving recursive discrete neural network; a model-confidential embedding-based neural network; a confidentiality-preserving k-NN classifier. Notably, our secure k-NN classifier is the only such algorithm in the literature obtaining a result noninteractively. We evaluate the accuracy and efficiency of these three applications on real-world machine learning problems. We show that our secure schemes compare very favorably to their non-secure counterparts in terms of accuracy, while still running in realistic time. Beyond these schemes themselves, this thesis promotes a specific research direction for secure machine learning. We argue for less (though still some) focus on deep convolutional neural networks and show that looking at somewhat lesser known machine learning algorithms can yield promising results
47
Wong, Hon Wah. "Image watermarking and data hiding techniques /." View Abstract or Full-Text, 2003. http://library.ust.hk/cgi/db/thesis.pl?ELEC%202003%20WONGH.
Full textAbstract:
Thesis (Ph. D.)--Hong Kong University of Science and Technology, 2003.Includes bibliographical references (leaves 163-178). Also available in electronic version. Access restricted to campus users.
48
Ferek, Matúš. "Bezpečená komunikace mezi data loggerem a databazovým serverem." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2011. http://www.nusl.cz/ntk/nusl-219262.
Full textAbstract:
This work is aimed to analyze security risks of data transfer in Internet network and to design couple of possible solutions for securing communication between data logger and server for data processing. As a result, solution of securing this data communication by SSL layer was designed.
49
Shen, Chien-Jen, and 沈建仁. "Data Encryption and Compression Integrated System." Thesis, 1995. http://ndltd.ncl.edu.tw/handle/84630591242749970795.
Full textAbstract:
碩士國立成功大學
資訊及電子工程研究所
83
In 1988, Cleary and Witten first introduced the concept for combining data compression and encryption using adaptive arithmetic coding compression algorithm. But Bergen and Hogan described that a chosen plaintext attack will allow attackers to determine the fixed model or adaptive model ( the source symbol table and associated frequencies ) in 1992 and 1993. In this thesis, We first discuss the security for data compression algorithm, and combine the dictionary coding and arithmetic coding compression algorithm to achieve better compression ratio. We also propose the encryption model for these compression algorithm and show that we can prevent the chosen plaintext attack or known plaintext attack.
50
Huang, Su-Chiung, and 黃素瓊. "Magic matrix encryption for secure data hiding." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/50974690504477366448.
Full textAbstract:
碩士國立中央大學
資訊工程學系碩士在職專班
96
In this thesis, a novel method is presented to hide secure data for secrete communications by incorporating cryptography and data hiding technologies. In our approach, original data is encrypted by using the order of a magic matrix with secrete keys. There are two fundamental operations, including substitution and permutation, in traditional encryption process. According to the selected host image and magic matrix, mapping table for substation and permutation sequence are generated instead of the fixed permutation rule and substitution table used in traditional encryption algorithms. There are three secrete keys, host image selection key and magic matrix selection key pair, for use in encryption and decryption processes for data transmission. Finally, secure data obtained from previous processes are hided into LSB bit plane of the host image to construct a stego-image. The proposed system consists of two main modules, which are secure data hiding and data extraction modules. In data hiding module, eight steps are performed for data encryption and hiding. They are host image obtaining, magic matrix key obtaining, host mask generation, magic mask generation, mapping table generation, secure mask generation, secure data stream generation, and hiding process. As to the data extraction module, the first five steps are the same as those in the data hiding module excepting steps 6~8 which are secure data stream extraction, secure data stream decoding, and hiding data extraction. Experiments were conducted on various binary images and gray images. The average Hamming distance, i.e., error bit rate, is about 50% between original data and error binary data extracted by any of the secrete keys which is error or the corresponding secure data is lost. The phenomenon reveals that any attacker can not extract correct data when any of the secrete keys is lost. In addition, the information extracted by the attacker using error key will be the same as that obtained by random guess. Experimental results demonstrate the validity and efficiency of our proposed method. Moreover, the advantages of image complexity and variability property are both considered in designing the robust secure data hiding algorithm.