查询词典 concurrent access

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)模型。

A new data management algorithm for anycast based random sampling in sensor networks;2. Composite random sampling algorithm for scheduling concurrent projects;3. In the existing methods of random summing of total resource,the shape of the total resource curve sometimes distributes skewly,in view of which,the new method was put forward to improve random sampling .

针对现有的资源总量随机求和中存在的资源总量曲线形态有时呈偏态分布的问题，提出了对其随机抽样方法的改进方案，即把随机抽样入口由原来定义在(0，1)区间上改为定义在(0，ki)区间上(ki为第i个局部地质单元的石油资源量保险系数)，利用(0，ki)区间上均匀分布的随机数对风险分析后的资源总量分布函数进行随机抽样。

There had been a moment during the breakfast meeting, though, after the backslapping and the small talk and when all of us were seated, with Vice President Cheney eating his eggs Benedict impassively and Karl Rove at the far end of the table discreetly checking his BlackBerry, that I witnessed a different side of the man.

那次早餐会期间，在表示过关心和寒暄以后，我们所有人坐了下来，我注意观察了一下，副总统切尼面无表情地吃着班尼迪克蛋（Eggs benedict，源自美国，以英式松饼、火腿、水煮蛋以及荷兰酱组合而成），卡尔。罗夫在餐桌的远端谨慎地经常查看他的黑莓手机，我目睹了他所不为人知的一面。

Talk Undelete failed; someone else may have undeleted the page first.

Talk 无法删除选定的页面或图像（它可能已经被其他人删除了）。