重置

You may want to consider resetting stones or recasting metal if you want to update your jewelry collection.

您可能要考虑重置金属石块或改写如果您想更新您的珠宝收藏。

For resettable zero-knowledge, we introduced a new registered public-key model: the weakpublic-key model.

对于可重置零知识，我们引入了一个新的注册公钥模型：弱公钥(weak public-keyWPK)模型。

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假设的朴素模型下是不存在的。

In this thesis, we investigate and show how to achieve both practical and general zero-knowledge systems that can be securely run in concurrent and resettable settings with bothconcurrent prover security and concurrent veri?er security in general public-key models.

在本学位论文中，我们研究和显示如何在广义公钥模型下构造实用的及一般的同时具有并发证明者安全和并发验证者安从而可以在并发及可重置环境中安全运行的零知识系统。

Our this work (on resettable zero-knowledge with concur-rent soundness in the WPK model) is a signi?

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

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

In this thesis, we will refer to the BPK model and its variants as general public-key models. Unfortunately, up to now we do not know how to construct concurrent/resettable zero-knowledge with concurrent verifier security i.

在本学位论文中我们将统称秃公钥模型及其变体为广义公钥模型）不幸的是，至今我们不知道如何对非平凡的语言在秃公钥模型下构造具有并发验证者安全（即：并发可靠性及并发证据可提取性）的并发及可重置的零知识系统。

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

Lugalbanda was a god and shepherd king of Uruk where he was worshipped for over a thousand years.

Lugalbanda 是神和被崇拜了一千年多 Uruk古埃及喜克索王朝国王。

I am coming just now,' and went on perfuming himself with Hunut, then he came and sat.

我来只是现在，'歼灭战perfuming自己与胡努特，那麼，他来到和SAT 。