Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/129077
DC FieldValue
dc.titleEfficient non-repudiation protocol
dc.contributor.authorZhou, Jianying
dc.contributor.authorGollmann, Dieter
dc.date.accessioned2016-10-26T11:01:44Z
dc.date.available2016-10-26T11:01:44Z
dc.date.issued1997
dc.identifier.citationZhou, Jianying,Gollmann, Dieter (1997). Efficient non-repudiation protocol. Proceedings of the Computer Security Foundations Workshop : 126-132. ScholarBank@NUS Repository.
dc.identifier.issn10636900
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/129077
dc.description.abstractFairness may be a desirable property of a non-repudiation service. Protocols can achieve fairness through the involvement of a trusted third party but the extent of the trusted third party's involvement can vary between protocols. Hence, one of the goals of designing an efficient non-repudiation protocol is to reduce the work load of the trusted third party. In this paper we present a variant of our fair non-repudiation protocol, where the trusted third party will be involved only in case that one party cannot obtain the expected non-repudiation evidence from the other party. This variant is efficient in an environment where the two parties are likely to resolve communications problems between themselves.
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentINFORMATION SYSTEMS & COMPUTER SCIENCE
dc.description.sourcetitleProceedings of the Computer Security Foundations Workshop
dc.description.page126-132
dc.description.codenPCSWE
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.