1 |
Reversible data hiding technologies for encrypted imagesYi, Shuang January 2018 (has links)
University of Macau / Faculty of Science and Technology. / Department of Computer and Information Science
|
2 |
Hardware realization for Advanced Encryption Standard key generation /Yang, Wen-Chun. January 1900 (has links)
Thesis (M.S.)--Oregon State University, 2005. / Printout. Includes bibliographical references (leaves 32-33). Also available on the World Wide Web.
|
3 |
Symmetric encryption with multiple keys : techniques and applications /Barlow, Lelia C. January 1900 (has links)
Thesis (M.S.)--Oregon State University, 2006. / Printout. Includes bibliographical references (leaves 76-78). Also available on the World Wide Web.
|
4 |
Hardware realization of OCB mode for efficient authenticated encryption /Al Faresi, Ahmed. January 1900 (has links)
Thesis (M.S.)--Oregon State University, 2006. / Printout. Includes bibliographical references (leaves 56-57). Also available on the World Wide Web.
|
5 |
A comparative study of AES implementations on ARM processors /Shamsuddin, Rayees. January 1900 (has links)
Thesis (M.S.)--Oregon State University, 2006. / Printout. Includes bibliographical references (leaves 45-46). Also available on the World Wide Web.
|
6 |
A distributed password scheme for network operating systems /Roth, Christopher. January 2002 (has links) (PDF)
Thesis (M.S.)--Naval Postgraduate School, 2002. / Thesis advisor(s): James B. Michael, Craig Rasmussen. Includes bibliographical references (p. 47-48). Also available online.
|
7 |
Side channel attack resistant elliptic curves cryptosystem on multi-cores for power efficiency /Yoo, Jaewon. January 1900 (has links)
Thesis (M.S.)--Oregon State University, 2009. / Printout. Includes bibliographical references (leaves 73-76). Also available on the World Wide Web.
|
8 |
Quantum key distribution protocols with high rates and low costsZhang, Zheshen. January 2009 (has links)
Thesis (M. S.)--Electrical and Computer Engineering, Georgia Institute of Technology, 2009. / Committee Chair: Paul Voss; Committee Member: Abdallah Ougazzaden; Committee Member: David Citrin
|
9 |
Cryptanalysis and enhancement of authentication protocols /Kim, Minho. January 1900 (has links)
Thesis (Ph. D.)--Oregon State University, 2007. / Printout. Includes bibliographical references (leaves 110-118). Also available on the World Wide Web.
|
10 |
Encryption security against key-dependent-message attacks: applications, realizations and separationsHajiabadi, Mohammad 17 August 2016 (has links)
In this thesis we study the notion of circular security for bit-encryption schemes.
Informally speaking, a bit-encryption scheme is circular secure if it remains secure
even if the key of the system is used to encrypt its own individual bits. This notion
(or slight extensions thereof) has foundational applications, most notably in
the context of fully-homomorphic encryption and amplification techniques for key dependent-
message security.
We explore the notion of circular security from three different perspectives, stemming
from (1) assumptions sufficient to realize this notion, (2) minimal black-box
assumptions on which this notion can be based and (c) applications of this notion
when combined with other properties. Our main results are as follows:
We give a construction of circular-secure public-key bit encryption based on any
public-key encryption scheme that satisfies two special properties. We show
that our constructed scheme besides circular security also offers two forms of
key-leakage resilience. Our construction unifies two existing specific constructions
of circular-secure schemes in the literature and also gives rise to the first
construction based on homomorphic hash proof systems.
We show that seed-circular-secure public-key bit-encryption schemes cannot be
based on semantically-secure public-key encryption schemes in a fully-blackbox
way. A scheme is seed-circular-secure if it allows for the bits of the seed
(used to generate the public/secret keys) to be securely encrypted under the
corresponding public key. We then extend this result to rule out a large and
non-trivial class of constructions for circular security that we call key-isolating
constructions.
We give generic constructions of several fundamental cryptographic primitives
based on a public-key bit-encryption scheme that combines circular security
with a structural property called reproducibility. The main primitives that
we build include families of trapdoor functions with strong security properties
(i.e., one-wayness under correlated inputs), adaptive-chosen-ciphertext (CCA2)
secure encryption schemes and deterministic encryption schemes. / Graduate / 0984
|
Page generated in 0.1364 seconds