Although most of the existing encryption system takes the privacy issues of storing data into consider, the reveal of user access pattern is inevitable during the e-mail filtering. Therefore, how to protect the private data in the process of spam filtering becomes one of the urgent problems to be solved. Combined with two filtering techniques which are based on keyword and blacklist respectively, this paper achieves the goal of sorting and filtering spams. Meanwhile, given the privacy issues in sorting and filtering the spams, the paper is based on an experimental project, the Pairing Based Cryptography, which is performed by Stanford University to achieve the e-mail encryption program. It adopts a searchable public key encryption in the process of sorting and filtering, which needs no decryption and can realize searching and matching operations. By this method, it fully protects the privacy and access patterns of the mail receiver from disclosing.
[1]
Joonsang Baek,et al.
Public Key Encryption with Keyword Search Revisited
,
2008,
ICCSA.
[2]
Rafail Ostrovsky,et al.
Public Key Encryption with Keyword Search
,
2004,
EUROCRYPT.
[3]
Lei Feng-yu.
Improved Prototype Scheme of PETKS and its Expansion
,
2009
.
[4]
Matthew K. Franklin,et al.
Identity-Based Encryption from the Weil Pairing
,
2001,
CRYPTO.
[5]
Wang Xiaoming.
Public Key Encryption Schemes Search with Keyword
,
2010
.
[6]
LI Hong-wei.
Research on Bilinear Diffie-Hellman Problem
,
2006
.
[7]
Shouhuai Xu,et al.
Key-Insulated Public Key Cryptosystems
,
2002,
EUROCRYPT.