Open Access. Powered by Scholars. Published by Universities.®
![Digital Commons Network](http://assets.bepress.com/20200205/img/dcn/DCsunburst.png)
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Computer Sciences (123)
- Mathematics (67)
- Information Security (66)
- Engineering (30)
- Computer Engineering (21)
-
- Theory and Algorithms (21)
- Number Theory (19)
- Applied Mathematics (17)
- Discrete Mathematics and Combinatorics (12)
- Databases and Information Systems (10)
- Algebra (9)
- Electrical and Computer Engineering (9)
- Other Computer Sciences (7)
- Digital Communications and Networking (6)
- Social and Behavioral Sciences (6)
- Arts and Humanities (5)
- Other Applied Mathematics (5)
- Physics (5)
- Business (4)
- History (4)
- OS and Networks (4)
- Other Mathematics (4)
- Quantum Physics (4)
- Aerospace Engineering (3)
- Analysis (3)
- Life Sciences (3)
- Numerical Analysis and Computation (3)
- Set Theory (3)
- Software Engineering (3)
- Institution
-
- Indian Statistical Institute (16)
- Singapore Management University (13)
- City University of New York (CUNY) (11)
- Rose-Hulman Institute of Technology (9)
- Air Force Institute of Technology (8)
-
- Selected Works (6)
- Technological University Dublin (6)
- TÜBİTAK (6)
- Boise State University (5)
- California State University, San Bernardino (5)
- Claremont Colleges (5)
- Edith Cowan University (5)
- Liberty University (5)
- Old Dominion University (4)
- Prairie View A&M University (4)
- University of Nevada, Las Vegas (4)
- Embry-Riddle Aeronautical University (3)
- Gettysburg College (3)
- Institute of Business Administration (3)
- Missouri University of Science and Technology (3)
- University at Albany, State University of New York (3)
- Brigham Young University (2)
- Eastern Washington University (2)
- Kutztown University (2)
- Purdue University (2)
- University of Connecticut (2)
- University of Wollongong (2)
- Western University (2)
- Wright State University (2)
- Zayed University (2)
- Publication Year
- Publication
-
- Doctoral Theses (16)
- Research Collection School Of Computing and Information Systems (13)
- Theses and Dissertations (11)
- Mathematical Sciences Technical Reports (MSTR) (8)
- Dissertations, Theses, and Capstone Projects (7)
-
- Senior Honors Theses (5)
- Turkish Journal of Electrical Engineering and Computer Sciences (5)
- Applications and Applied Mathematics: An International Journal (AAM) (4)
- Boise State University Theses and Dissertations (4)
- Articles (3)
- Australian Information Security Management Conference (3)
- CMC Senior Theses (3)
- Electronic Theses and Dissertations (3)
- Electronic Theses, Projects, and Dissertations (3)
- Honors Theses (3)
- International Conference on Information and Communication Technologies (3)
- Legacy Theses & Dissertations (2009 - 2024) (3)
- UNLV Theses, Dissertations, Professional Papers, and Capstones (3)
- All Works (2)
- Browse all Theses and Dissertations (2)
- CERIAS Technical Reports (2)
- Computer Science Faculty Publications and Presentations (2)
- Computer Science Faculty Research & Creative Works (2)
- Conference papers (2)
- Dissertations (2)
- EWU Masters Thesis Collection (2)
- Faculty of Informatics - Papers (Archive) (2)
- Jeremy Straub (2)
- Publications (2)
- Publications and Research (2)
- Publication Type
- File Type
Articles 1 - 30 of 191
Full-Text Articles in Physical Sciences and Mathematics
On Constructions Of Maximum Distance Separable Pascal-Like Rhotrices Over Finite Fields, Neetu Dhiman, Mansi Harish, Shalini Gupta, Arun Chauhan
On Constructions Of Maximum Distance Separable Pascal-Like Rhotrices Over Finite Fields, Neetu Dhiman, Mansi Harish, Shalini Gupta, Arun Chauhan
Applications and Applied Mathematics: An International Journal (AAM)
Cryptography and coding theory are the important areas where Maximum Distance Separable (MDS) matrices are used extensively. The Pascal matrix plays vital role in combinatorics, matrix theory and its properties provide interesting combinatorial identities. Pascal matrices also have a wide range of applications in cryptography. In this paper, we define Pascal-like rhotrix, and further, we construct MDS Pascal-like rhotrices over finite fields.
Soci+: An Enhanced Toolkit For Secure Outsourced Computation On Integers, Bowen Zhao, Weiquan Deng, Xiaoguo Li, Ximeng Liu, Qingqi Pei, Robert H. Deng
Soci+: An Enhanced Toolkit For Secure Outsourced Computation On Integers, Bowen Zhao, Weiquan Deng, Xiaoguo Li, Ximeng Liu, Qingqi Pei, Robert H. Deng
Research Collection School Of Computing and Information Systems
Secure outsourced computation is critical for cloud computing to safeguard data confidentiality and ensure data usability. Recently, secure outsourced computation schemes following a twin-server architecture based on partially homomorphic cryptosystems have received increasing attention. The Secure Outsourced Computation on Integers (SOCI) [1] toolkit is the state-of-the-art among these schemes which can perform secure computation on integers without requiring the costly bootstrapping operation as in fully homomorphic encryption; however, SOCI suffers from relatively large computation and communication overhead. In this paper, we propose SOCI+ which significantly improves the performance of SOCI. Specifically, SOCI+ employs a novel (2,2)-threshold Paillier cryptosystem with fast …
Unveiling The Power Of Shor's Algorithm: Cryptography In A Post Quantum World, Dylan Phares
Unveiling The Power Of Shor's Algorithm: Cryptography In A Post Quantum World, Dylan Phares
CMC Senior Theses
Shor's Algorithm is an extremely powerful tool, in utilizing this tool it is important to understand how it works and why it works. As well as the vast implications it could have for cryptography
Bridging Theory And Application: A Journey From Minkowski's Theorem To Ggh Cryptosystems In Lattice Theory, Danzhe Chen
Bridging Theory And Application: A Journey From Minkowski's Theorem To Ggh Cryptosystems In Lattice Theory, Danzhe Chen
CMC Senior Theses
This thesis provides a comprehensive exploration of lattice theory, emphasizing its dual significance in both theoretical mathematics and practical applications, particularly within computational complexity and cryptography. The study begins with an in-depth examination of the fundamental properties of lattices and progresses to intricate lattice-based problems such as the Shortest Vector Problem (SVP) and the Closest Vector Problem (CVP). These problems are analyzed for their computational depth and linked to the Subset Sum Problem (SSP) to highlight their critical roles in understanding computational hardness. The narrative then transitions to the practical applications of these theories in cryptography, evaluating the shift from …
Closing The Gap: Leveraging Aes-Ni To Balance Adversarial Advantage And Honest User Performance In Argon2i, Nicholas Harrell, Nathaniel Krakauer
Closing The Gap: Leveraging Aes-Ni To Balance Adversarial Advantage And Honest User Performance In Argon2i, Nicholas Harrell, Nathaniel Krakauer
CERIAS Technical Reports
The challenge of providing data privacy and integrity while maintaining efficient performance for honest users is a persistent concern in cryptography. Attackers exploit advances in parallel hardware and custom circuit hardware to gain an advantage over regular users. One such method is the use of Application-Specific Integrated Circuits (ASICs) to optimize key derivation function (KDF) algorithms, giving adversaries a significant advantage in password guessing and recovery attacks. Other examples include using graphical processing units (GPUs) and field programmable gate arrays (FPGAs). We propose a focused approach to close the gap between adversarial advantage and honest user performance by leveraging the …
Privacy-Preserving Bloom Filter-Based Keyword Search Over Large Encrypted Cloud Data, Yanrong Liang, Jianfeng Ma, Yinbin Miao, Da Kuang, Xiangdong Meng, Robert H. Deng
Privacy-Preserving Bloom Filter-Based Keyword Search Over Large Encrypted Cloud Data, Yanrong Liang, Jianfeng Ma, Yinbin Miao, Da Kuang, Xiangdong Meng, Robert H. Deng
Research Collection School Of Computing and Information Systems
To achieve the search over encrypted data in cloud server, Searchable Encryption (SE) has attracted extensive attention from both academic and industrial fields. The existing Bloom filter-based SE schemes can achieve similarity search, but will generally incur high false positive rates, and even leak the privacy of values in Bloom filters (BF). To solve the above problems, we first propose a basic Privacy-preserving Bloom filter-based Keyword Search scheme using the Circular Shift and Coalesce-Bloom Filter (CSC-BF) and Symmetric-key Hidden Vector Encryption (SHVE) technology (namely PBKS), which can achieve effective search while protecting the values in BFs. Then, we design a …
Making The Transition To Post-Quantum Cryptography, J. Simon Richard
Making The Transition To Post-Quantum Cryptography, J. Simon Richard
The Downtown Review
Without intervention, quantum computing could threaten the security of a large portion of our internet in the near future. However, solutions exist. This paper, which is intended for a general audience, provides a wider context for our current state of quantum-preparedness amid the transition from classical cryptosystems to post-quantum cryptosystems—cryptographic algorithms that can resist the attacks of quantum computers. It will also submit a possible way forward inspired by the actions taken around the globe to prevent the millennium (or Y2K) bug.
Hashes Are Not Suitable To Verify Fixity Of The Public Archived Web, Mohamed Aturban, Martin Klein, Herbert Van De Sompel, Sawood Alam, Michael L. Nelson, Michele C. Weigle
Hashes Are Not Suitable To Verify Fixity Of The Public Archived Web, Mohamed Aturban, Martin Klein, Herbert Van De Sompel, Sawood Alam, Michael L. Nelson, Michele C. Weigle
Computer Science Faculty Publications
Web archives, such as the Internet Archive, preserve the web and allow access to prior states of web pages. We implicitly trust their versions of archived pages, but as their role moves from preserving curios of the past to facilitating present day adjudication, we are concerned with verifying the fixity of archived web pages, or mementos, to ensure they have always remained unaltered. A widely used technique in digital preservation to verify the fixity of an archived resource is to periodically compute a cryptographic hash value on a resource and then compare it with a previous hash value. If the …
Ranked Keyword Search Over Encrypted Cloud Data Through Machine Learning Method, Yinbin Miao, Wei Zheng, Xiaohua Jia, Ximeng Liu, Kim-Kwang Raymond Choo, Robert H. Deng
Ranked Keyword Search Over Encrypted Cloud Data Through Machine Learning Method, Yinbin Miao, Wei Zheng, Xiaohua Jia, Ximeng Liu, Kim-Kwang Raymond Choo, Robert H. Deng
Research Collection School Of Computing and Information Systems
Ranked keyword search over encrypted data has been extensively studied in cloud computing as it enables data users to find the most relevant results quickly. However, existing ranked multi-keyword search solutions cannot achieve efficient ciphertext search and dynamic updates with forward security simultaneously. To solve the above problems, we first present a basic Machine Learning-based Ranked Keyword Search (ML-RKS) scheme in the static setting by using the k-means clustering algorithm and a balanced binary tree. ML-RKS reduces the search complexity without sacrificing the search accuracy, but is still vulnerable to forward security threats when applied in the dynamic setting. Then, …
The Mceliece Cryptosystem As A Solution To The Post-Quantum Cryptographic Problem, Isaac Hanna
The Mceliece Cryptosystem As A Solution To The Post-Quantum Cryptographic Problem, Isaac Hanna
Senior Honors Theses
The ability to communicate securely across the internet is owing to the security of the RSA cryptosystem, among others. This cryptosystem relies on the difficulty of integer factorization to provide secure communication. Peter Shor’s quantum integer factorization algorithm threatens to upend this. A special case of the hidden subgroup problem, the algorithm provides an exponential speedup in the integer factorization problem, destroying RSA’s security. Robert McEliece’s cryptosystem has been proposed as an alternative. Based upon binary Goppa codes instead of integer factorization, his cryptosystem uses code scrambling and error introduction to hinder decrypting a message without the private key. This …
An Optimized And Scalable Blockchain-Based Distributed Learning Platform For Consumer Iot, Zhaocheng Wang, Xueying Liu, Xinming Shao, Abdullah Alghamdi, Md. Shirajum Munir, Sujit Biswas
An Optimized And Scalable Blockchain-Based Distributed Learning Platform For Consumer Iot, Zhaocheng Wang, Xueying Liu, Xinming Shao, Abdullah Alghamdi, Md. Shirajum Munir, Sujit Biswas
School of Cybersecurity Faculty Publications
Consumer Internet of Things (CIoT) manufacturers seek customer feedback to enhance their products and services, creating a smart ecosystem, like a smart home. Due to security and privacy concerns, blockchain-based federated learning (BCFL) ecosystems can let CIoT manufacturers update their machine learning (ML) models using end-user data. Federated learning (FL) uses privacy-preserving ML techniques to forecast customers' needs and consumption habits, and blockchain replaces the centralized aggregator to safeguard the ecosystem. However, blockchain technology (BCT) struggles with scalability and quick ledger expansion. In BCFL, local model generation and secure aggregation are other issues. This research introduces a novel architecture, emphasizing …
Classifying World War Ii Era Ciphers With Machine Learning, Brooke Dalton
Classifying World War Ii Era Ciphers With Machine Learning, Brooke Dalton
Master's Projects
We examine whether machine learning and deep learning techniques can classify World War II era ciphers when only ciphertext is provided. Among the ciphers considered are Enigma, M-209, Sigaba, Purple, and Typex. For our machine learning models, we test a variety of features including the raw ciphertext letter sequence, histograms, and n-grams. The classification is approached in two scenarios. The first scenario considers fixed plaintext encrypted with fixed keys and the second scenario considers random plaintext encrypted with fixed keys. The results show that histograms are the best feature and classic machine learning methods are more appropriate for this kind …
Secure Authentication Scheme Based On Numerical Series Cryptography For Internet Of Things, Dr Khaled Nagaty, Maha Aladin, Abeer Hamdy Dr.
Secure Authentication Scheme Based On Numerical Series Cryptography For Internet Of Things, Dr Khaled Nagaty, Maha Aladin, Abeer Hamdy Dr.
Computer Science
The rapid advancement of cellular networks and wireless networks has laid a solid basis for the Internet of Things. IoT has evolved into a unique standard that allows diverse physical devices to collaborate with one another. A service provider gives a variety of services that may be accessed via smart apps anywhere, at any time, and from any location over the Internet. Because of the public environment of mobile communication and the Internet, these services are highly vulnerable to a several malicious attacks, such as unauthorized disclosure by hostile attackers. As a result, the best option for overcoming these vulnerabilities …
The History Of The Enigma Machine, Jenna Siobhan Parkinson
The History Of The Enigma Machine, Jenna Siobhan Parkinson
History Publications
The history of the Enigma machine begins with the invention of the rotor-based cipher machine in 1915. Various models for rotor-based cipher machines were developed somewhat simultaneously in different parts of the world. However, the first documented rotor machine was developed by Dutch naval officers in 1915. Nonetheless, the Enigma machine was officially invented following the end of World War I by Arthur Scherbius in 1918 (Faint, 2016).
Differentiated Security Architecture For Secure And Efficient Infotainment Data Communication In Iov Networks, Jiani Fan, Lwin Khin Shar, Jiale Guo, Wenzhuo Yang, Dusit Niyato, Kwok-Yan Lam
Differentiated Security Architecture For Secure And Efficient Infotainment Data Communication In Iov Networks, Jiani Fan, Lwin Khin Shar, Jiale Guo, Wenzhuo Yang, Dusit Niyato, Kwok-Yan Lam
Research Collection School Of Computing and Information Systems
This paper aims to provide differentiated security protection for infotainment data commu- nication in Internet-of-Vehicle (IoV) networks. The IoV is a network of vehicles that uses various sensors, software, built-in hardware, and communication technologies to enable information exchange between pedestrians, cars, and urban infrastructure. Negligence on the security of infotainment data commu- nication in IoV networks can unintentionally open an easy access point for social engineering attacks. The attacker can spread false information about traffic conditions, mislead drivers in their directions, and interfere with traffic management. Such attacks can also cause distractions to the driver, which has a potential implication …
A Comparison Of Cryptographic Methods, Christopher Gilmore
A Comparison Of Cryptographic Methods, Christopher Gilmore
Senior Honors Theses
While elliptic curve cryptography and quantum cryptography are significantly different branches of cryptography, they provide a suitable reference point for comparison of the value of developing methods used in the present and investing in methods to be used in the future. Elliptic curve cryptography is quite common today, as it is generally secure and efficient. However, as the field of cryptography advances, the value of quantum cryptography’s inherent security from its basic properties should be considered, as a fully realized quantum cryptosystem has the potential to be quite powerful. Ultimately, it is of critical importance to determine the value of …
Design Of Secure Communication Schemes To Provide Authentication And Integrity Among The Iot Devices, Vidya Rao Dr.
Design Of Secure Communication Schemes To Provide Authentication And Integrity Among The Iot Devices, Vidya Rao Dr.
Technical Collection
The fast growth in Internet-of-Things (IoT) based applications, has increased the number of end-devices communicating over the Internet. The end devices are made with fewer resources and are low battery-powered. These resource-constrained devices are exposed to various security and privacy concerns over publicly available Internet communication. Thus, it becomes essential to provide lightweight security solutions to safeguard data and user privacy. Elliptic Curve Cryptography (ECC) can be used to generate the digital signature and also encrypt the data. The method can be evaluated on a real-time testbed deployed using Raspberry Pi3 devices and every message transmitted is subjected to ECC. …
Soci: A Toolkit For Secure Outsourced Computation On Integers, Bowen Zhao, Jiaming Yuan, Ximeng Liu, Yongdong Wu, Hwee Hwa Pang, Robert H. Deng
Soci: A Toolkit For Secure Outsourced Computation On Integers, Bowen Zhao, Jiaming Yuan, Ximeng Liu, Yongdong Wu, Hwee Hwa Pang, Robert H. Deng
Research Collection School Of Computing and Information Systems
Secure outsourced computation is a key technique for protecting data security and privacy in the cloud. Although fully homomorphic encryption (FHE) enables computations over encrypted data, it suffers from high computation costs in order to support an unlimited number of arithmetic operations. Recently, secure computations based on interactions of multiple computation servers and partially homomorphic encryption (PHE) were proposed in the literature, which enable an unbound number of addition and multiplication operations on encrypted data more efficiently than FHE and do not add any noise to encrypted data; however, these existing solutions are either limited in functionalities (e.g., computation on …
Witness-Authenticated Key Exchange, Kelsey G. Melissaris
Witness-Authenticated Key Exchange, Kelsey G. Melissaris
Dissertations, Theses, and Capstone Projects
In this dissertation we investigate Witness-Authenticated Key Exchange (WAKE), a key agreement protocol in which each party is authenticated through knowledge of a witness to an arbitrary NP statement. We provide both game-based and universally composable definitions. Thereby, this thesis presents solutions for the most flexible and general method of authentication for group key exchange, providing simple constructions from (succinct) signatures of knowledge (SOK) and a two round UC-secure protocol.
After a discussion of flaws in previous definitions for WAKE we supply a new and improved game-based definition along with the first definition for witness-authenticated key exchange between groups of …
On The Cryptographic Deniability Of The Signal Protocol, Nihal Vatandas
On The Cryptographic Deniability Of The Signal Protocol, Nihal Vatandas
Dissertations, Theses, and Capstone Projects
Offline deniability is the ability to a posteriori deny having participated in a particular communication session. This property has been widely assumed for the Signal messaging application, yet no formal proof has appeared in the literature. In this work, we present the first formal study of the offline deniability of the Signal protocol. Our analysis shows that building a deniability proof for Signal is non-trivial and requires strong assumptions on the underlying mathematical groups where the protocol is run.
To do so, we study various implicitly authenticated key exchange protocols, including MQV, HMQV, and 3DH/X3DH, the latter being the core …
Constructions And Analyses Of Efficient Symmetric-Key Primitives For Authentication And Encryption., Sebati Ghosh Dr.
Constructions And Analyses Of Efficient Symmetric-Key Primitives For Authentication And Encryption., Sebati Ghosh Dr.
Doctoral Theses
In symmetric key cryptography there are two fundamental objectives, viz. 1. confidentiality or secrecy of message from unexpected party and 2. authentication of message which includes authenticating the source of the message as well as integrity of the message against any unwanted modification. Let us first concentrate on confidentiality. In classical symmetric key cryptography two parties, say Alice and Bob, first secretly exchange a key-pair (e, d). Later, if Alice wishes to send a secret message m ∈ M to Bob, she computes c = Ee(m) and transmits c to Bob. Upon receiving c, Bob computes Dd(c) = m and …
Overcoming Atmospheric Effects In Quantum Cryptography, Brian Joseph Rollick
Overcoming Atmospheric Effects In Quantum Cryptography, Brian Joseph Rollick
Doctoral Dissertations
Quantum Computers will have the potential to greatly assist us in problems such as searching, optimization and even drug discovery. Unfortunately, among these newfound capabilities is one which allows one to break RSA encryption in orders of magnitude less time. One promising countermeasure to secure our communication today and in the future is the one time pad, although it is very difficult to generate and distribute. Quantum Key Distribution offers a practical method for two authenticated parties to generate a key. Whereby the parties, Alice and Bob, share quantum states and use physical laws to place an upper bound on …
Efficiency Of Homomorphic Encryption Schemes, Kyle Yates
Efficiency Of Homomorphic Encryption Schemes, Kyle Yates
All Theses
In 2009, Craig Gentry introduced the first fully homomorphic encryption scheme using bootstrapping. In the 13 years since, a large amount of research has gone into improving efficiency of homomorphic encryption schemes. This includes implementing leveled homomorphic encryption schemes for practical use, which are schemes that allow for some predetermined amount of additions and multiplications that can be performed on ciphertexts. These leveled schemes have been found to be very efficient in practice. In this thesis, we will discuss the efficiency of various homomorphic encryption schemes. In particular, we will see how to improve sizes of parameter choices in homomorphic …
Formal Verification Applications For The Treekem Continuous Group Key Agreement Protocol, Alexander J. Washburn
Formal Verification Applications For The Treekem Continuous Group Key Agreement Protocol, Alexander J. Washburn
Theses and Dissertations
The features of Secure Group Messaging, the security guarantees of Message Layer Security, and the TreeKEM protocol designed to satisfy these guarantees and features are explored. A motivation and methodology for verification via explicit model checking is presented. Subsequently, a translation of the TreeKEM protocol into a Promela reference model is described, examining the nuances explicit model checking brings. Finally the results of the formal verification methods are discussed.
Challenges And Opportunities For Next-Generation Manufacturing In Space, Kip Nieman, A. F. Leonard, Katie Tyrell, Dominic Messina, Rebecca Lopez, Helen Durand
Challenges And Opportunities For Next-Generation Manufacturing In Space, Kip Nieman, A. F. Leonard, Katie Tyrell, Dominic Messina, Rebecca Lopez, Helen Durand
Chemical Engineering and Materials Science Faculty Research Publications
With commercial space travel now a reality, the idea that people might spend time on other planets in the future seems to have greater potential. To make this possible, however, there needs to be flexible means for manufacturing in space to enable tooling or resources to be created when needed to handle unexpected situations. Next-generation manufacturing paradigms offer significant potential for the kind of flexibility that might be needed; however, they can result in increases in computation time compared to traditional control methods that could make many of the computing resources already available on earth attractive for use. Furthermore, resilience …
An Exposition Of Elliptic Curve Cryptography, Travis Severns
An Exposition Of Elliptic Curve Cryptography, Travis Severns
Electronic Theses, Projects, and Dissertations
Protecting information that is being communicated between two parties over
unsecured channels is of huge importance in today’s world. The use of mathematical concepts to achieve high levels of security when communicating over these unsecured platforms is cryptography. The world of cryptography is always expanding and growing. In this paper, we set out to explore the use of elliptic curves in the cryptography of today, as well as the cryptography of the future.
We also offer our own original cryptosystem, CSDH. This system on its own
offers some moderate level of security. It shares many similarities to the post-quantum, SIDH …
Performance Improvements In Inner Product Encryption, Serena Riback
Performance Improvements In Inner Product Encryption, Serena Riback
Honors Scholar Theses
Consider a database that contains thousands of entries of the iris biometric. Each entry identifies an individual, so it is especially important that it remains secure. However, searching for entries among an encrypted database proves to be a security problem - how should one search encrypted data without leaking any information to a potential attacker? The proximity searchable encryption scheme, as discussed in the work by Cachet et al., uses the notions of inner product encryption developed by Kim et al.. In this paper, we will focus on the efficiency of these schemes. Specifically, how the symmetry of the bilinear …
Passing Time And Syncing Secrets: Demonstrating Covert Channel Vulnerabilities In Precision Time Protocol (Ptp), Aron J. Smith-Donovan
Passing Time And Syncing Secrets: Demonstrating Covert Channel Vulnerabilities In Precision Time Protocol (Ptp), Aron J. Smith-Donovan
Mathematics, Statistics, and Computer Science Honors Projects
Covert channels use steganographic approaches to transfer secret digital communications; when applied to network protocols, these strategies can facilitate undetectable data exfiltration and insertion attacks. Because covert channel techniques are protocol- and implementation-specific, individual case studies are necessary to assess for vulnerabilities under different conditions. While several investigations have been published evaluating covert channel potential in infrastructure- and manufacturing-based contexts, no existing research explores Precision Time Protocol (PTP), a time synchronization protocol commonly used in industrial control systems. This study aims to fill this gap by demonstrating the feasibility of a covert channel-based attack on a PTP-enabled network.
Zero-Knowledge Proof, Deniability And Their Applications In Blockchain, E-Voting And Deniable Secret Handshake Protocols., Somnath Panja Dr.
Zero-Knowledge Proof, Deniability And Their Applications In Blockchain, E-Voting And Deniable Secret Handshake Protocols., Somnath Panja Dr.
Doctoral Theses
In this thesis, we propose a cryptographic technique for an authenticated, end-to-end verifiable and secret ballot election. Currently, almost all verifiable e-voting systems require trusted authorities to perform the tallying process except for the DRE-i and DRE-ip systems. We have shown a weaknesses in the DRE-ip system and proposed a solution. We have modified the DRE-ip system so that no adversary can create and post a valid ballot on the public bulletin board without detection. We provide security proofs to prove the security properties of the proposed scheme. We propose two methods to store these ballots using blockchain and cloud …
Provably Weak Instances Of Plwe Revisited, Again, Katherine Mendel
Provably Weak Instances Of Plwe Revisited, Again, Katherine Mendel
CSB and SJU Distinguished Thesis
Learning with Errors has emerged as a promising possibility for postquantum cryptography. Variants known as RLWE and PLWE have been shown to be more efficient, but the increased structure can leave them vulnerable to attacks for certain instantiations. This work aims to identify specific cases where proposed cryptographic schemes based on PLWE work particularly poorly under a specific attack.