Name
Abstract | ||
|---|---|---|
Anonymous receiver encryption is an important cryptographic primitive. It can protect the privacy of the receiver. In 2010, Fan \emph{et al} proposed an anonymous multi-receiver ID-based encryption by using Lagrange interpolating polynomial. However, Wang \emph{et al} showed that Fan \emph{et al}'s scheme didn't satisfy the anonymity of the receivers. Then they provided an improved scheme to fix it and showed that the improved scheme was secure. Unfortunately, in this paper, we pointed out that Wang \emph{et al}'s improved scheme did not satisfy the receiver's anonymity by analyzing the security of the scheme yet. After analyzing the reason to produce such flaws, we gave an improved method to repair it and showed that our improved scheme could satisfy the receiver's anonymity. And the improved scheme has the advantage over Wang \emph{et al}'s scheme in terms of computational cost. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/iNCoS.2012.117 | INCoS |
Keywords | Field | DocType |
anonymous multi-receiver id-based encryption,improved scheme,lagrange interpolating polynomial,anonymous receiver encryption,computational cost,anonymous multi-receiver identity-based encryption,improved method,anonymity,encryption,probabilistic logic,polynomials,cryptography,attack | Multiple encryption,Discrete mathematics,Cryptography,Computer science,Computer network,Encryption,Cryptographic primitive,Theoretical computer science,Probabilistic encryption,40-bit encryption,Link encryption,56-bit encryption | Conference |
Citations | PageRank | References |
10 | 0.50 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jianhong Zhang | 1 | 30 | 3.91 |
| Yuwei Xu | 2 | 12 | 1.22 |