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 32 for “"ciphertext"”.
-
An Archeology of Cryptography: Rewriting Plaintext, Encryption, and Ciphertext
… terms of art, namely, plaintext, encryption, and ciphertext. I argue that plaintext has historically been understood as kind of inscription or form of writing, and has been associated with the development of artificial languages, and used to analyze and investigate the natural world. I argue that …
-
Efficient Ciphertext-policy Attribute Based Encryption for Cloud-Based Access Control
… proposed to deliver such access control using Ciphertext-policy attribute based encryption (CP-ABE) that can enforce data owners’ access policies to achieve such cryptographic access control and tackle the majority of those concerns. However, some challenges are still outstanding due to the …
-
Fast and Accurate Machine Learning-based Malware Detection via RC4 Ciphertext Analysis
… key generates unique statistical patterns on RC4 ciphertexts. Then, we detect malware packets of RC4 ciphertexts efficiently and accurately by utilizing the discovered statistical patterns of RC4 ciphertext given encryption key. Our proposed schemes directly analyze network packets without …
-
Compression and cryptology
… coding, splaying and Ziv-Lempel compressors. A ciphertext only attack is given for the Ziv-Lempel compressors. These results are used to highlight why better models of natural languages have important applications in cryptology. In particular, it is explained how a better model of a source leads …
-
Oblivious RAM in Scalable SGX
… the monitor- ing and analysis of the encrypted ciphertext as well as a program's memory access patterns. As the attacks grow in complexity and accuracy, innovative protection methods must be de- signed to secure data. This thesis proposes and implements an ORAM controller primitive in TEE and …
-
Optimizing fully homomorphic encryption
… which remove the need for key switching after a ciphertext multiplication, overall halving the runtime of bootstrapping. We also present multiple implementations of 32-bit integer addition evaluation, the fastest of which spends 16 seconds computing the addition circuit and 278 seconds …
-
Dynamic key scheduling algorithm for block ciphers using quasigroup string transformation
… the key affects the output of the ciphers (ciphertext). Keys are traditionally generated from small size input (seed) to a bigger size random key(s). Key scheduling algorithm (KSA) is the mechanism that generates and schedules all sub-keys for each round of encryption. Researches have …
-
On Deniable Computation and Sublinear Graph Algorithms
… the size of the public key and the size of the ciphertexts are bounded by a fixed polynomial, independent of the detection probability achieved by the scheme. The running time of our encryption algorithm depends on the inverse of the detection probability, thus the scheme falls short of …
-
Hiding Decryption Latency in Intel SGX using Metadata Prediction
… be immediately used in decryption of incoming ciphertext data. This hides a significant part of decryption latency and results in faster SGX performance without any changes to the original SGX security guarantees.
-
Arcana: Private tweets on a public microblog platform
… a browser plug-in system, which utilizes CP-ABE (Ciphertext Policy Attribute based encryption), allowing the user to select followers based on predefined attributes. Through simple installation and pre-setting, the user can encrypt and decrypt tweets conveniently and can avoid the fear of …
-
Neural Cryptanalysis for Cyber-Physical System Ciphers
… trains neural networks on a set of plaintext/ciphertext pairs to extract meaningful bitwise relationships and predict corresponding ciphertexts given a set of plaintexts. As opposed to traditional cryptanalysis, the goal is not key recovery but achieving a mimic accuracy greater than a defined …
-
FPGA Implementation and Optimization of Bit Flipping Key Generation Algorithm for Post Quantum Cryptography in Embedded Systems Applications
… focuses on generating a single set of keys and ciphertext per run, it lays a solid foundation for scalable, power-efficient enhancements in the future. This work underscores that even with restrained resources, BIKE can be made realistic, bridging the gap between PQC and real-world embedded …
-
Keeping secrets from those you work with : constructions and characterizations of encryption
… of BC-IBE from public-key encryption with short ciphertext size. Each of these constructions requires slightly different properties of the underlying public-key scheme; we give specific instantiations of each of these constructions, thus achieving BC-IBE from the DDH, LWE, NTRU, and QR …
-
Photonic Entanglement for a Quantum Repeater
… using secret keys created by QKD, then the ciphertext is information-theoretically secure and thus unbreakable for adversaries. Despite its unprecedented security, loss in the physical channel has prevented QKD from being used over distances beyond a few hundred kilometers. Fortunately, …
-
An energy efficient AES engine with DPA-resistance
… reverse algorithm of AES with the knowledge of a ciphertext and a guess of a secret key. Correlation between the power estimate and the power measurement discloses 12 key bytes (among 16) within 20K encryption runs. A newly proposed AES architecture which balances the Hamming weight of register …
-
Infinite Groebner Bases And Noncommutative Polly Cracker Cryptosystems
… We also show how linear algebra can be used in ciphertext attacks and present a technique to overcome such attacks. This is different from the commutative version of the Polly Cracker cryptosystem, which is believed to be susceptible to "intelligent" linear algebra attacks.
-
Detecting presence Of Malicious Hub in MIMI Protocol for Cross-Platform Messaging Interoperability
… It routes every Messaging Layer Security (MLS) ciphertext through a central hub that timestamps the message and broadcasts it to all group participants. If the hub is compromised, it can silently drop, delay, or reorder messages, undermining order integrity while leaving end-to-end encryption …
-
Secure channel free public key encryption with multiple keywords search
… Keyword(s) and also has the characters of Ciphertext Indistinguishability and Trapdoor Indistinguishability so that it proves to be semantic secure under Random Oracle Models by Bilinear Diffie-Hellman (BDH) and 1-Bilinear Diffie-Hellman Inversion(1-BDHI) assumptions for preventing OKGA. …
Page 1 of 2