The Interrogator: Protocol Secuity Analysis
IEEE Transactions on Software Engineering - Special issue on computer security and privacy
ACM SIGOPS Operating Systems Review
Efficient and timely mutual authentication
ACM SIGOPS Operating Systems Review
SOSP '89 Proceedings of the twelfth ACM symposium on Operating systems principles
A semantics for a logic of authentication (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
A security risk of depending on synchronized clocks
ACM SIGOPS Operating Systems Review
A nonce-based protocol for multiple authentications
ACM SIGOPS Operating Systems Review
A note on the use of timestamps as nonces
ACM SIGOPS Operating Systems Review
Lower bounds on messages and rounds for network authentication protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Using encryption for authentication in large networks of computers
Communications of the ACM
Systematic Design of Two-Party Authentication Protocols
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
On Inter-RealmAuthentication in Large Distributed Systems
SP '92 Proceedings of the 1992 IEEE Symposium on Security and Privacy
On Message Integrity in Cryptographic Protocols
SP '92 Proceedings of the 1992 IEEE Symposium on Security and Privacy
Trust Relationships in Secure Systems-A Distributed Authentication Perspective
SP '93 Proceedings of the 1993 IEEE Symposium on Security and Privacy
Lower bounds on messages and rounds for network authentication protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Efficient network authentication protocols: lower bounds and optimal implementations
Distributed Computing
| Hi-index | 0.00 |
Protocols which include key-distribution and data exchange phases in an asynchronous, shared key, multidomain environment are examined. A model of a distributed system is presented and the goals of the multidomain protocols are formulated. The minimal number of messages for two variants of such protocols is proved. Two multi-domain protocols which contain the minimal number of messages are presented. The results are compared with previously published work.