我们证明该方案在随机预言机模型中是可证安全的。
Then we prove that our scheme satisfies these security notions in the random oracle model.
最后，在随机预言机模型下给出了协议的安全性分析。
On the other hand, the solution retains the tree structure. At the last, we give a security analysis based on the random oracle security model.
作为短签名时，签名是一次性的，该方案的安全性证明不需要随机预言机模型。
The security of the scheme is based on the difficulty of integers factorization without the random oracle model.
采用随机预言机模型，分析了新方案的安全性，结果表明，新方案满足不可伪造性和部分盲性。
The security of the new scheme was analyzed with the random oracle model. The results show that the new scheme satisfies the unforgeability and the partial blindness.
采用随机预言机模型，分析了新方案的安全性，结果表明，新方案满足不可伪造性和部分盲性。
The security of the new scheme was analyzed with the random oracle model. The results show that the new scheme satisfies the unforgeability and the partial blindness.
应用推荐