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 50 for “"Cryptographic Primitives"”.
-
Security of Lightweight Cryptographic Primitives
… always has been an issue with the rise of cryptographic backdoors and hackers reverse engineering the security protocols within devices to reveal the original state that was encrypted. Security researchers have done much work to prevent attacks with high power algorithms, such as the …
-
Analysis of Lightweight Cryptographic Primitives
… computers. This thesis analyzes lightweight cryptographic primitives that would be suitable for use in IoT devices, helping fill a gap for "good enough" security within the size, weight, and power (SWaP) constraints common to IoT devices. The primitives have not undergone comprehensive …
-
Constructive synthesis of optimized cryptographic primitives
In this thesis, I designed and implemented a formally verified compiler for programs over arbitrary-width integers in Parametric Higher-Order Abstract Syntax. This was part of a larger project, Fiat-crypto, which seeks to produce formally verified machine-code implementations of Elliptic Curve …
-
Hardware Accelerator Generation Framework for Cryptographic Primitives
Cryptographic primitives, consisting of repetitive operations with different inputs, are typically implemented using straight-line C code due to traditional execution on CPUs. Computing these primitives is necessary for secure communication; thus, dedicated hardware accelerators are required in …
-
Secure and Efficient Implementations of Cryptographic Primitives
… devices. This presents great challenges in cryptographic system designs: how to protect privacy, authentication, and integrity in this distributed and connected computing world, and how to satisfy the requirements of different platforms, ranging from resource constrained embedded devices to …
-
STRENGTH EVALUATION OF CRYPTOGRAPHIC PRIMITIVES TO LINEAR, DIFFERENTIAL AND ALGEBRAIC ATTACKS.
… an effective method for ensuring the security of cryptographic primitives by attacking them with the most advanced techniques. This thesis provides a deep investigation of three different kinds of cryptanalysis for symmetric ciphers, differential, linear and algebraic, applying them to several …
-
Efficient cryptographic primitives: Secure comparison, binary decomposition and proxy re-encryption
… efficient. Their implementations adopt costly primitives, such as secure comparison, binary decomposition among others, which reduce the efficiency of the whole protocols. Therefore, the improvement of these primitives results in high efficiency of the protocols. To have a well-defined scope, …
-
Available group key management for NASPInet
… grid entities. Since the data is secured using cryptographic primitives such as encryp- tion and message authentication codes, it is critical to ensure fault tolerance of the key management infrastructure that the cryptographic primitives rely on. Since an entity might be sharing its data with …
-
Machine-aided analysis of vote privacy using computationally complete symbolic attacker
Security protocols employ cryptographic primitives such as encryption and digital signatures to provide security guarantees of confidentiality and authenticity in the presence of malicious attackers. Due to the complexities of cryptographic primitives, subtle nature of the security guarantees and …
-
Structure vs. hardness through the obfuscation lens
… While one-way functions, the most basic cryptographic object, does not seem to require much structure, as we advance up the ranks into public-key cryptography and beyond, we seem to require that certain structured problems are hard. For example, factoring, quadratic residuosity, discrete …
-
Thresholdizing lattice based encryption schemes
… sharing techniques applied on lattice-based cryptographic primitives constructed from the learning with erros (LWE) assumption. Using secret sharing techniques from [BGG⁺17], we show how to construct paradigms of threshold multi-key fully homomorphic encryption and predicate encryption. …
-
Infrastructures for secure multiparty computation
… wireless access points, etc. We consider which cryptographic primitives would be good building blocks for a secure computation infrastructure. The first, reliable communication. We study the problem of almost-everywhere reliable message transmission.
-
The implementation of a split-value verifiable voting system
… the split-value representation and simple cryptographic primitives.
-
Constructions, Lower Bounds, and New Directions in Cryptography and Computational Complexity
… computable problems, and in computing cryptographic primitives. We observe [Coo71] that logarithmic space-bounded Turing Machines, equipped with an unbounded stack, henceforth called Stack Machines, together with an external random tape of polynomial length characterize RP; BPP an so …
-
Towards Cycle-Level Verification of Constant-Time Cryptography
Cryptographic primitives–hash functions, symmetric key encryption algorithms, asymmetric key exchange algorithms, and more–are used everywhere to achieve security in modern computing. Since these algorithms have complicated, math-heavy implementations, they are typically used through cryptographic …
-
Post-Quantum Verifiable Oblivious Pseudorandom Functions
… and practicality. Leveraging lattice-based cryptographic primitives, particularly the Learning With Errors (LWE) problem, our VOPRF construction aims to address the limitations of existing approaches by reducing proof sizes. The key component in our work is the integration of an efficient …
-
Fine-grained cryptography
Fine-grained cryptography is the study of cryptographic objects that are required to be secure only against adversaries that are moderately more powerful than the honest parties. This weakening in security requirements opens up possibilities for meaningful cryptographic constructions in various …
-
Distributed correlation generators
… generators and show its connection to other cryptographic primitives. Secondly, assuming the existence of indistinguishability obfuscators, we show a construction of distributed correlation generators for a large and natural class of joint distributions that we call conditionally sampleable …
-
Searching over encrypted data
… question had several solutions, mostly based on cryptographic primitives, offering numerous security and efficiency guarantees. While this problem has been explicitly identified for more than a decade, many research dimensions remain unsolved. The main goal of this thesis is to come up with …
Page 1 of 3