查询词典 concurrent

A case is made that areas of chronic demyelination arise because of concurrent loss of oligodendrocyte progenitor cells and oligodendrocytes and that because of the slow rate of repopulation that occurs in old individuals the recruited OPCs are not exposed to the acute inflammatory environment required to generate remyelinating oligodendrocytes.

一种说法是慢性脱髓鞘的区域产生系因少突胶质原始细胞和少突胶质细胞并存，而且因老年个体中缓慢的再生率，补充的OPCs没有暴露于产生髓鞘再生少突胶质细胞需要的急性炎症的环境。

Extensive recent research efforts have established that constant-round concurrent/resettable zero-knowledge for non-trivial languages cannot be achieved in the plain model without setup assumptions.

大量和深入的最新研究已经证明对于非平凡的语言常数轮的并发及可重置的零知识系统在没有Setup假设的朴素模型下是不存在的。

With the far and wide sweeping popularity of the Internet and smart-card based E-commerce over Internet, much recent research attention has been paid on the security threats of zero-knowledge protocols when they are executing in concurrent and resettable settings.

伴随着Internet以及Internet上基于智能卡的电子商务的广泛普及和大规模应用，零知识证明系统在并发及可重置环境中运行时所遇到的安全问题最近得到了高度重视和深入的研究。

Furthermore, since it is a well-known open problem whether constant-round resettable zero-knowledge systems with concurrent soundness for NP exist in the generous BPK model or not, our this work makes a significant step for finally solving this important open problem.

更为重要的是，由于对所有NP-语言常数轮且并发可靠的可重置零知识系统是否在秃公钥模型中存在是一个著名的公开问题，我们此方面的工作对于解决此一重要公开问题亦迈出了重要一步。

Extensive recent research efforts have established that constant-round concurrent/resettable zero-knowledge for non-trivial languages cannot be achieved in the plain model without setup assumptions.

我们在WPK模型下关于具有并发可靠性的可重置零知识方面的工作是对Micali和 Reyzin在UPK模型下并发可靠的可重置零知识工作(EUROCRYPT01)的一个极其重要的改进和扩充。

To achieve constant-round concurrent/resettable zero-knowledge, several famous computational models have been introduced, among which the bare public-key model is the weakest and also the most appealing one.

更为重要的是，由于对所有NP-语言常数轮且并发可靠的可重置零知识系统是否在秃公钥模型中存在是一个著名的公开问题，我们此方面的工作对于解决此一重要公开问题亦迈出了重要一步。

With the far and widesweeping popularity of the Internet and smart-card based E-commerce over Internet, muchrecent research attention has been paid on the security threats of zero-knowledge protocolswhen they are executing in concurrent and resettable settings.

伴随着Internet以及Internet上基于智能卡的电子商务的广泛普及和大规模应用，零知识证明系统在并发及可重置环境中运行时所遇到的安全问题最近得到了高度重视和深入的研究。

To achieve constant-round concurrent/resettable zero-knowledge, several famous computational models have been introduced, among which the bare public-key model is the weakest and also the most appealing one.

为了得到常数轮的并发及可重置的零知识系统一些著名的计算模型已经提出来，其中最弱同时最令人关注的是秃公钥(Bare Public-Key)模型。

We then show how to achieve min-round (3-round) resettable zero-knowledge arguments for NP with concurrent soundness in the WPK model.

接下来，我们显示如何在弱公钥模型下对所有NP-语言实现最少轮（3-round）同时具有并发可靠性的可重置零知识辩论系统。

To achieve constant-round concurrent/resettable zero-knowledge, several fa-mous computational models have been introduced, among which the bare public-keymodel is the weakest and also the most appealing one.

为了得到常数轮的并发及可重置的零知识系统一些著名的计算模型已经提出来，其中最弱同时最令人关注的是秃公钥(Bare Public-Key)模型。

Now he worked in ajoint venture.

现在他在一家合资企业工作。

More troops in Afghanistan won't change any of the foregoing.

更多的在阿富汗的军队也不会改变之前的状况。