Levels of authentication in distributed agreement
Author(s) -
Malte Borcherding
Publication year - 1996
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
ISBN - 3-540-61769-8
DOI - 10.1007/3-540-61769-8_4
Subject(s) - computer science , authentication (law) , key (lock) , distributed computing , agreement , public key cryptography , message authentication code , fault tolerance , byzantine fault tolerance , key distribution , server , computer security , computer network , theoretical computer science , cryptography , encryption , philosophy , linguistics
Reaching agreement in the presence of Byzantine (arbitrary) faults is a fundamental problem in distributed systems. It has been shown that message authentication is a useful tool in designing protocols with high fault tolerance, but it imposes the additional problem of key distribution.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom