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 417 for “"Cryptography"”.
-
Incremental cryptography
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.
-
Implementation of hashed cryptography algorithm based on cryptography message syntax
This design and simulation research is conducted in CMC network security (message encryption context). The design will use MATLAB encryption to show simulation. The coding is designed in such a way that there is a malicious attack to destroy the data. The system will automatically protect data and …
-
RELATIVISTIC QUANTUM CRYPTOGRAPHY
… the benefits of relativistic constraints for cryptography. We first revisit non-communicating models and its applications in the context of interactive proofs and cryptography. We propose bit commitment protocols whose security hinges on communication constraints and investigate its …
-
Exposure-resilient cryptography
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.
-
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 …
-
Applications of Quantum Cryptography
This thesis extends the applicability of quantum cryptography. First, we prove that quantum cryptography at least equals classical cryptography in an important area, namely authentication. The quantum key distribution protocols presented here show that, contrary to previous belief, authentication …
-
Quantum Cryptography Beyond Qubits
Over the last few decades, quantum cryptography has been one of the most important quantum technologies developed. It holds the promise of communicating secure information over untrusted channels. In particular, quantum cryptography is immune to the eventual threats posed by large-scale quantum …
-
Cryptography for societal benefit
The deployment of cryptography in society has a range of effects that are not always evident when studying cryptography as a technological construct in isolation. This observation suggests a number of natural research directions that examine cryptography as an instrument of societal influence; that …
-
A Limit Theorem in Cryptography.
<p>Cryptography is the study of encryptying and decrypting messages and deciphering encrypted messages when the code is unknown. We consider Λ<sub>π</sub>(Δ<em>x</em>, Δ<em>y</em>) which is a count of how many ways a permutation satisfies a certain property. According to Hawkes and O'Connor, the …
-
Succinct Cryptography via Propositional Proofs
The goal in modern cryptography is to obtain security while minimizing the use of computational resources. In recent years, we have been incredibly successful in our pursuit for efficiency, even for cryptographic tasks that were thought to be “science fiction”. For example, we have constructions of …
-
Quantum Cryptography: From Theory to Practice
Quantum cryptography or quantum key distribution (QKD) applies fundamental laws of quantum physics to guarantee secure communication. The security of quantum cryptography was proven in the last decade. Many security analyses are based on the assumption that QKD system components are idealized. In …
-
The (in)security of proprietary cryptography
Contains fulltext : 140089.pdf (Publisher’s version ) (Open Access)
-
CRYPTOGRAPHY FROM CONSENSUS TO THE COSMOS
… cryptographically secure -- the basis of Modern Cryptography. Classical "provable security" assumes that the attacker is probabilistic polynomial-time in nature (or perhaps quantum) and stateless. In contrast, our notion of Universal Reductions (Chan, Freitag, and Pass, 2022)) models attackers as …
-
Applications of Algebraic Curves to Cryptography
Secondly, we use algebraic functions with two poles to obtain efficient secret sharing schemes. We present a method to find the lower bounds for the minimum distance of geometric codes. We apply this to the two-point codes on a Hermitian function field. The lower bounds turn out to be sharp and …
-
On computational intractability assumptions in cryptography
… of security. The standard technique used in cryptography is to assume the existence of some puzzle, whose hard instances are easy to generate but no efficient algorithm can solve them. Such assumptions, which define intractable problems for efficient algorithms, are called computational …
-
A calculus for composable, computational cryptography
The universal composability (UC) framework is the established standard for analyzing cryptographic protocols in a modular way, such that security is preserved under concurrent composition with arbitrary other protocols. However, although UC is widely used for on-paper proofs, prior attempts at …
-
Security Protocols in Relativistic Quantum Cryptography
This thesis explores quantum cryptographic protocols designed to provide secure implementation of three key tasks, through mathematical analysis and qualitative discussion. Each chapter focuses on a distinct cryptographic scheme and explores its utility relative to classical and alternative quantum …
-
Cryptography in an unbounded computation model
Thesis (M.Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.
Page 1 of 21