Muutke küpsiste eelistusi

E-raamat: Noiseless Steganography: The Key to Covert Communications

  • Formaat: 300 pages
  • Ilmumisaeg: 19-Apr-2016
  • Kirjastus: Taylor & Francis Inc
  • ISBN-13: 9781466559110
Teised raamatud teemal:
  • Formaat - EPUB+DRM
  • Hind: 68,89 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
  • Formaat: 300 pages
  • Ilmumisaeg: 19-Apr-2016
  • Kirjastus: Taylor & Francis Inc
  • ISBN-13: 9781466559110
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

"Foreword Steganography is the science and art of covert communications and involves two procedures. First, the required message is concealed in a particular carrier, e.g., image, audio, text, etc., that is called a steganographic cover. The second procedure is concerned with transmitting the cover to the message recipient without drawing suspicion. Fundamentally, the steganographic goal is not to hinder the adversary from decoding a hidden message, but to prevent the adversary from suspecting the existence of covert communications. When using any steganographic technique if suspicion is raised, the goal of steganography is defeated regardless of whether a plaintext is revealed. Contemporary steganography approaches camouflage data as noise in a cover that is assumed to look innocent. For example, the encoded message can be embedded as alteration of digital images, audio files, and text, without noticeable degradation. However, such alteration of authenticated covers can raise suspicion and makes the message detectable. Another example is when linguistics, e.g., using synonymous words, is exploited as a means to conceal a message, causing the presence of abnormal and sometimes weird sentences in a text that become discernible by human and machine examinations. The presence of such unjustifiable noise draws attention and unravels the hidden communications. This book introduces a novel Noiseless Steganography Paradigm (Nostega). Nostega neither hides data in a noise nor produces noise. xi i Foreword Instead, it camouflages messages in a form of unquestionable data in the generated cover. In addition, steganography approaches found in the literature have focused on how to conceal a message and not on how to camouflage its transmittal"--Provided by publisher.



Among the features that make Noiseless Steganography: The Key to Covert Communications a first of its kind:

  • The first to comprehensively cover Linguistic Steganography
  • The first to comprehensively cover Graph Steganography
  • The first to comprehensively cover Game Steganography

Although the goal of steganography is to prevent adversaries from suspecting the existence of covert communications, most books on the subject present outdated steganography approaches that are detectable by human and/or machine examinations. These approaches often fail because they camouflage data as a detectable noise by altering digital images, audio files, text, etc. However, such alteration raises suspicion and makes the message discernible by detecting its noise.

Addressing such shortcomings, Noiseless Steganography: The Key to Covert Communications introduces a novel Noiseless Steganography Paradigm (Nostega). Rather than hiding data in noise or producing noise, Nostega camouflages messages as well as their transmission in the form of unquestionable data in the generated steganographic cover. The book explains how to use Nostega to determine suitable domains capable of generating unsuspicious steganographic cover in which messages are embedded in the form of innocent data that is compatible with the chosen domain. It presents a number of Nostega-based methodologies, including but not limited to:

  • A novel cover type that enables data to be hidden in plotted graphs
  • A novel methodology that pursues popular games such as chess, checkers, crosswords, and dominoes to conceal messages
  • Comprehensive coverage of linguistic steganography
  • Several novel linguistic steganography methodologies based on Natural Language Processing and Computational Linguistic techniques such as: Education-Centric-Based, Summarization-Based, Natural Language Generation Based, Random-Series-Based, Email Headers Based, Automatic Joke Generation Based, List-Based, and Automatic Notes Generation Based

The first book to provide comprehensive coverage of Linguistic Steganography, Graph Steganography, and Game Steganography, it discusses the implementation and steganalysis validation of ten Nostega-based methodologies. It describes how to establish covert channels by employing the selected domain to serve as justification for the interaction and delivery of the cover among the communicating parties. Instead of using contemporary steganography approaches to camouflage your data as noise that is assumed to look innocent, the text provides you with the tools to prevent your adversaries from suspecting the existence of covert communications altogether.

Foreword xiii
Acknowledgments xvii
About the Author xix
Chapter 1 Introduction
1(10)
1.1 Steganography: Definition, Current State, and Concerns
1(1)
1.2 Noiseless Steganography (Nostega) Paradigm
2(5)
1.2.1 The Architecture of Nostega
4(2)
1.2.2 Advantages of Nostega
6(1)
1.3 Summary of the Contributions
7(3)
1.4 Book Outline
10(1)
Chapter 2 Related Work
11(8)
2.1 Textual Steganography
11(6)
2.1.1 Textual Format Manipulation (TFM)
11(1)
2.1.2 Series of Characters and Words
11(1)
2.1.3 Statistical Based
12(1)
2.1.4 Synonym Based
13(2)
2.1.5 Noise Based
15(2)
2.2 Non-Textual Steganography
17(2)
Chapter 3 Graphstega: Graph Steganography Methodology
19(12)
3.1 Graphstega Methodology
19(5)
3.1.1 Message Encoding
20(2)
3.1.2 Graph Cover
22(2)
3.2 Other Steganographic Cover Types
24(4)
3.2.1 Graph in Image Cover
25(1)
3.2.2 Presenting the Graph's Data in Text Cover
26(1)
3.2.3 Presenting the Graph's Data in Audio Cover
26(2)
3.3 Communications Protocol
28(2)
3.4 Conclusion
30(1)
Chapter 4 Chestega: Chess Steganography Methodology
31(18)
4.1 Chestega Methodology
31(9)
4.1.1 Chestega Overview
32(2)
4.1.2 Determining Encoding Parameters
34(1)
4.1.3 Defining Message Encoder
35(1)
4.1.4 Message Camouflaging Scheme
36(3)
4.1.5 Chestega Configuration
39(1)
4.2 Chestega Implementation
40(6)
4.2.1 Chessboard-based Example
40(2)
4.2.2 Non-game Example
42(4)
4.3 Conclusion
46(3)
Chapter 5 Edustega: Education-Centric Steganography Methodology
49(24)
5.1 Edustega Methodology
49(12)
5.1.1 Edustega Overview
50(2)
5.1.2 Establishing Covert Channel
52(2)
5.1.3 Message Encoding
54(4)
5.1.4 Message Camouflaging
58(3)
5.2 Edustega Implementation
61(10)
5.2.1 Edustega System
62(4)
5.2.2 Edustega Examples
66(4)
5.2.3 Bitrate
70(1)
5.3 Conclusion
71(2)
Chapter 6 Sumstega: Summarization-Based Steganography Methodology
73(22)
6.1 Automatic Summarization Overview
73(1)
6.2 Sumstega Carriers
74(7)
6.2.1 Extraction
75(2)
6.2.2 Abstraction
77(3)
6.2.3 Multi-document
80(1)
6.2.4 Cross-lingual
81(1)
6.3 Sumstega Methodology
81(12)
6.3.1 Sumstega Overview
82(1)
6.3.2 Sumstega Architecture
83(2)
6.3.3 Sumstega Encoder
85(1)
6.3.4 Sumstega Camouflager
86(3)
6.3.5 Implementation Example
89(1)
6.3.5.1 Sample of Sumstega Cover
90(1)
6.3.6 Sumstega Communications Protocol
91(1)
6.3.7 Bitrate
92(1)
6.4 Conclusion
93(2)
Chapter 7 Matlist: Mature Linguistic Steganography Methodology
95(36)
7.1 Introduction
96(3)
7.1.1 Natural Language Generation and Template
96(1)
7.1.2 Matlist Versus Previous Work
97(2)
7.2 Matlist Methodology
99(11)
7.2.1 Matlist Architecture Overview
100(2)
7.2.2 DSS Determination
102(1)
7.2.3 DSS Specifications
103(3)
7.2.4 Building Matlist Encoder
106(1)
7.2.5 Building Matlist NLG or Template System
107(2)
7.2.6 Implementing Matlist Communications Protocol
109(1)
7.3 Matlist Implementation
110(19)
7.3.1 DSS of Consumer Price Index
111(1)
7.3.1.1 First Implementation Example of CPI
112(4)
7.3.1.2 Second Implementation Example of CPI
116(3)
7.3.1.3 Text Substitution
119(1)
7.3.1.4 Third Implementation Example of CPI
119(4)
7.3.2 Other DSS
123(1)
7.3.2.1 DSS of Elementary Math
123(1)
7.3.2.2 DSS of Selling Books
124(2)
7.3.2.3 DSS of Chemistry
126(1)
7.3.2.4 DSS of Discrete Math
126(2)
7.3.3 Matlist Bitrate
128(1)
7.4 Conclusion
129(2)
Chapter 8 Normals: Normal Linguistic Steganography Methodology
131(22)
8.1 Normals Methodology
132(7)
8.1.1 Normals Overview
132(1)
8.1.2 Normals NLGS
133(2)
8.1.3 Normals Encoder
135(1)
8.1.4 NLGS Inputs
136(1)
8.1.5 Normals Communications Protocol
137(2)
8.2 Normals Implementation
139(9)
8.2.1 Determining Normals NLGS
140(2)
8.2.2 Determining Normals Encoder
142(1)
8.2.3 Normals Cover
143(3)
8.2.4 Determining Normals Communications Protocol
146(2)
8.3 Performance
148(3)
8.4 Conclusion
151(2)
Chapter 9 Headstega: Steganography Methodology
153(14)
9.1 Headstega Methodology
154(6)
9.1.1 Headstega Overview
154(3)
9.1.2 Message Encoding
157(1)
9.1.3 Message Camouflager
158(2)
9.2 Headstega Implementation
160(5)
9.2.1 Headstega Configuration
161(1)
9.2.2 Headstega Example
162(1)
9.2.2.1 Sample Head Cover
163(1)
9.2.3 Bitrate
163(2)
9.3 Conclusion
165(2)
Chapter 10 Jokestega: Automatic Joke Generation-Based Steganography Methodology
167(20)
10.1 Automatic Joke Generation Systems
168(1)
10.2 Jokestega Methodology
168(7)
10.2.1 Automatic Jokes Generator System
171(1)
10.2.2 Message Encoder
172(1)
10.2.3 Camouflager
173(1)
10.2.4 Establishing Covert Channel
174(1)
10.3 Jokestega Implementation
175(9)
10.3.1 Jokestega System
176(3)
10.3.2 Joke Cover Example
179(2)
10.3.3 Jokestega Performance
181(3)
10.4 Conclusion
184(3)
Chapter 11 Listega: Steganography Methodology
187(16)
11.1 Listega Methodology
187(9)
11.1.1 Listega Architecture
188(2)
11.1.2 Domain Determination
190(1)
11.1.3 Message Encoding
191(1)
11.1.4 Message Camouflager
192(3)
11.1.5 Communications Protocol
195(1)
11.2 Listega Implementation
196(6)
11.2.1 Listega Configuration
196(2)
11.2.2 Listega Examples
198(4)
11.3 Conclusion
202(1)
Chapter 12 Notestega: Steganography Methodology
203(12)
12.1 Automatic Note Taking
204(1)
12.2 Notestega Methodology
205(5)
12.2.1 Notestega Architecture
206(2)
12.2.2 Topic(s) Determination
208(1)
12.2.3 Message Encoding
208(1)
12.2.4 Message Camouflager
209(1)
12.3 Notestega Implementation
210(3)
12.3.1 Notestega Configuration
210(2)
12.3.2 Samples of Note Cover
212(1)
12.4 Conclusion
213(2)
Chapter 13 Steganalysis Validation
215(40)
13.1 Traffic Attack
215(1)
13.2 Contrast and Comparison Attacks
216(1)
13.3 Linguistics Attacks
217(1)
13.4 Statistical Signature
218(32)
13.4.1 Zipfian Signature
219(13)
13.4.2 Letter Frequency Distribution
232(14)
13.4.3 Kullback-Leibler Divergence
246(4)
13.5 Conclusion
250(5)
Chapter 14 Conclusion and Future Work
255(10)
14.1 Contributions
255(4)
14.2 Bitrate
259(3)
14.3 Final Conclusion and Future Work
262(3)
Bibliography 265(12)
Index 277
Dr. Abdelrahman Desoky is a scientist and an ambitious Computer Engineering Doctorate with over twenty years of experience in the computer field. He is an experienced educator at both the graduate and undergraduate levels. Furthermore, he has industrial expertise in developing full life cycle systems such as software, hardware, security, and telecommunications/networks. Dr. Desoky received a Doctoral Degree (Ph.D.) from The University of Maryland, Baltimore County (UMBC) and a Master of Science (M.Sc.) from the George Washington University; both degrees are in Computer Engineering. His Doctoral Dissertation is entitled "Nostega: A Novel Noiseless Steganography Paradigm." The paradigm explores the topic of noiseless steganography, which refers to the science and art of covert communications. Nostega provides a way to secure information in static stage and during data transmission to a legitimate recipient. His M.Sc. degree concentrated on Computer Architecture and Networks. His research is entitled "Security Architecture for Computers and Networks". Currently, he is The Academia Planet, CEO.