Cybersecurity Commons^™

Anonymity And Accountability In Secure Messaging, Erin Kenney

Dissertations

Encypted messaging has become more and more prevalent as time moves on, and its benefits in assuring privacy cannot be overstated, but it also brings along with it concerns on how to moderate platforms where all messages are hidden. Message Franking, followed by Traceback systems, addressed these concerns by allowing the sender of a message to be proven when reported, even for forwarded messages in the case of Traceback, however these systems damage the privacy guarantees that originally motivated encrypted messaging to begin with.

In practice, even without those concerns encrypted messaging alone is not enough to prevent the most …

Effects Of Code Scaffolding In Increasing Student Confidence In Programming Cryptography, John Denny

LSU Master's Theses

Cryptography is essential for secure communications, and new threats require more students willing to program and interact with cryptographic systems. Previous research is focused on tools for teaching these systems at a high level, teaching through attacks against these systems, and proper use of these systems in software development. In this paper, we seek to design a workshop to use scaffolded Python code to teach how these cryp- tographic systems are designed. We explore the use of code scaffolding for students to program an example implementation of the McEliece crypto- graphic system to build confidence in working with these systems. …

Action This Day: The Mathematics And Machinations That Bested The German Enigma, Jonah Weinbaum

Dartmouth College Master’s Theses

This thesis presents a comprehensive and chronological overview of cryptographic techniques designed to break Enigma, beginning in 1932 and culminating in the creation of the Turing-Welchman Bombe. We discuss the mathematical theory and electromechanical implements used to decode one of history's greatest ciphers.

Reexamining the Bombe through the lens of modern group theory, we critique Alan Turing's estimation of the number of "stops" that the Bombe produces for various plaintext-ciphertext pairing structures. To address its limitations, we introduce a new framework for estimating the number of stops by extending John Dixon's theorem concerning the probability that uniformly distributed elements of …

In-Depth Analysis Of College Students’ Data Privacy Awareness, Vernon D. Andrews

Theses and Dissertations

While attending university, college students need to be aware of issues related to data privacy. Regardless of the age, gender, race, or education level of college students, every student can relate to the advancement of the internet within the last decades. The internet has completely transformed the way the world receives and stores messages. Positively, the internet allows messages to be sent across the globe within the fraction of a second and provides students with access to potentially unlimited information on a variety of subjects. On the downside, there are issues on the internet that can cause more harm than …

Virtual Hearings And Blockchain Technology Solutions In Criminal Law, Chantell Bergquist

Political Science Theses and Capstones

Technology has evolved and raided our personal and professional lives. Although the courts are not immune to the advancement and integration of technology, the courts are not keeping up with relevant technological advancements. Historically, courts have been hesitant to embrace new technologies despite the Federal Rules of Civil Procedure and the American Bar Association Model Rules of Professional Conduct. Rule 1 of the Federal Rules of Civil Procedure creates the right to a “just, speedy, and inexpensive determination of every action and proceeding.” Likewise, the American Bar Association Model Rules of Professional Conduct have determined attorneys must “keep abreast of …

Pointing Analysis And Design Drivers For Low Earth Orbit Satellite Quantum Key Distribution, Jeremiah A. Specht

Theses and Dissertations

The world relies on encryption to perform critical and sensitive tasks every day. If quantum computing matures, the capability to decode keys and decrypt messages becomes possible. Quantum key distribution (QKD) is a method of distributing secure cryptographic keys which relies on the laws of quantum mechanics. Current implementations of QKD use fiber-based channels which limit the number of users and the distance between users. Satellite-based QKD using free-space channels is proposed as a feasible secure global communication solution. Since a free-space link does not use a waveguide, pointing a transmitter to receiver is required to ensure signal arrival. In …

Git As An Encrypted Distributed Version Control System, Russell G. Shirey

Theses and Dissertations

This thesis develops and presents a secure Git implementation, Git Virtual Vault (GV2), for users of Git to work on sensitive projects with repositories located in unsecure distributed environments, such as in cloud computing. This scenario is common within the Department of Defense, as much work is of a sensitive nature. In order to provide security to Git, additional functionality is added for confidentiality and integrity protection. This thesis examines existing Git encryption implementations and baselines their performance compared to unencrypted Git. Real-world Git repositories are examined to characterize typical Git usage and determine if the existing Git encryption implementations …

Directed Graph Cryptosystems, Kurt Anson Boberg

All Master's Theses

Cryptography is a necessary tool for secrecy in our increasingly connected and data-driven world. As advances are made in both mathematics and com­puter hardware design, existing cryptosystems must be improved or replaced to maintain privacy of sensitive data. In this paper we propose a novel cryptosystem based upon an algorithmic traversal of a directed graph (digraph). The sys­tem is resistant to the most common attacks on stream-type ciphers that do not use known-plaintext attacks. However, given a length n, the minimum number of vertices a digraph must contain to guarantee a cycle of at least n length is un­known, making …