Contents
Academic literature on the topic 'Confidentialité Blowfish'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Confidentialité Blowfish.'
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.
Journal articles on the topic "Confidentialité Blowfish"
Et. al., Pravin Soni,. "Performance Analysis of Cascaded Hybrid Symmetric Encryption Models." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 2 (April 10, 2021): 1699–708. http://dx.doi.org/10.17762/turcomat.v12i2.1506.
Full textEzadeen, Shamil, and Auday H. Alwattar. "Survey of Blowfish Algorithm for Cloud." Technium: Romanian Journal of Applied Sciences and Technology 4, no. 6 (June 28, 2022): 18–28. http://dx.doi.org/10.47577/technium.v4i6.6791.
Full textRiza, Ferdy, Nurmala Sridewi, Amir Mahmud Husein, and Muhammad Khoiruddin Harahap. "Analisa Frekuensi Hasil Enkripsi Pada Algoritma Kriptografi Blowfish Terhadap Keamanan Informasi." Jurnal Teknologi dan Ilmu Komputer Prima (JUTIKOMP) 1, no. 1 (April 1, 2018): 11–15. http://dx.doi.org/10.34012/jutikomp.v1i1.233.
Full textHaryono, Wasis. "Comparison Encryption of How to Work Caesar Cipher, Hill Cipher, Blowfish and Twofish." Data Science: Journal of Computing and Applied Informatics 4, no. 2 (July 31, 2020): 100–110. http://dx.doi.org/10.32734/jocai.v4.i2-4004.
Full textSimanullang, Harlen Gilbert, and Arina Prima Silalahi. "ALGORITMA BLOWFISH UNTUK MENINGKATKAN KEAMANAN DATABASE MYSQL." METHODIKA: Jurnal Teknik Informatika dan Sistem Informasi 4, no. 1 (March 10, 2018): 10–14. http://dx.doi.org/10.46880/mtk.v4i1.58.
Full textRen, Xun Yi, Jun Feng Zhang, Yang Yu, and Hai Ping Wan. "Hybrid Encryption Scheme of EOC Traffic." Advanced Engineering Forum 6-7 (September 2012): 907–12. http://dx.doi.org/10.4028/www.scientific.net/aef.6-7.907.
Full textQuilala, Rogel Ladia, and Theda Flare Ginoy Quilala. "Document verification using quick response code with modified secure hash algorithm-1 and modified blowfish algorithm." Indonesian Journal of Electrical Engineering and Computer Science 28, no. 1 (October 1, 2022): 470. http://dx.doi.org/10.11591/ijeecs.v28.i1.pp470-479.
Full textEt. al., Dr M. Buvana,. "Optimize Cryptography Algorithm for Efficient Data Security on Cloud Computing." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 1S (April 11, 2021): 459–64. http://dx.doi.org/10.17762/turcomat.v12i1s.1905.
Full textRifa’i, Annas, and Lilis Cucu Sumartini. "IMPLEMENTASI KRIPTOGRAFI MENGGUNAKAN METODE BLOWFISH DAN BASE64 UNTUK MENGAMANKAN DATABASE INFORMASI AKADEMIK PADA KAMPUS AKADEMI TELEKOMUNIKASI BOGOR BERBASIS WEB-BASED." Jurnal E-Komtek (Elektro-Komputer-Teknik) 3, no. 2 (November 12, 2019): 87–96. http://dx.doi.org/10.37339/e-komtek.v3i2.133.
Full textRaut, Kinjal. "A Comprehensive Review of Cryptographic Algorithms." International Journal for Research in Applied Science and Engineering Technology 9, no. 12 (December 31, 2021): 1750–56. http://dx.doi.org/10.22214/ijraset.2021.39581.
Full textDissertations / Theses on the topic "Confidentialité Blowfish"
Alchicha, Élie. "Confidentialité Différentielle et Blowfish appliquées sur des bases de données graphiques, transactionnelles et images." Thesis, Pau, 2021. http://www.theses.fr/2021PAUU3067.
Full textDigital data is playing crucial role in our daily life in communicating, saving information, expressing our thoughts and opinions and capturing our precious moments as digital pictures and videos. Digital data has enormous benefits in all the aspects of modern life but forms also a threat to our privacy. In this thesis, we consider three types of online digital data generated by users of social media and e-commerce customers: graphs, transactional, and images. The graphs are records of the interactions between users that help the companies understand who are the influential users in their surroundings. The photos posted on social networks are an important source of data that need efforts to extract. The transactional datasets represent the operations that occurred on e-commerce services.We rely on a privacy-preserving technique called Differential Privacy (DP) and its generalization Blowfish Privacy (BP) to propose several solutions for the data owners to benefit from their datasets without the risk of privacy breach that could lead to legal issues. These techniques are based on the idea of recovering the existence or non-existence of any element in the dataset (tuple, row, edge, node, image, vector, ...) by adding respectively small noise on the output to provide a good balance between privacy and utility.In the first use case, we focus on the graphs by proposing three different mechanisms to protect the users' personal data before analyzing the datasets. For the first mechanism, we present a scenario to protect the connections between users (the edges in the graph) with a new approach where the users have different privileges: the VIP users need a higher level of privacy than standard users. The scenario for the second mechanism is centered on protecting a group of people (subgraphs) instead of nodes or edges in a more advanced type of graphs called dynamic graphs where the nodes and the edges might change in each time interval. In the third scenario, we keep focusing on dynamic graphs, but this time the adversaries are more aggressive than the past two scenarios as they are planting fake accounts in the dynamic graphs to connect to honest users and try to reveal their representative nodes in the graph. In the second use case, we contribute in the domain of transactional data by presenting an existed mechanism called Safe Grouping. It relies on grouping the tuples in such a way that hides the correlations between them that the adversary could use to breach the privacy of the users. On the other side, these correlations are important for the data owners in analyzing the data to understand who might be interested in similar products, goods or services. For this reason, we propose a new mechanism that exposes these correlations in such datasets, and we prove that the level of privacy is similar to the level provided by Safe Grouping.The third use-case concerns the images posted by users on social networks. We propose a privacy-preserving mechanism that allows the data owners to classify the elements in the photos without revealing sensitive information. We present a scenario of extracting the sentiments on the faces with forbidding the adversaries from recognizing the identity of the persons. For each use-case, we present the results of the experiments that prove that our algorithms can provide a good balance between privacy and utility and that they outperform existing solutions at least in one of these two concepts