Anonymous Authentication Based on Searchable Encrypted Keyword Schemes
碩士 === 國立中興大學 === 資訊科學與工程學系 === 104 === Protecting private data becomes a major issue in modern society. There are many ways to achieve privacy preserving, including the use of proxy or group signatures. In recent years, some protocols let servers authenticate user’s privellge without knowing user’s...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2016
|
Online Access: | http://ndltd.ncl.edu.tw/handle/21665550668659355826 |
Summary: | 碩士 === 國立中興大學 === 資訊科學與工程學系 === 104 === Protecting private data becomes a major issue in modern society. There are many ways to achieve privacy preserving, including the use of proxy or group signatures.
In recent years, some protocols let servers authenticate user’s privellge without knowing user’s identity, but many of them only offer limited times authentication with a server or do not privide methods for servers to revoke malicious users. In this thesis we utilize searchable encryption and Diffie-Hellman key exchange schemes to achieve anonymous authentication. Our protocol provides unlimited times authentication to free users from the inconvenience of constantly asking TTP for tokens.
|
---|