Provably Secure Multi-Server Privacy-Protection System Based on Chebyshev Chaotic Maps without Using Symmetric Cryptography

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.

Resource Details

Provided by:
International Journal of Network Security