A verifiable secret shuffle and its application to e-voting
CA Neff - Proceedings of the 8th ACM conference on Computer …, 2001 - dl.acm.org
We present a mathematical construct which provides a cryptographic protocol to verifiably
shuffle a sequence of k modular integers, and discuss its application to secure, universally …
shuffle a sequence of k modular integers, and discuss its application to secure, universally …
[PDF][PDF] A Verifiable Secret Shuffle and its Application to E-Voting
CA Neff - 2001 - theory.csail.mit.edu
We present a mathematical construct which provides a cryptographic protocol to verifiably
shuffle a sequence of k modular integers, and discuss its application to secure, universally …
shuffle a sequence of k modular integers, and discuss its application to secure, universally …
[PDF][PDF] A Verifiable Secret Shuffle and its Application to E-Voting
CA Neff - 2001 - bib.mixnetworks.org
We present a mathematical construct which provides a cryptographic protocol to verifiably
shuffle a sequence of k modular integers, and discuss its application to secure, universally …
shuffle a sequence of k modular integers, and discuss its application to secure, universally …
[PDF][PDF] A Verifiable Secret Shuffle and its Application to E-Voting
CA Neff - 2001 - freehaven.net
We present a mathematical construct which provides a cryptographic protocol to verifiably
shuffle a sequence of k modular integers, and discuss its application to secure, universally …
shuffle a sequence of k modular integers, and discuss its application to secure, universally …
[PDF][PDF] A Verifiable Secret Shuffle and its Application to E-Voting
CA Neff - 2001 - scholar.archive.org
We present a mathematical construct which provides a cryptographic protocol to verifiably
shuffle a sequence of k modular integers, and discuss its application to secure, universally …
shuffle a sequence of k modular integers, and discuss its application to secure, universally …
[PDF][PDF] A Verifiable Secret Shuffle and its Application to E-Voting
CA Neff - 2001 - cs.ucdavis.edu
We present a mathematical construct which provides a cryptographic protocol to verifiably
shuffle a sequence of k modular integers, and discuss its application to secure, universally …
shuffle a sequence of k modular integers, and discuss its application to secure, universally …
[引用][C] A verifiable secret shuffle and its application to e-voting
CA NEFF - Proc. 8th ACM Conference on Computer and …, 2001 - cir.nii.ac.jp
A verifiable secret shuffle and its application to e-voting | CiNii Research CiNii 国立情報学
研究所 学術情報ナビゲータ[サイニィ] 詳細へ移動 検索フォームへ移動 論文・データをさがす 大学 …
研究所 学術情報ナビゲータ[サイニィ] 詳細へ移動 検索フォームへ移動 論文・データをさがす 大学 …
[PDF][PDF] A Verifiable Secret Shuffle and its Application to E-Voting
CA Neff - 2001 - cs.ucdavis.edu
We present a mathematical construct which provides a cryptographic protocol to verifiably
shuffle a sequence of k modular integers, and discuss its application to secure, universally …
shuffle a sequence of k modular integers, and discuss its application to secure, universally …
[PDF][PDF] A Verifiable Secret Shuffle and its Application to E-Voting
CA Neff - 2001 - Citeseer
We present a mathematical construct which provides a cryptographic protocol to verifiably
shuffle a sequence of k modular integers, and discuss its application to secure, universally …
shuffle a sequence of k modular integers, and discuss its application to secure, universally …
[PDF][PDF] A Verifiable Secret Shuffle and its Application to E-Voting
CA Neff - 2001 - people.csail.mit.edu
We present a mathematical construct which provides a cryptographic protocol to verifiably
shuffle a sequence of k modular integers, and discuss its application to secure, universally …
shuffle a sequence of k modular integers, and discuss its application to secure, universally …