|
|
【答案】应助回帖
★ ★ ★ ★ ★ ★ ★ ★ ★ ★
感谢参与，应助指数 +1
zhuhf: 金币+10, ★★★★★最佳答案 2017-03-23 06:28:28
lazy锦溪: LS-EPI+1 2017-03-23 08:35:17
Accession number:
20171003425790
Title: Two-phase commit with security services: Using distinctive proofs to relieve fragile communications
Authors: Sun, Yang1; Feng, Xueshuai1; Zhu, Hongfeng1 Email author zhuhongfeng1978@163.com
Author affiliation: 1 Software College, Shenyang Normal University, No.253, HuangHe Bei Street, HuangGu District, Shenyang; 110034, China
Corresponding author: Zhu, Hongfeng (zhuhongfeng1978@163.com)
Source title: International Journal of Network Security
Abbreviated source title: Int. J. Netw. Secur.
Volume: 19
Issue: 2
Issue date: 2017
Publication year: 2017
Pages: 217-228
Language: English
ISSN: 1816353X
E-ISSN: 18163548
Document type: Journal article (JA)
Publisher: Femto Technique Co., Ltd.
Abstract: Inspired by stand-alone authentication, which can authenticate users when the connection to the central server is down, we present concepts called local proof and delayed proof that can adapt to two scenes when the authentication server is down: the former can solve self-authenticated to make local applications running without online authentication; the latter can solve two nodes to produce a session key for doing some transactions, but firstly they must exchange the delayed proof to prevent the fraud actions, specially, if the transaction is taking on the important process (such as contract signing or cash transaction), they must wait the authentication server is online. The key idea of our scheme is to improve the efficiency, and anyone can make effective use of the time to negotiate or do some unimportant things during the authentication server is down. Next, we propose a novel Chaotic Maps-based scheme against fragile communications, named CMFC, aiming to bypass the crashed authentication server temporarily for kinds of applications running. For important applications, we adopt the idea of two-phase commit protocol in our scheme: (1) the unavailable authentication server case, in which the CMFC can self-authenticated or compute a provisional delayed proof and a session key for two-party communicating. (2) the available authentication server case, in which, based on the phase (1) and the authentication server's verification, the two-party decides whether to commit (only if all have voted "Yes" or abort the transaction (otherwise). Finally, we give the formal security proof about our scheme with BAN logic and efficiency analysis.
Number of references: 15
Main heading: Authentication
Controlled terms: Chaotic systems - Computer circuits - Efficiency - Lyapunov methods
Uncontrolled terms: Authentication servers - BAN logic - Chaotic map - Delayed proof - Efficiency analysis - Online authentication - Security services - Two phase commit protocols
Classification code: 721.3Computer Circuits - 723Computer Software, Data Handling and Applications - 913.1Production Engineering - 961Systems Science
DOI: 10.6633/IJNS.201703.19(2).06
Database: Compendex
Compilation and indexing terms, © 2017 Elsevier Inc.
Full-text and Local Holdings Links |
|
回复此楼