Scribd
Upload
50 views8 pages

Unit 3

This document discusses cryptographic protocols including arbitrated and adjudicated protocols. It notes that arbitrated protocols rely on a trusted third party arbiter but have disadvantages like potential lack of a trusted arbiter, costs of maintaining arbitrator availability, and delays from needing arbitration. Adjudicated protocols only involve a third party in disputes and are generally less costly than arbitrated protocols, but can only detect failures after they occur. The document also outlines requirements for hash functions including producing fixed-length outputs and making it computationally infeasible to find collisions or preimages.

Uploaded by

Adesh Kumar chaturvedi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
50 views8 pages

Unit 3

This document discusses cryptographic protocols including arbitrated and adjudicated protocols. It notes that arbitrated protocols rely on a trusted third party arbiter but have disadvantages like potential lack of a trusted arbiter, costs of maintaining arbitrator availability, and delays from needing arbitration. Adjudicated protocols only involve a third party in disputes and are generally less costly than arbitrated protocols, but can only detect failures after they occur. The document also outlines requirements for hash functions including producing fixed-length outputs and making it computationally infeasible to find collisions or preimages.

Uploaded by

Adesh Kumar chaturvedi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 8

Unit 3

Cryptographic Protocols
• Arbitrated Protocols
• In a computer protocol arbiter is a trustworthy third party who
ensures fairness. The arbiter might be a person , a program, or a
machine. For example, in a network an arbiter might be a
program running on one machine of the network. The program
receives and forwards messages between users. The user trust
that when the arbiter forwards a message saying it comes from
A, the message really did come from user A.the notion of an
arbiter is the basis for type of secure protocol called an
arbitrated protocol.
Arbitrated Protocols disadvantages
• The two sides may not be able to find a neutral third party that
both sides trust. Suspicious users are rightfully suspicious of
unknown arbiter in a network.
• Maintaining the availability of an arbiter represents a cost to the
users or the network ; that cost may be high.
• Arbitration causes a time delay in communication because a third
party must receive, act on, and then forward every transaction.
• If the arbitration service is heavily used, it may become a bottleneck
in the network as many users try to access a single arbiter.
• Secrecy becomes weak, because the arbiter has access to much
sensitive information.
• Adjudicated Protocols
Its able to see all sides third party to judge fairness based on
evidences.
Not only can a third party determine whether two parties
acted fairly, that is, within the rules of the protocol, but
third party can also determine who cheated.
Adjudicated protocols involve the services of a third party
only in case of a dispute. Therefore, they are usually less
costly, in terms of machine time or access to a trusted third
party software judge, than arbitrated protocols. However,
adjudicated protocols detect a failure to cooperate only
after the failure has occurred
Hash Function Requirements
A hash function H must have the following properties:
• H can be applied to a block of data of any size
• H produces a fixed-length output
• H(x) is relatively easy to compute for any given x,
making both hardware and software implementations
practical
• For any given code h, it is computationally infeasible
to find x such that h(x)=h
• For any given block x, it is computationally infeasible
to find yx with h(y)=h(x)
• It is computationally infeasible to find any pair (x, y)
such that h(x)=h(y)
Message Authentication Using a One-
Message
Way Hash Function

Message

Message
H

Compare
K
H
K
D
E

Using conventional encryption


Message

Message

Message
H

Compare
Kpublic
H
Kprivate
D

Using public-key encryption (Digital Signature)

You might also like