|
|
【答案】应助回帖
★ ★ ★ ★ ★ ★ ★ ★ ★ ★
感谢参与，应助指数 +1
zhuhf: 金币+10, ★★★★★最佳答案, 非常感谢！ 2016-11-22 21:13:32
lazy锦溪: LS-EPI+1 2016-11-22 21:31:08
Accession number:
20164302946278
Title: Provably secure multi-server privacy-protection system based on chebyshev chaotic maps without using symmetric cryptography
Authors: Zhu, Hongfeng1 Email author zhuhongfeng1978@163.com; Zhang, Yifeng1; Sun, Yang1
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: 18
Issue: 5
Issue date: 2016
Publication year: 2016
Pages: 803-815
Language: English
ISSN: 1816353X
E-ISSN: 18163548
Document type: Journal article (JA)
Publisher: Femto Technique Co., Ltd.
Abstract: Most of the privacy-protection schemes adopting chaotic maps are usually by symmetric cryptography for guaranteeing identity hiding. This will lead to a high calculated amount. So, the paper will wipe out the symmetric cryptography, and only use chaotic maps, a secure one-way hash function to construct a provable privacy-protection system (PPS) which can achieve two kinds of privacy- protection and switch between them optionally by users: The first is anonymous scheme which can make nobody know the user's identity, including the server and the registration center (RC), and they only know these users are legal or paying members. The other is hiding scheme which owns also privacy-protection property, because the user's identity is not transferred during the process of the proposed protocol, and only the server and the RC know the user's identity. About practical environment, we adopt multi-server architecture which can allow the user to register at the RC once and can access all the permitted services provided by the eligible servers. Then a new PPS authenticated key agreement protocol is given based on chaotic maps. Security of the scheme is based on chaotic maps hard problems and a secure one way hash function. Compared with the related literatures recently, our proposed scheme can not only own high efficiency and unique functionality, but is also robust to various attacks and achieves perfect forward secrecy. Finally, we give the security proof and the efficiency analysis of our proposed scheme.
Number of references: 27
Main heading: Lyapunov methods
Controlled terms: Access control - Chaotic systems - Cryptography - Efficiency - Hash functions - Public key cryptography
Uncontrolled terms: Authenticated key agreement protocols - Chaotic map - Key agreement - Multi-server architecture - One way hash functions - Perfect forward secrecy - Privacy protection - Symmetric cryptography
Classification code: 723Computer Software, Data Handling and Applications - 913.1Production Engineering - 961Systems Science
Database: Compendex
Compilation and indexing terms, © 2016 Elsevier Inc.
Full-text and Local Holdings Links |
|
回复此楼