26 December 2021
25 December 2021
29 November 2021
વાત વાત માં એની વાત.!
અંક ૨ (બીજો)
જ્યારે હું જમીન પર ઢળી પડ્યો, ત્યારે મારા માથામાં ઇજા થઈ ગઈ.
મારો મિત્ર તરત જ દોડી ગયો અને પાણી લઈને આવ્યો.
તે ચિંતિત અવાજમાં બોલ્યો, “તું ઠીક તો છે ને?”
મેં ધીમેથી કહ્યું, “હા… હું ઠીક છું.”
ત્યાર બાદ તે ફરી બોલ્યો, “એવી શું યાદ છે કે જે તને આટલો હચમચાવી દે?”
મેં થોડું થંભીને કહ્યું,
“એ મારી આત્મા હતી… મારો શ્વાસ હતી…
પણ એણે પોતાના પિતાની ખુશી માટે મને છોડી દીધો.”
“જ્યારે એની યાદ આવે છે ને… ત્યારે બધું જ ભૂલી જવાય છે.
ખાલી એ જ યાદ રહે છે.”
“એ મારી અનહદ ખુશી હતી…
પણ કદાચ એ મારા નસીબમાં નહોતી લખાયેલી.”
“એ જ્યાં પણ હોય… ખુશ રહે—
ભગવાન પાસે મારી બસ એટલી જ પ્રાર્થના છે.”
મારો મિત્ર થોડો ગુસ્સે થઈને બોલ્યો,
“તું પાગલ છે! આટલું બધું થયા પછી પણ તું એને જ પ્રેમ કરે છે?”
“અંજલિને ભૂલી જા હવે…
એ હવે તને ક્યારેય નહીં મળે!”
મારો મિત્ર હજુ બોલી રહ્યો હતો, એટલામાં જ એક નાનું બાળક મારી પાસે આવીને ઊભું રહ્યું.
પાછળથી એક સ્ત્રીનો અવાજ આવ્યો—
“પ્રતિક!”
એ અવાજમાં કંઈક ઓળખાણ હતી…
જાણે કોઈ જૂની યાદ ફરી જીવંત થઈ ગઈ હોય.
અને એ નામ…
એ મને કંઈક યાદ અપાવી રહ્યું હતું…
લી. પ્રતિક ની કલમે
વધુ આવતા અંકમાં…
24 November 2021
22 November 2021
21 November 2021
20 November 2021
19 November 2021
Got work appreciation from vice president of Torrent pharma
18 November 2021
17 November 2021
16 November 2021
14 November 2021
भगत और भगवान
delete n download
stress
13 November 2021
12 November 2021
11 July 2021
04 June 2021
26 May 2021
DAILY DOSE OF GK
GK OF THE DAY
23 May 2021
GK OF THE DAY
17 May 2021
जाने!! 2020-21 में पहली बार जो हुआ....
09 May 2021
सुख और दुख
07 May 2021
આજની વરવી વાસ્તવિકતા
એકાંત
04 May 2021
હું આવું...???
એમની કરકસર તો જુઓ
સારા કામ કરતા રહો
ઝીંદગી સમય ની રાહ નથી જોતી…
યાદો નો થેલો
જિંદગી તમને એ નથી આપતી
ઈચ્છા થાય તો એક મુલાકાત કરી લેવી
મારે કંઈ વધારે તો નથી કહેવું
હિંમત
જીતવી છે દુનિયા
કોઈ પણ લક્ષ્ય
શરૂવાત એક subharambh
સહારો
Mere Halat 😞
Mere halat mere halat bata rahe hai,😟
Aaj kal mujhe mere apne Sata rahe hai, 😑
Aur jin chirago ko rakha tha hawa se bacha kar mene , 😕
Wahi aaj hawa sang sajish racha rahe hai😌
02 May 2021
અપમાન
જીવનમાં આગળ વધવું હોય તો આ વાત જરૂર સાંભળો મારી.
ઝુકેલી નઝરથી જોયું તમે
ભૂલ કદાચ બહુ મોટી કરી લીધી
લોકો કહે છે કે નફરત બહુ ખરાબ વસ્તુ છે...સાહેબ..
shikhaaman of the day
कुछ अलग करना हो तो
કોરોના મુક્તિ મંત્ર*🤣
અભિમાન હતું કે
29 April 2021
supreme court
what do know about Buddhist Dharm
joke of the day
मेरा मन नहीं इज़ाज़त देता मुझे
what you need to make a difference in someone’s life ?
તણાવ
अच्छी बात नहीं है.....!
ઘાયલ
28 April 2021
Gk of the Day
राज्यपाल सामान्य ज्ञान प्रश्नोत्तरी
प्रमुख पुस्तकें
22 April 2021
What is Pagoda ?
20 April 2021
Current Affairs For All Upcoming Exams
માથાકૂટ
*ત્રણ ટાઈમ ના રોટલા જેટલું તો કુદરત આપી જ દે છે,*
*સાહેબ પણ,*
*માથાકૂટ તો રોટલા ઉપર જે " ઘી,બટર અને જામ " લગાવવું છે ને એની છે...*
Daily-doze of gk: edition 402
Vlan ping issue
19 April 2021
Daily-doze of gk edition 401
one-liner Gk of the day : Edition 3
10 April 2021
વાત વાત માં એની વાત! .
અંક ૧ (પહેલો)
એક દિવસ હું અને મારો મિત્ર બંને સાથે બેઠા હતા. વર્ષો પછી મળ્યા હોવાથી, અમે એકબીજાને મળીને ખૂબ ખુશ થયા.
થોડા સમય બાદ મારા મિત્રનો પહેલો પ્રશ્ન હતો, “યાર, જિંદગી કેવી ચાલે છે?”
મેં ધીમા અવાજે જવાબ આપ્યો, “જેમ ચાલવી જોઈએ તેમ.”
એટલામાં જ અચાનક એક અવાજ આવ્યો. અમે નજર કરી તો બે પતિ-પત્ની ઝઘડતા હતા.
મારો મિત્ર બોલ્યો, “અરે યાર, આ તો રોજનું જ હશે.”
હું થોડો સમય સુધી તેમને જોતો રહ્યો અને પછી પાછો આવીને બેસી ગયો.
મેં કહ્યું, “શું માટે ઝઘડતા હશે? પ્રેમથી રહી ન શકે?”
એટલામાં મારો મિત્ર અચાનક બોલ્યો, “અરે, અંજલિ ક્યાં છે?”
અંજલિ મારી માટે શું હતી, એ તો માત્ર હું જ જાણતો હતો.
હું થોડો સમય મૌન રહ્યો.
તે ફરી બોલ્યો, “જવાબ આપ ને…?”
એની વાણી મને કંઈક અલગ લાગી.
મેં ધીમેથી કહ્યું, “મને નથી ખબર…”
પછી અમે બંને થોડો સમય ચૂપ રહ્યા.
તે બોલ્યો, “માફ કરજે દોસ્ત, મને ખબર નહોતી…”
મેં કહ્યું, “કોઈ વાંધો નથી. મને તેની કોઈ શિકાયત નથી…
એ જ્યાં પણ હોય, ખુશ હોય—બસ એટલું જ જોઈએ.”
આવું કહેતા જ તે બોલ્યો, “ભાઈ, તું વાત ખોટી કરી…”
એ શબ્દો સાંભળતાં જ મને કંઈક થવા લાગ્યું.
મારી આંખોમાં જાણે હજારો વર્ષોથી ભરાયેલો દરિયો ઉભરી આવ્યો.
હૈયું ફાટી નીકળે એવું રુદન થઈ રહ્યું હતું…
અને એ જ પળે હું જમીન પર ઢળી પડ્યો.
લી. પ્રતિક ની કલમે
વધુ આવતા અંકમાં… 👌
09 April 2021
और गांव में क्या चल रहा है !
😔 तेरे लगाये हुए ज़ख्म क्यों नहीं भरते..💔
मेरे लगाये हुए पेड़ भी सुख जाते हैं..😶
कोई तुम्हारा सफर🙆 पर गया तो पूँछेगें...🙏
कि रेल गुज़ारे तो हम हाँथ क्यूँ हिलाते🙌 हैं..😧
और सुना है उसने शादी 👫बी की है किसीसे
और गांव 🏡में क्या चल रहा है !💔
08 April 2021
महीनो बाद दफ्तर !
🙌महीनो बाद दफ्तर🏢 आ रहे है ,😟
हम एक सदमे💔 से बाहर आ रहे है,😗
तेरी बाहो😌 से दिल तंग आ गया है ,💔
अब इस जुले में चक्कर आ रहे है !🙆
07 April 2021
और एक दिन !
😌और एक दिन मुझे मेरी ज़िंदगी बुरी लगने लगी,
जिसको आबाद करने में मेरे माँ बाप 👪 की ज़िंदगी लग गयी ,🙆
सब सवालात अज़बर थे जो मुझसे पूछे गए मोहबत्त की अदालत में,😐
ये बात अलग है की इस सिफारिस में किसी और की नौकरी लग गयी !😶💔
06 April 2021
सब कुछ बदला !
💔 कैसे उसने ये सब मुझसे छुपकर बदला,
चेहरा बदला, रास्ता बदला , बाद में घर बदला ,😌
में उसके बारे मैं कहता था लोगों से ,🙆
मेरा नाम बदल देना अगर वो शख्स बदला !💔
20 March 2021
14 March 2021
11 March 2021
TechNews updated on tonight
03 February 2021
Traffic Flow Security
Traffic
Flow Security
So far, we have looked at controls
that cover the most common network threats: cryptography for eavesdropping, authentication
methods for impersonation, intrusion detection systems for attacks in progress,
architecture for structural flaws. Earlier in this chapter, we listed threats,
including a threat of traffic flow inference. If the attacker can detect an
exceptional volume of traffic between two points, the attacker may infer the
location of an event about to occur.
The countermeasure to traffic flow
threats is to disguise the traffic flow. One way to disguise traffic flow,
albeit costly and perhaps crude, is to ensure a steady volume of traffic
between two points. If traffic between A and B is encrypted so that the
attacker can detect only the number of packets flowing, A and B can agree to
pass recognizable (to them) but meaningless encrypted traffic. When A has much
to communicate to B, there will be few meaningless packets; when communication
is light, A will pad the traffic stream with many spurious packets.
A more sophisticated approach to
traffic flow security is called onion
routing. Consider a message that is covered in multiple layers, like the
layers of an onion. A wants to send a message to B but doesn't want anyone in
or intercepting traffic on the network to know A is communicating with B. So A
takes the message to B, wraps it in a package for D to send to B. Then, A wraps
that package in another package for C to send to D. Finally, A sends this
package to C. This process is shown in Figure 8. The
internal wrappings are all encrypted under a key appropriate for the
intermediate recipient.
Figure 8 Onion
Routing.
Receiving the package, C knows it
came from A, although C does not know if A is the originator or an intermediate
point. C then unwraps the outer layer and sees it should be sent to D. At this
point, C cannot know if D is the final recipient or merely an intermediary. C
sends the message to D, who unwraps the next layer. D knows neither where the
package originally came from nor where its final destination is. D forwards the
package to B, its ultimate recipient.
With this scheme, any intermediate
recipients—those other than the original sender and ultimate receiver—know
neither where the package originated nor where it will end up. This scheme
provides confidentiality of content, source, destination, and routing.
02 February 2021
Honeypots
Honeypots
How do you catch a mouse? You set a
trap with bait (food the mouse finds attractive) and catch the mouse after it
is lured into the trap. You can catch a computer attacker the same way.
You put up a honeypot for several
reasons:
·
to watch what attackers do, in order to learn about new attacks
(so that you can strengthen your defenses against these new attacks)
·
to lure an attacker to a place in which you may be able to learn
enough to identify and stop the attacker
·
to provide an attractive but diversionary playground, hoping that
the attacker will leave your real system alone
A honeypot has no special features.
It is just a computer system or a network segment, loaded with servers and
devices and data. It may be protected with a firewall, although you want the
attackers to have some access. There may be some monitoring capability, done
carefully so that the monitoring is not evident to the attacker.
01 February 2021
Alarms and Alerts
Alarms and
Alerts
The logical view of network
protection looks like Figure 7,
in which both a router and a firewall provide layers of protection for the
internal network. Now let us add one more layer to this defense.
Figure 7 Layered Network Protection.
An intrusion detection system is a device that is placed inside a
protected network to monitor what occurs within the network. If an attacker is
able to pass through the router and pass through the firewall, an intrusion
detection system offers the opportunity to detect the attack at the beginning,
in progress, or after it has occurred. Intrusion detection systems activate an
alarm, which can take defensive action. We study intrusion detection systems in
more detail later in this chapter.
31 January 2021
Access Controls
Access
Controls
Authentication deals with the who of security policy enforcement; access
controls enforce the what andhow.
ACLs on Routers
Routers perform the major task of
directing network traffic either to subnetworks they control or to other
routers for subsequent delivery to other subnetworks. Routers convert external
IP addresses into internal MAC addresses of hosts on a local subnetwork.
Suppose a host is being spammed
(flooded) with packets from a malicious rogue host. Routers can be configured
with access control lists to deny access to particular hosts from particular
hosts. So, a router could delete all packets with a source address of the rogue
host and a destination address of the target host.
This approach has three problems,
however. First, routers in large networks perform a lot of work: They have to
handle every packet coming into and going out of the network. Adding ACLs to the
router requires the router to compare every packet against the ACLs. One ACL
adds work, degrading the router's performance; as more ACLs are added, the
router's performance may become unacceptable. The second problem is also an
efficiency issue: Because of the volume of work they perform, routers are
designed to perform only essential services. Logging of activity is usually not
done on a router because of the volume of traffic and the performance penalty
logging would entail. With ACLs, it would be useful to know how many packets
were being deleted, to know if a particular ACL could be removed (thereby
improving performance). But without logging it is impossible to know whether an
ACL is being used. These two problems together imply that ACLs on routers are
most effective against specific known threats but that they should not be used
indiscriminately.
The final limitation on placing
ACLs on routers concerns the nature of the threat. A router inspects only
source and destination addresses. An attacker will usually not reveal an actual
source address. To reveal the real source address would be equivalent to a bank
robber's leaving his home address and a description of where he plans to store
the stolen money.
Because someone can easily forge
any source address on a UDP datagram, many attacks use UDP protocols with false
source addresses so that the attack cannot be blocked easily by a router with
an ACL. Router ACLs are useful only if the attacker sends many datagrams with
the same forged source address.
In principle, a router is an
excellent point of access control because it handles every packet coming into
and going out of a subnetwork. In specific situations, primarily for internal
subnetworks, ACLs can be used effectively to restrict certain traffic flows,
for example, to ensure that only certain hosts (addresses) have access to an
internal network management subnetwork. But for large-scale, general traffic
screening, routers are less useful than firewalls.
Firewalls
A firewall is designed to do the
screening that is less appropriate for a router to do. A router's primary
function is addressing, whereas a firewall's primary function is filtering.
Firewalls can also do auditing. Even more important, firewalls can examine an
entire packet's contents, including the data portion, whereas a router is
concerned only with source and destination MAC and IP addresses. Because they
are an extremely important network security control, we study firewalls in an
entire section later in this chapter.
30 January 2021
Strong Authentication
Strong
Authentication
As we have seen in earlier
chapters, operating systems and database management systems enforce a security
policy that specifies who—which individuals, groups, subjects—can access which
resources and objects. Central to that policy is authentication: knowing and
being assured of the accuracy of identities.
Networked environments need
authentication, too. In the network case, however, authentication may be more
difficult to achieve securely because of the possibility of eavesdropping and
wiretapping, which are less common in nonnetworked environments. Also, both
ends of a communication may need to be authenticated to each other: Before you send
your password across a network, you want to know that you are really
communicating with the remote host you expect. Lampson presents the problem of
authentication in autonomous, distributed systems; the real problem, he points
out, is how to develop trust of network entities with whom you have no basis
for a relationship. Let us look more closely at authentication methods
appropriate for use in networks.
One-Time
Password
The wiretap threat implies that a
password could be intercepted from a user who enters a password across an
unsecured network. A one-time password can guard against wiretapping and
spoofing of a remote host.
As the name implies, a one-time password is good for one use only. To see how
it works, consider the easiest case, in which the user and host both have
access to identical lists of passwords, like the one-time pad for cryptography
from Chapter 2. The user would enter the first password for the first login,
the next one for the next login, and so forth. As long as the password lists remained
secret and as long as no one could guess one password from another, a password
obtained through wiretapping would be useless. However, as with the one-time
cryptographic pads, humans have trouble maintaining these password lists.
To address this problem, we can use
a password token, a device that generates a password
that is unpredictable but that can be validated on the receiving end. The
simplest form of password token is a synchronous one, such as the SecurID
device from Security Dynamics. This device displays a random number, generating
a new number every minute. Each user is issued a different device (that
generates a different key sequence). The user reads the number from the
device's display and types it in as a one-time password. The computer on the
receiving end executes the algorithm to generate the password appropriate for
the current minute; if the user's password matches the one computed remotely,
the user is authenticated. Because the devices may get out of alignment if one
clock runs slightly faster than the other, these devices use fairly natural
rules to account for minor drift.
What are the advantages and
disadvantages of this approach? First, it is easy to use. It largely counters
the possibility of a wiretapper reusing a password. With a strong
password-generating algorithm, it is immune to spoofing. However, the system
fails if the user loses the generating device or, worse, if the device falls
into an attacker's hands. Because a new password is generated only once a
minute, there is a small (one minute) window of vulnerability during which an
eavesdropper can reuse an intercepted password.
Challenge–Response
Systems
To counter the loss and reuse
problems, a more sophisticated one-time password scheme uses challenge and
response, as we first studied in Chapter 4. A challenge and response device
looks like a simple pocket calculator. The user first authenticates to the
device, usually by means of a PIN. The remote system sends a random number,
called the "challenge," which the user enters into the device. The
device responds to that number with another number, which the user then
transmits to the system.
The system prompts the user with a
new challenge for each use. Thus, this device eliminates the small window of
vulnerability in which a user could reuse a time-sensitive authenticator. A
generator that falls into the wrong hands is useless without the PIN. However,
the user must always have the response generator to log in, and a broken device
denies service to the user. Finally, these devices do not address the
possibility of a rogue remote host.
29 January 2021
Content Integrity
Content
Integrity
Content integrity comes as a bonus
with cryptography. No one can change encrypted data in a meaningful way without
breaking the encryption. This does not say, however, that encrypted data cannot
be modified. Changing even one bit of an encrypted data stream will affect the
result after decryption, often in a way that seriously alters the resulting
plaintext. We need to consider three potential threats:
·
malicious modification that changes content in a meaningful way
·
malicious or nonmalicious modification that changes content in a
way that is not necessarily meaningful
·
nonmalicious modification that changes content in a way that will
not be detected
Encryption addresses the first of
these threats very effectively. To address the others, we can use other
controls.
Error
Correcting Codes
We can use error detection and error
correction codes to guard
against modification in a transmission. The codes work as their names imply:
Error detection codes detect when an error has occurred, and error correction
codes can actually correct errors without requiring retransmission of the
original message. The error code is transmitted along with the original data,
so the recipient can recompute the error code and check whether the received
result matches the expected value.
The simplest error detection code
is a parity check. An
extra bit is added to an existing group of data bits depending on their sum or
an exclusive OR. The two kinds of parity are called even and odd. Witheven parity the extra bit is 0 if the sum of the
data bits is even and 1 if the sum is odd; that is, the parity bit is set so
that the sum of all data bits plus the parity bit is even. Odd parity is the same except the sum is odd. For
example, the data stream 01101101 would have an even parity bit of 1 (and an
odd parity bit of 0) because 0+1+1+0+1+1+0+1 = 5 + 1 = 6 (or 5 + 0 = 5 for odd
parity). A parity bit can reveal the modification of a single bit. However,
parity does not detect two-bit errors—cases in which two bits in a group are
changed. That is, the use of a parity bit relies on the assumption that
single-bit errors will occur infrequently, so it is very unlikely that two bits
would be changed. Parity signals only that a bit has been changed; it does not identify
which bit has been changed.
There are other kinds of error
detection codes, such as hash
codes and Huffman codes. Some of
the more complex codes can detect multiple-bit errors (two or more bits changed
in a data group) and may be able to pinpoint which bits have been changed.
Parity and simple error detection
and correction codes are used to detect nonmalicious changes in situations in
which there may be faulty transmission equipment, communications noise and
interference, or other sources of spurious changes to data.
Cryptographic
Checksum
Malicious modification must be
handled in a way that prevents the attacker from modifying the error detection
mechanism as well as the data bits themselves. One way to do this is to use a
technique that shrinks and transforms the data, according to the value of the
data bits.
To see how such an approach might
work, consider an error detection code as a many-to-one transformation. That
is, any error detection code reduces a block of data to a smaller digest whose
value depends on each bit in the block. The proportion of reduction (that is,
the ratio of original size of the block to transformed size) relates to the
code's effectiveness in detecting errors. If a code reduces an eight-bit data
block to a one-bit result, then half of the 28 input values map to 0 and half
to 1, assuming a uniform distribution of outputs. In other words, there are
28/2 = 27 = 128 different bit patterns that all produce the same one-bit
result. The fewer inputs that map to a particular output, the fewer ways the
attacker can change an input value without affecting its output. Thus, a
one-bit result is too weak for many applications. If the output is three bits
instead of one, then each output result comes from 28/23 or 25 = 32 inputs. The
smaller number of inputs to a given output is important for blocking malicious
modification.
A cryptographic
checksum (sometimes called a message digest) is a cryptographic function
that produces a checksum. The cryptography prevents the attacker from changing
the data block (the plaintext) and also changing the checksum value (the
ciphertext) to match.
28 January 2021
Encryption
Encryption
Encryption is probably the most important and
versatile tool for a network security expert. We have seen in earlier chapters
that encryption is powerful for providing privacy, authenticity, integrity, and
limited access to data. Because networks often involve even greater risks, they
often secure data with encryption, perhaps in combination with other controls.
In network applications, encryption can be
applied either between two hosts (called link encryption) or between two
applications (called end-to-end encryption). We consider each below. With
either form of encryption, key distribution is always a problem. Encryption
keys must be delivered to the sender and receiver in a secure manner. In this
section, we also investigate techniques for safe key distribution in networks.
Finally, we study a cryptographic facility for a network computing environment.
Link Encryption
In link encryption,
data are encrypted just before the system places them on the physical
communications link. In this case, encryption occurs at layer 1 or 2 in the OSI
model. (A similar situation occurs with TCP/IP protocols.) Similarly,
decryption occurs just as the communication arrives at and enters the receiving
computer. A model of link encryption is shown in Figure 2.
Figure 2 Link Encryption.
Encryption protects the message in transit
between two computers, but the message is in plaintext inside the hosts. (A
message in plaintext is said to be "in the clear.") Notice that
because the encryption is added at the bottom protocol layer, the message is
exposed in all other layers of the sender and receiver. If we have good
physical security, we may not be too concerned about this exposure; the
exposure occurs on the sender's or receiver's host or workstation, protected by
alarms or locked doors, for example. Nevertheless, you should notice that the
message is exposed in two layers of all intermediate hosts through which the
message may pass. This exposure occurs because routing and addressing are not
read at the bottom layer, but only at higher layers. The message is in the
clear in the intermediate hosts, and one of these hosts may not be especially
trustworthy.
Link encryption is invisible to the user. The
encryption becomes a transmission service performed by a low-level network
protocol layer, just like message routing or transmission error detection. Figure 3shows a typical link encrypted message, where the shaded fields
are encrypted. Because some of the data link header and trailer is applied
before the block is encrypted, part of each of those blocks is shaded. As the
message M is handled at each layer, header and control information is added on
the sending side and removed on the receiving side. Hardware encryption devices
operate quickly and reliably; in this case, link encryption is invisible to the
operating system as well as to the operator.
Figure 3 Message Under Link Encryption.
Link encryption is especially appropriate when
the transmission line is the point of greatest vulnerability. If all hosts on a
network are reasonably secure but the communications medium is shared with
other users or is not secure, link encryption is an easy control to use.
End-to-End Encryption
As its name implies, end-to-end encryption provides security from one end of a transmission
to the other. The encryption can be applied by a hardware device between the
user and the host. Alternatively, the encryption can be done by software
running on the host computer. In either case, the encryption is performed at
the highest levels (layer 7, application, or perhaps at layer 6, presentation)
of the OSI model. A model of end-to-end encryption is shown in Figure 4.
Figure 4 End-to-End Encryption.
Since the encryption precedes all the routing
and transmission processing of the layer, the message is transmitted in
encrypted form throughout the network. The encryption addresses potential flaws
in lower layers in the transfer model. If a lower layer should fail to preserve
security and reveal data it has received, the data's confidentiality is not
endangered. Figure 5 shows a typical message with end-to-end encryption, again with the
encrypted field shaded.
Figure 5 End-to-End Encrypted Message.
When end-to-end encryption is used, messages
sent through several hosts are protected. The data content of the message is
still encrypted, as shown in Figure 6, and the message is encrypted (protected against disclosure)
while in transit. Therefore, even though a message must pass through
potentially insecure nodes (such as C through G) on the path between A and B,
the message is protected against disclosure while in transit.
Figure 6 Encrypted Message Passing Through a Host.