Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 20 for “"Diffie"”.
-
Computational soundness for standard assumptions of formal cryptography
… new operators. In particular, we show how the Diffie-Hellman key-agreement scheme and the computational Diffie-Hellman assumption can be added to the Dolev-Yao model in a computationally sound way.
-
A Structure-based Attack on the Linearized Braid Group-based Diffie-Hellman Conjugacy Problem in Combination with an Attack using Polynomial Interpolation and the Chinese Remainder Theorem
… attack on the so-called braid group-based Diffie-Hellman conjugacy problem (BDHCP). The general procedure of the attack is to transform a BDHCP to the problem of solving several simultaneous matrix equations. A first improvement is achieved by reducing the solution space of the matrix …
-
Sistema domótico inalámbrico con portal WEB
… Implementa autenticación cifrada con AES128 y Diffie Hellman.
-
Hidden Number Problems
… focus is directed towards the bit security of Diffie-Hellman key exchange. The study presented here provides new results on the hardness of extracting partial information about Diffie-Hellman keys.
-
Webová aplikace kryptografie využívající párování
… výměny klíčů mezi třemi stranami pomocí Diffie--Hellman protokolu a realizaci MOV útoku.
-
Implementation of Secure Key Management Techniques in Wireless Sensor Networks
… matter. Many key agreement schemes like Diffie-Hellman and public-key based schemes are not suitable for wireless sensor networks. Pre-distribution of secret keys for all pairs of nodes is not viable due to the large amount of memory used when the network size is large. We propose a novel …
-
A fair payment system with online anonymous transfer
… the Strong RSA assumption and the Decisional Diffie-Hellman assumption in the random oracle model. Furthermore, we provide extensions for our system that could allow it to deal with offline payments and micropayments. Our system has been implemented in java. Tests have shown that it performs …
-
Single-Server Private Information Retrieval with Sublinear Amortized Time
… on standard cryptographic assumptions (decision Diffie-Hellman, quadratic residuosity, learning with errors, etc.). They work by having the client first fetch a small “hint” about the database contents from the server. Generating this hint requires server time linear in the database size. …
-
Topology hiding computation on all graphs
… is feasible for all graphs under the Decisional Diffie-Hellman assumption. Our techniques employ random or deterministic walks to generate paths covering the graph, upon which we apply the Akavia-Moran topology-hiding broadcast for chain-graphs (paths). To prevent topology information revealed by …
-
Group key agreement in dynamic tactical networks
… best solution was the Arbitrary Topology Group Diffie Hellman (AT-GDH). However, this protocol has not been fully specified as no provisions were made for auxiliary key agreements. To complete the AT-GDH key agreement, additional protocols are presented to be performed upon group membership …
-
Secure channel free public key encryption with multiple keywords search
… secure under Random Oracle Models by Bilinear Diffie-Hellman (BDH) and 1-Bilinear Diffie-Hellman Inversion(1-BDHI) assumptions for preventing OKGA. Besides, the efficiency and performance of tSCF-MPEKS is presented from both the theoretical analysis and the practical analysis. IKGA in MPEKS …
-
Secured and Versatile IoT Connectivity: A Novel LoRa-Based Approach with Enhanced Encryption, Key Exchange, Real-Time Data Visualization, and Dynamic Storage Integration
… encryption. Alongside these, the Elliptic Curve Diffie-Hellman (ECDH) protocol is implemented for secure key exchange. A unique three-fold data visualization strategy is introduced, encompassing real-time updates on a locally hosted webpage, local storage in the ESP32 in a CSV file format, and …
-
A novel authentication protocol based on biometric and identity-based cryptography
… key exchange, which are the equivalent to the Diffie-Hellman key exchange. Due to a potential flaw in the protocols, guarding against attacks can be challenging. In order to alleviate some of the issues encountered with the new protocol, this thesis uses the encrypt-then-authenticate method. …
-
Criptosistemas basados en Teoría de Grupos
… problemas similares al llamado problema de Diffie-Hellman. Se propone un sistema de intercambio de claves de este tipo, basado en el teorema de Markov. También, se diseña un esquema de cifrado que constituye un marco común para el estudio de varios esquemas de los mencionados y se demuetra, …
-
A dynamic trust and mutual authentication scheme for MANET security
… with each other using a highly efficient Diffie Hellman Elliptic Curve scheme (Wang, Ramamurthy and Zou, 2006). The shared key is used to encrypt data between the peer nodes.
-
Studies in program obfuscation
… under a new strong variant of the Decisional Diffie-Hellman assumption that holds in the generic group model. Additionally, we show a cryptographic application of the new obfuscator to leak-ageresilient one-time digital signatures. The thesis also includes a survey of the prior results in the …
-
Location Privacy in VANETs: Improved Chaff-Based CMIX and Privacy-Preserving End-to-End Communication
… a fresh one for each communication through a Diffie–Hellman key exchange. As a second main contribution of this thesis, we focus on the V2V communication without the interference of a Trusted Third Party (TTP)s in case this has been corrupted, destroyed, or is out of range. This thesis …
-
Performance Optimization of Public Key Cryptography on Embedded Platforms
… Digital Signature Algorithm (ECDSA), the Lamport-Diffie one-time hash-based signature scheme (LD-OTS) and the Winternitz one-time hash-based signature scheme (W-OTS). We demonstrate that there’s a trade-off between energy needs, security level and algorithm selection. However, when we consider the …
-
Constructions, Lower Bounds, and New Directions in Cryptography and Computational Complexity
… black-box separation of IBE from the Decisional Diffie-Hellman assumption. We also show the necessity of adaptivity when querying one-way permutations to construct pseudorandom generators á la Goldreich-Levin; an issue related to streaming models for cryptography. In the second part we introduce …