10. The Prover randomly generates it during the issuance protocol, together with a corresponding private key for the U-Prove token.
验证方会在发布协议中随机生成公钥，此时会使用针对U -Prove令牌的相关私钥。
来自互联网
11. When the Prover wants a token, he contacts the Issuer through the Issuance Protocol presenting his attributes in a cryptic form.
当验证方想要得到令牌的时候，它会通过发布协议与发布方联系，以一种秘密的形式来展现他的属性。
来自互联网
12. Although less automatic, efficient usage of a theorem prover can handle much larger designs than model checkers and requires less memory.
尽管缺少自动化，高效地使用定理证明器能处理比模型检查器更大的设计并且要求更小的内存。
来自互联网
13. The Issuer may use various means to authenticate the Prover including accessing information contained in U-Prove tokens generated by other Issuers.
14. Sometimes the abstraction itself may be so large that the theorem prover may take an inordinate amount of time and resources to complete the proof.
有时抽象本身可能是很大的工作量，以致定理证明程序可能花费过多时间和资源来完成证明。
来自互联网
15. In contrast to the token's public key, this private key is not part of the U-Prove token; the Prover never discloses it when using the U-Prove token.
16. After obtaining a token, the Prover will use it in relation with a Verifier to establish a trusted relationship between the two via the Presentation protocol.
在获得了令牌之后，验证方会与校验放取得联系并通过表现协议在二者之间确立可信任的关系。
来自互联网
17. Effective use of a theorem prover requires a solid understanding of the internal operations of the tool and a familiarity with the mathematical proof process.
高效地使用定理证明需要对工具的内部操作有坚实的理解并且熟悉数学证明过程。
来自互联网
18. Therefore once the security requirement in single prover condition is satisfied the identity authentication protocol can also be run in multi-provers condition.
因此，只要满足了其中单证明者环境下的安全要求，身份认证协议也能安全地运行在多个证明者的环境下。
来自互联网
19. We refer to the Prover-computed response as the presentation proof; it is a cryptographic proof of possession of the private key corresponding to the presented U-Prove token.
20. Or else, the abstraction may throw away so much information that the theorem prover may yield results that are correct for the abstraction, but incorrect for the program being analysed.
21. This paper presents a technique for designing theorem prover which mainly based on transformation and substitution for Pointer Logic. The technique realized as a tool called APL is implemented.
22. This paper presents a technique for designing theorem prover which mainly based on transformation and substitution for Pointer Logic. The technique realized as a tool called APL is implemented.
