首页 | 本学科首页   官方微博 | 高级检索  
     

公平的多方不可否认协议
引用本文:何冰,李肖坚,夏春和,夏克俭.公平的多方不可否认协议[J].计算机工程与应用,2005,41(27):120-122,156.
作者姓名:何冰  李肖坚  夏春和  夏克俭
作者单位:北京科技大学信息工程学院,北京,100083;北京航空航天大学计算机学院,北京,100083
基金项目:航空基金(编号:03F51060)
摘    要:电子商务中保证信息交换的不可否认性是一项必不可少的安全服务,而多方不可否认协议则是当前的研究重点之一。论文通过分析当前已发表的多方协议或方案,指出当前多方不可否认协议存在由于发送方占优势导致的不公平问题,并提出了基于双重组加密方法的多方不可否认协议,进一步削弱了发送方的优势。最后用SVO逻辑的形式化分析方法证明了协议的正确性。

关 键 词:公平性  多方不可否认协议  形式化分析
文章编号:1002-8331-(2005)27-0120-03
收稿时间:2005-03
修稿时间:2005-03

A Fair Multi-Party Non-repudiation Protocol
He Bing,Li Xiaojian,Xia Chunhe,Xia Kejian.A Fair Multi-Party Non-repudiation Protocol[J].Computer Engineering and Applications,2005,41(27):120-122,156.
Authors:He Bing  Li Xiaojian  Xia Chunhe  Xia Kejian
Affiliation:1. Institute of Information Engineering,Beijing University of Science and Technology,Beijing 100083;2. College of Computer, Beihang University. Beiiing 100083
Abstract:Non-repudiation service is crucial to electronic commerce.Now multi-party non-repudiation is a new focus of research,This paper discusses the state-of-the-art of the multi-party non-repudiation protocols,analyzes those papers, and shows the common problem that the originator is positioned in an advantageous way,This paper addresses a more fair multi-party non-repudiation protocol based on a double group encryption scheme,then uses formal method of SVO logic to analyze the new protocol and proves its correctness,
Keywords:fairness  multi-party non-repudiation protocol  formal analysis
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号