Multi-party Non-repudiation Protocol with Different Message Exchanged

Author

Yanping, Li ; Liaojun, Pang

Author_Institution

Coll. of Math. & Inf. Sci., Shaanxi Normal Univ., Xi´´an, China

Volume

1

fYear

2009

fDate

18-20 Aug. 2009

Firstpage

491

Lastpage

494

Abstract

Based on the hardness assumption of discrete logarithm problem and a group oriented encryption scheme, a new multi-party non-repudiation protocol is presented. The features of this protocol are the following: In the B2C or B2B e-commerce application,it is necessary for an organisations/people to deal with all kinds of requests, business documents, agreements, payments, contracts, acknowledgments as a batch.The protocol allows such organisations/people to send different messages to multiple different recipients, eliminates the previous restriction on the exchange of the same message. The protocol also utilizes an off-line third trusted party (TTP for short) and has higher efficiency than those protocols with an on-line TTP.

Keywords

cryptographic protocols; electronic commerce; message passing; B2B e-commerce; B2C e-commerce; discrete logarithm problem; group oriented encryption scheme; multiparty nonrepudiation protocol; offline third trusted party; Communication channels; Contracts; Cryptography; Data security; Information science; Information security; Intserv networks; Laboratories; Mathematics; Protocols; Multicast; Non-repudiation; Resilient channel;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Assurance and Security, 2009. IAS '09. Fifth International Conference on

Conference_Location

Xian

Print_ISBN

978-0-7695-3744-3

Type

conf

DOI

10.1109/IAS.2009.329

Filename

5284254