Key-Policy Attribute-Based Encryption (KP-ABE) is a promising cryptographic primitive which enabl... more Key-Policy Attribute-Based Encryption (KP-ABE) is a promising cryptographic primitive which enables fine-grained access control over sensitive data. However, key abuse attacks in KP-ABE may impede its wide application especially in copyright-sensitive systems. To defend against this kind of attacks, this paper proposes a novel KP-ABE scheme which is able to disclose any illegal key distributor's ID when key abuse is detected. In our scheme, each bit of user ID is defined as an attribute and the user secret key is associated with his unique ID. The tracing algorithm fulfills its task by tricking the pirate device into decrypting the ciphertext associated with the corresponding bits of his ID. Our proposed scheme has the salient property of black box tracing, i.e., it traces back to the illegal key distributor's ID only by observing the pirate device's outputs on certain inputs. In addition, it does not require the pirate device's secret keys to be well-formed as compared to some previous work. Our proposed scheme is provably secure under the Decisional Bilinear Diffie-Hellman (DBDH) assumption and the Decisional Linear (DL) assumption.
The processes $\etacpto \rho^{0}\rho^{0}$, $K^{*0}\bar{K}^{*0}$, and $\phi\phi$ are searched for ... more The processes $\etacpto \rho^{0}\rho^{0}$, $K^{*0}\bar{K}^{*0}$, and $\phi\phi$ are searched for using a sample of $1.06 \times 10^8$ $\psip$ events collected with the BESIII detector at the BEPCII collider. No signals are observed in any of the three final states. The upper limits on the decay branching fractions are determined to be $\mathcal{B}(\etacpto\rho^{0}\rho^{0})<3.1\times10^{-3}$, $\mathcal{B}(\etacpto K^{*0}\bar{K}^{*0})<5.4 \times10^{-3}$, and $\mathcal{B}(\etacpto\phi\phi)<2.0\times10^{-3}$ at the 90% confidence level. The upper limits are lower than the existing theoretical predictions.
Key-Policy Attribute-Based Encryption (KP-ABE) is a promising cryptographic primitive which enabl... more Key-Policy Attribute-Based Encryption (KP-ABE) is a promising cryptographic primitive which enables fine-grained access control over sensitive data. However, key abuse attacks in KP-ABE may impede its wide application especially in copyright-sensitive systems. To defend against this kind of attacks, this paper proposes a novel KP-ABE scheme which is able to disclose any illegal key distributor's ID when key abuse is detected. In our scheme, each bit of user ID is defined as an attribute and the user secret key is associated with his unique ID. The tracing algorithm fulfills its task by tricking the pirate device into decrypting the ciphertext associated with the corresponding bits of his ID. Our proposed scheme has the salient property of black box tracing, i.e., it traces back to the illegal key distributor's ID only by observing the pirate device's outputs on certain inputs. In addition, it does not require the pirate device's secret keys to be well-formed as compared to some previous work. Our proposed scheme is provably secure under the Decisional Bilinear Diffie-Hellman (DBDH) assumption and the Decisional Linear (DL) assumption.
The processes $\etacpto \rho^{0}\rho^{0}$, $K^{*0}\bar{K}^{*0}$, and $\phi\phi$ are searched for ... more The processes $\etacpto \rho^{0}\rho^{0}$, $K^{*0}\bar{K}^{*0}$, and $\phi\phi$ are searched for using a sample of $1.06 \times 10^8$ $\psip$ events collected with the BESIII detector at the BEPCII collider. No signals are observed in any of the three final states. The upper limits on the decay branching fractions are determined to be $\mathcal{B}(\etacpto\rho^{0}\rho^{0})<3.1\times10^{-3}$, $\mathcal{B}(\etacpto K^{*0}\bar{K}^{*0})<5.4 \times10^{-3}$, and $\mathcal{B}(\etacpto\phi\phi)<2.0\times10^{-3}$ at the 90% confidence level. The upper limits are lower than the existing theoretical predictions.
Uploads
Papers by Louis Li