Дисертації з теми "Mathematical data- Security"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-19 дисертацій для дослідження на тему "Mathematical data- Security".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Ma, Chunyan. "Mathematical security models for multi-agent distributed systems." CSUSB ScholarWorks, 2004. https://scholarworks.lib.csusb.edu/etd-project/2568.
Повний текст джерелаAtoui, Ibrahim Abdelhalim. "Data reduction techniques for wireless sensor networks using mathematical models." Thesis, Bourgogne Franche-Comté, 2018. http://www.theses.fr/2018UBFCD009.
Повний текст джерелаIn this thesis, we present energy-efficient data reduction and security techniques dedicated for wireless sensor networks. First, we propose a data aggregation model based on the similarity function that helps in removing the redundant data. In addition, based on the fitting functions we worked on sending less data features, accompanied with the fitting function that expresses all features. Second, we focus on heterogeneity of the data while studying the correlation among these multivariate features in order to enhance the data prediction technique that is based on the polynomial function, all after removing the similar measures in the aggregation phase using the Euclidean distance. Finally, we provide a rigorous security framework inherited from cryptography satisfies the level of exigence usually attained in tree-based WSNs. It prevents attackers from gaining any information about sensed data, by ensuring an end-to-end privacy between sensor nodes and the sink. In order to validate our proposed techniques, we implemented the simulations of the first technique on real readings collected from a small Sensor Scope network which is deployed at the Grand-St-Bernard, while the simulations of the second and the third techniques are conducted on real data collected from 54 sensors deployed in the Intel Berkeley Research Lab. The performance of our techniques is evaluated according to data reduction rate, energy consumption, data accuracy and time complexity
Sathisan, Shashi Kumar. "Encapsulation of large scale policy assisting computer models." Thesis, Virginia Polytechnic Institute and State University, 1985. http://hdl.handle.net/10919/101261.
Повний текст джерелаM.S.
Alkadi, Alaa. "Anomaly Detection in RFID Networks." UNF Digital Commons, 2017. https://digitalcommons.unf.edu/etd/768.
Повний текст джерелаLi, Jianzhou, and University of Lethbridge Faculty of Arts and Science. "Design of a novel hybrid cryptographic processor." Thesis, Lethbridge, Alta. : University of Lethbridge, Faculty of Arts and Science, 2005, 2005. http://hdl.handle.net/10133/266.
Повний текст джерелаviii, 87 leaves : ill. (some col.) ; 28 cm.
Li, Ling Feng. "An image encryption system based on two-dimensional quantum random walks." Thesis, University of Macau, 2018. http://umaclib3.umac.mo/record=b3950660.
Повний текст джерелаTerashima, Robert Seth. "Tweakable Ciphers: Constructions and Applications." PDXScholar, 2015. https://pdxscholar.library.pdx.edu/open_access_etds/2484.
Повний текст джерелаHaraldsson, Emil. "Strong user authentication mechanisms." Thesis, Linköping University, Department of Electrical Engineering, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2688.
Повний текст джерелаFor Siemens Industrial Turbomachinery to meet its business objectives a modular authentication concept has to be implemented. Such a mechanism must be cost- effective while providing a well-balanced level of security, easy maintenance and be as user-friendly as possible.
Authenticating users securely involves the combination of two fields, theory of authentication mechanisms in information systems and human computer interaction. To construct a strong user authentication system the correlations of these fields has to be understood and provide guidance in the design.
Strong user authentication mechanisms enforce the use of two-factor authentication or more. The combinations implemented rely on knowledge, possession and sometimes logical-location.
A user authentication system has been implemented using leading industrial products as building blocks glued together with security analysis, programming and usability research.
The thesis is divided into two parts, the first part giving the theoretical background of cryptography, authentication theory and protocols needed for the understanding of the second part, providing security analysis, blueprints, and detailed discussions on the implemented system.
Conclusions have been drawn regarding the implemented system and its context as well as from strict theoretical reasoning regarding the authentication field in general. Conclusions include:
· The unsuitability of remote authentication using biometrics
· The critical importance of client security in remote authentication
· The importance of a modular structure for the security of complex network-based systems
Huang, Jian. "FPGA Implementations of Elliptic Curve Cryptography and Tate Pairing over Binary Field." Thesis, University of North Texas, 2007. https://digital.library.unt.edu/ark:/67531/metadc3963/.
Повний текст джерелаFriot, Nicolas. "Itérations chaotiques pour la sécurité de l'information dissimulée." Thesis, Besançon, 2014. http://www.theses.fr/2014BESA2035/document.
Повний текст джерелаDiscrete dynamical systems by chaotic or asynchronous iterations have proved to be highly interesting toolsin the field of computer security, thanks to their unpredictible behavior obtained under some conditions. Moreprecisely, these chaotic iterations possess the property of topological chaos and can be programmed in anefficient way. In the state of the art, they have turned out to be really interesting to use notably through digitalwatermarking schemes. However, despite their multiple advantages, these existing algorithms have revealedsome limitations. So, these PhD thesis aims at removing these constraints, proposing new processes whichcan be applied both in the field of digital watermarking and of steganography. We have studied these newschemes on two aspects: the topological security and the security based on a probabilistic approach. Theanalysis of their respective security level has allowed to achieve a comparison with the other existing processessuch as, for example, the spread spectrum. Application tests have also been conducted to steganalyse and toevaluate the robustness of the algorithms studied in this PhD thesis. Thanks to the obtained results, it has beenpossible to determine the best adequation of each processes with targeted application fields as, for example,the anonymity on the Internet, the contribution to the development of the semantic web, or their use for theprotection of digital documents. In parallel to these scientific research works, several valorization perspectiveshave been proposed, aiming at creating a company of innovative technology
Suriadi, Suriadi. "Strengthening and formally verifying privacy in identity management systems." Thesis, Queensland University of Technology, 2010. https://eprints.qut.edu.au/39345/1/Suriadi_Suriadi_Thesis.pdf.
Повний текст джерелаMorton, Stuart Michael. "An Improved Utility Driven Approach Towards K-Anonymity Using Data Constraint Rules." Thesis, 2013. http://hdl.handle.net/1805/3427.
Повний текст джерелаAs medical data continues to transition to electronic formats, opportunities arise for researchers to use this microdata to discover patterns and increase knowledge that can improve patient care. Now more than ever, it is critical to protect the identities of the patients contained in these databases. Even after removing obvious “identifier” attributes, such as social security numbers or first and last names, that clearly identify a specific person, it is possible to join “quasi-identifier” attributes from two or more publicly available databases to identify individuals. K-anonymity is an approach that has been used to ensure that no one individual can be distinguished within a group of at least k individuals. However, the majority of the proposed approaches implementing k-anonymity have focused on improving the efficiency of algorithms implementing k-anonymity; less emphasis has been put towards ensuring the “utility” of anonymized data from a researchers’ perspective. We propose a new data utility measurement, called the research value (RV), which extends existing utility measurements by employing data constraints rules that are designed to improve the effectiveness of queries against the anonymized data. To anonymize a given raw dataset, two algorithms are proposed that use predefined generalizations provided by the data content expert and their corresponding research values to assess an attribute’s data utility as it is generalizing the data to ensure k-anonymity. In addition, an automated algorithm is presented that uses clustering and the RV to anonymize the dataset. All of the proposed algorithms scale efficiently when the number of attributes in a dataset is large.
"Anomaly detection via high-dimensional data analysis on web access data." 2009. http://library.cuhk.edu.hk/record=b5894067.
Повний текст джерелаThesis (M.Phil.)--Chinese University of Hong Kong, 2009.
Includes bibliographical references (leaves 99-104).
Abstract also in Chinese.
Abstract --- p.i
Acknowledgement --- p.iv
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Motivation --- p.1
Chapter 1.2 --- Organization --- p.4
Chapter 2 --- Literature Review --- p.6
Chapter 2.1 --- Related Works --- p.6
Chapter 2.2 --- Background Study --- p.7
Chapter 2.2.1 --- World Wide Web --- p.7
Chapter 2.2.2 --- Distributed Denial of Service Attack --- p.11
Chapter 2.2.3 --- Tools for Dimension Reduction --- p.13
Chapter 2.2.4 --- Tools for Anomaly Detection --- p.20
Chapter 2.2.5 --- Receiver operating characteristics (ROC) Analysis --- p.22
Chapter 3 --- System Design --- p.25
Chapter 3.1 --- Methodology --- p.25
Chapter 3.2 --- System Overview --- p.27
Chapter 3.3 --- Reference Profile Construction --- p.31
Chapter 3.4 --- Real-time Anomaly Detection and Response --- p.32
Chapter 3.5 --- Chapter Summary --- p.34
Chapter 4 --- Reference Profile Construction --- p.35
Chapter 4.1 --- Web Access Logs Collection --- p.35
Chapter 4.2 --- Data Preparation --- p.37
Chapter 4.3 --- Feature Extraction and Embedding Engine (FEE Engine) --- p.40
Chapter 4.3.1 --- Sub-Sequence Extraction --- p.42
Chapter 4.3.2 --- Hash Function on Sub-sequences (optional) --- p.45
Chapter 4.3.3 --- Feature Vector Construction --- p.46
Chapter 4.3.4 --- Diffusion Wavelets Embedding --- p.47
Chapter 4.3.5 --- Numerical Example of Feature Set Reduction --- p.49
Chapter 4.3.6 --- Reference Profile and Further Use of FEE Engine --- p.50
Chapter 4.4 --- Chapter Summary --- p.50
Chapter 5 --- Real-time Anomaly Detection and Response --- p.52
Chapter 5.1 --- Session Filtering and Data Preparation --- p.54
Chapter 5.2 --- Feature Extraction and Embedding --- p.54
Chapter 5.3 --- Distance-based Outlier Scores Calculation --- p.55
Chapter 5.4 --- Anomaly Detection and Response --- p.56
Chapter 5.4.1 --- Length-Based Anomaly Detection Modules --- p.56
Chapter 5.4.2 --- Characteristics of Anomaly Detection Modules --- p.59
Chapter 5.4.3 --- Dynamic Threshold Adaptation --- p.60
Chapter 5.5 --- Chapter Summary --- p.63
Chapter 6 --- Experimental Results --- p.65
Chapter 6.1 --- Experiment Datasets --- p.65
Chapter 6.1.1 --- Normal Web Access Logs --- p.66
Chapter 6.1.2 --- Attack Data Generation --- p.68
Chapter 6.2 --- ROC Curve Construction --- p.70
Chapter 6.3 --- System Parameters Selection --- p.71
Chapter 6.4 --- Performance of Anomaly Detection --- p.82
Chapter 6.4.1 --- Performance Analysis --- p.85
Chapter 6.4.2 --- Performance in defending DDoS attacks --- p.87
Chapter 6.5 --- Computation Requirement --- p.91
Chapter 6.6 --- Chapter Summary --- p.95
Chapter 7 --- Conclusion and Future Work --- p.96
Bibliography --- p.99
Mohammed, Yassene. "Data Protection and Data Security Concept for Medical Applications in a Grid Computing Environment." Doctoral thesis, 2008. http://hdl.handle.net/11858/00-1735-0000-0006-B3AE-A.
Повний текст джерела"Privacy preserving in serial data and social network publishing." 2010. http://library.cuhk.edu.hk/record=b5894365.
Повний текст джерела"August 2010."
Thesis (M.Phil.)--Chinese University of Hong Kong, 2010.
Includes bibliographical references (p. 69-72).
Abstracts in English and Chinese.
Chapter 1 --- Introduction --- p.1
Chapter 2 --- Related Work --- p.3
Chapter 3 --- Privacy Preserving Network Publication against Structural Attacks --- p.5
Chapter 3.1 --- Background and Motivation --- p.5
Chapter 3.1.1 --- Adversary knowledge --- p.6
Chapter 3.1.2 --- Targets of Protection --- p.7
Chapter 3.1.3 --- Challenges and Contributions --- p.10
Chapter 3.2 --- Preliminaries and Problem Definition --- p.11
Chapter 3.3 --- Solution:K-Isomorphism --- p.15
Chapter 3.4 --- Algorithm --- p.18
Chapter 3.4.1 --- Refined Algorithm --- p.21
Chapter 3.4.2 --- Locating Vertex Disjoint Embeddings --- p.30
Chapter 3.4.3 --- Dynamic Releases --- p.32
Chapter 3.5 --- Experimental Evaluation --- p.34
Chapter 3.5.1 --- Datasets --- p.34
Chapter 3.5.2 --- Data Structure of K-Isomorphism --- p.37
Chapter 3.5.3 --- Data Utilities and Runtime --- p.42
Chapter 3.5.4 --- Dynamic Releases --- p.47
Chapter 3.6 --- Conclusions --- p.47
Chapter 4 --- Global Privacy Guarantee in Serial Data Publishing --- p.49
Chapter 4.1 --- Background and Motivation --- p.49
Chapter 4.2 --- Problem Definition --- p.54
Chapter 4.3 --- Breach Probability Analysis --- p.57
Chapter 4.4 --- Anonymization --- p.58
Chapter 4.4.1 --- AG size Ratio --- p.58
Chapter 4.4.2 --- Constant-Ratio Strategy --- p.59
Chapter 4.4.3 --- Geometric Strategy --- p.61
Chapter 4.5 --- Experiment --- p.62
Chapter 4.5.1 --- Dataset --- p.62
Chapter 4.5.2 --- Anonymization --- p.63
Chapter 4.5.3 --- Evaluation --- p.64
Chapter 4.6 --- Conclusion --- p.68
Bibliography --- p.69
Matondo, Sandra Bazebo. "Two-level chaos-based cryptography for image security." 2012. http://encore.tut.ac.za/iii/cpro/DigitalItemViewPage.external?sp=1001028.
Повний текст джерелаDiscusses a desirable chaos-based encryption scheme for image storage and transmission is one that can resist different types of attacks in less time and with successful decryption. To resist different kinds of attacks, a higher security level is required. As a result, there is a need to enhance the security level of existing chaos-based image encryption schemes using hyper-chaos. To increase the level of security using hyper-chaos, the research will present a scheme that combines two different techniques that are used to improve the degree of security of chaos-based cryptography; a classical chaos-based cryptographic technique and a hyper-chaos masking technique. The first technique focuses on the efficient combination and transformation of image characteristics based on hyper-chaos pseudorandom numbers. The second technique focuses on driving the hyper-chaos system by using the results of the first technique to change the transmitted chaos dynamic as well as using synchronisation and a high-order differentiator for decryption. To achieve the objective of our research the following sub-problems are addressed.
Ling, Jie. "Smart card fault attacks on public key and elliptic curve cryptography." Thesis, 2014. http://hdl.handle.net/1805/5967.
Повний текст джерелаBlömmer, Otto, and Seifert presented a fault attack on elliptic curve scalar multiplication called the Sign Change Attack, which causes a fault that changes the sign of the accumulation point. As the use of a sign bit for an extended integer is highly unlikely, this appears to be a highly selective manipulation of the key stream. In this thesis we describe two plausible fault attacks on a smart card implementation of elliptic curve cryptography. King and Wang designed a new attack called counter fault attack by attacking the scalar multiple of discrete-log cryptosystem. They then successfully generalize this approach to a family of attacks. By implementing King and Wang's scheme on RSA, we successfully attacked RSA keys for a variety of sizes. Further, we generalized the attack model to an attack on any implementation that uses NAF and wNAF key.
(6012225), Huian Li. "Transparent and Mutual Restraining Electronic Voting." Thesis, 2019.
Знайти повний текст джерелаEloff, Corné. "Spatial technology as a tool to analyse and combat crime." Thesis, 2006. http://hdl.handle.net/10500/1193.
Повний текст джерелаCriminology
D.Litt. et Phil. (Criminology)