What is wide-mouth frog?
Answers were Sorted based on User's Feedback
Answer / jitendra
The Wide Mouth Frog protocol is a computer network
authentication protocol designed for use on insecure
networks (the Internet for example). It allows individuals
communicating over a network to prove their identity to
each other while also preventing eavesdropping or replay
attacks, and provides for detection of modification and the
prevention of unauthorized reading
Is This Answer Correct ? | 6 Yes | 1 No |
The Wide Mouth Frog protocol is a computer network
authentication protocol designed for use on insecure
networks (the Internet for example). It allows individuals
communicating over a network to prove their identity to each
other while also preventing eavesdropping or replay attacks,
and provides for detection of modification and the
prevention of unauthorized reading (cont)........
This can be proven using BAN logic.
The protocol can be specified as follows in security
protocol notation, where Alice is authenticating herself to
Bob using a server S:
A ightarrow S: A,{T_A, K_{AB}, B}_{K_{AS}}
S ightarrow B: {T_S, K_{AB}, A}_{K_{BS}}
Note that to prevent active attacks, some form of
authenticated encryption (or message authentication) must be
used.
The protocol has several problems:
* a global clock is required.
* the server has access to all keys.
* the value of the shared key between A and B is completely
determined by A.
* can replay messages within period when timestamp is valid.
* A is not assured that B exists.
* The protocol is stateful. This is usually undesired
because it requires more functionality and capability from
the server. For example, "S" must be able to deal with
situations in which "B" is unavailable.
------- :)---------
Is This Answer Correct ? | 1 Yes | 0 No |
The Wide Mouth Frog protocol is a computer network
authentication protocol designed for use on insecure
networks (the Internet for example). It allows individuals
communicating over a network to prove their identity to each
other while also preventing eavesdropping or replay attacks,
and provides for detection of modification and the
prevention of unauthorized reading (cont)........
This can be proven using BAN logic.
The protocol can be specified as follows in security
protocol notation, where Alice is authenticating herself to
Bob using a server S:
A ightarrow S: A,{T_A, K_{AB}, B}_{K_{AS}}
S ightarrow B: {T_S, K_{AB}, A}_{K_{BS}}
Note that to prevent active attacks, some form of
authenticated encryption (or message authentication) must be
used.
The protocol has several problems:
* a global clock is required.
* the server has access to all keys.
* the value of the shared key between A and B is completely
determined by A.
* can replay messages within period when timestamp is valid.
* A is not assured that B exists.
* The protocol is stateful. This is usually undesired
because it requires more functionality and capability from
the server. For example, "S" must be able to deal with
situations in which "B" is unavailable.
------- :)---------
Is This Answer Correct ? | 0 Yes | 0 No |
The Wide Mouth Frog protocol is a computer network
authentication protocol designed for use on insecure
networks (the Internet for example). It allows individuals
communicating over a network to prove their identity to each
other while also preventing eavesdropping or replay attacks,
and provides for detection of modification and the
prevention of unauthorized reading (cont)........
This can be proven using BAN logic.
The protocol can be specified as follows in security
protocol notation, where Alice is authenticating herself to
Bob using a server S:
A ightarrow S: A,{T_A, K_{AB}, B}_{K_{AS}}
S ightarrow B: {T_S, K_{AB}, A}_{K_{BS}}
Note that to prevent active attacks, some form of
authenticated encryption (or message authentication) must be
used.
The protocol has several problems:
* a global clock is required.
* the server has access to all keys.
* the value of the shared key between A and B is completely
determined by A.
* can replay messages within period when timestamp is valid.
* A is not assured that B exists.
* The protocol is stateful. This is usually undesired
because it requires more functionality and capability from
the server. For example, "S" must be able to deal with
situations in which "B" is unavailable.
------- :)---------
Is This Answer Correct ? | 0 Yes | 0 No |
At what layer of the OSI reference model does FRAME-RELAY map to? A.) Session B.) Physical C.) Network D.) Presentation E.) Transport F.) Datalink
Define topology?
Which protocol called rapid protocol?
PICT & JPEG are examples of what layer in the OSI seven layer model? A.) Transport B.) Presentation C.) Application D.) Datalink E.) Network F.) Session
What is the result of using a hierarchical addressing framework? A. increased availability of addresses B. decreased distance between routers C. increased router memory requirements D. no need to maintain routing information
Identify the command that will display the RIP routes entering and leaving the router? A.) Router(config)# debug ip rip B.) Route# debug ip rip C.) Router>debug ip rip D.) Router# debug rip routes
What are the possible ways of data transmission in ccna?
Which of the following are examples of the Transport Layer? A.) SQL B.) UDP C.) IP D.) LLC E.) ARP
Name the different types of networks
What is the maximum hop count for Link-State protocols? A.) 15 B.) there is no hop count limit C.) 256 D.) 16
Can u convert an ethernet port to a serial port (or) vice versa ?
what is the network address?