Authentication using minimally trusted servers

Authors:
Liqun Chen;Dieter Gollmann;Chris J. Mitchell
Affiliations:
Information Security Group, Royal HoUoway, University of London, Egham, Surrey TW20 0EX, England;Information Security Group, Royal HoUoway, University of London, Egham, Surrey TW20 0EX, England;Information Security Group, Royal HoUoway, University of London, Egham, Surrey TW20 0EX, England
Venue:
ACM SIGOPS Operating Systems Review
Year:
1997

Citing 3
Cited 1

Authentication codes with multiple arbiters

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Refinement and extension of encrypted key exchange

ACM SIGOPS Operating Systems Review
A Proposed Architecture for Trusted Third Party Services

Proceedings of the International Conference on Cryptography: Policy and Algorithms

A consistent history authentication protocol

ACM SIGSOFT Software Engineering Notes

Quantified Score

Hi-index	0.00

Visualization

Abstract

A number of key distribution protocols using multiple authentication servers, where a minority of them may be untrustworthy, have recently been proposed. This paper analyses the problem of key distribution using minimally trusted multiple servers, and presents a new protocol. In this protocol, as long as all servers do not collude to defraud the clients, either a session key (not known to any server) is successfully established, or the protocol fails in such a way that the clients are aware that it has failed, i.e. the protocol works in a situation where the servers are 'minimally trusted'.