Wikström混合网的一个推广和优化变体的描述和证明
A Description and Proof of a Generalised and Optimised Variant of Wikström's Mixnet
摘要:
在本文中,我们描述了Wikström的mixnet的一个优化的变体,它并行地对ElGamal密文的向量进行洗牌。然后,我们详细说明了这种结构是安全的。我们在这里提到的Wikström的可验证混合网最早是在Terelius和Wikström的“Proofs of Restricted Shuffles”中提出的,建立在Wikström以前的工作之上。具体来说,我们采用ElGamal的优化变体,它似乎是常用的;例如,它在Haenni等人的“用于可验证重新加密混合网络的伪代码算法”中提出。我们扩展了mixnet以支持并行洗牌。(The Wikström的结果证明了这样做的可能性,但我们希望证明这个特定的实例及其优化是安全的。
英文摘要:
In this paper, we describe an optimised variant of Wikström's mixnet which shuffles vectors of ElGamal ciphertexts in parallel. We then show in detail that this construction is secure. Wikström's verifiable mixnet as we refer to it here was first presented in "Proofs of Restricted Shuffles" by Terelius and Wikström, building on Wikström's previous work. Specifically we take the optimised variant for ElGamal which appears to be in common use; for instance, it is presented in Haenni et al's "Pseudo-Code Algorithms for Verifiable Re-Encryption Mix-Nets". We extend the mixnet to support parallel shuffles. (The possibility of doing this is proven by the Wikström's result but we wish to show that this particular instance with its optimisations is secure.)
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。