The round complexity of verifiable secret sharing: The statistical case

R Kumaresan, A Patra, CP Rangan - … on the Theory and Application of …, 2010 - Springer
We consider the round complexity of a basic cryptographic task: verifiable secret sharing
(VSS). This well-studied primitive provides a good “test case” for our understanding of round …
被引用次数：55 相关文章
[PDF] mit.edu

[PDF][PDF] The Round Complexity of Verifiable Secret Sharing: The Statistical Case

R Kumaresan, A Patra, CP Rangan - people.csail.mit.edu
We consider the round complexity of a basic cryptographic task: verifiable secret sharing
(VSS). This well-studied primitive provides a good “test case” for our understanding of round …

[引用][C] The Round Complexity of Verifiable Secret Sharing: The Statistical Case

R Kumaresan, A Patra, CP Rangan - Advances in Cryptology …, 2010 - cir.nii.ac.jp
The Round Complexity of Verifiable Secret Sharing: The Statistical Case | CiNii Research
CiNii 国立情報学研究所 学術情報ナビゲータ[サイニィ] 詳細へ移動 検索フォームへ移動 論文・データを …

The Round Complexity of Verifiable Secret Sharing: The Statistical Case

R Kumaresan, A Patra, CP Rangan - Advances in Cryptology-ASIACRYPT 2010 - infona.pl
We consider the round complexity of a basic cryptographic task: verifiable secret sharing
(VSS). This well-studied primitive provides a good “test case” for our understanding of round …
[PDF] iacr.org

[PDF][PDF] The Round Complexity of Verifiable Secret Sharing: The Statistical Case

R Kumaresan, A Patra, CP Rangan - iacr.org
We consider the round complexity of a basic cryptographic task: verifiable secret sharing
(VSS). This well-studied primitive provides a good “test case” for our understanding of round …

The Round Complexity of Verifiable Secret Sharing: The Statistical Case

R Kumaresan, A Patra, CP Rangan - Advances in Cryptology …, 2010 - books.google.com
We consider the round complexity of a basic cryptographic task: verifiable secret sharing
(VSS). This well-studied primitive provides a good “test case” for our understanding of round …
[PDF] academia.edu

[PDF][PDF] The Round Complexity of Verifiable Secret Sharing: The Statistical Case

R Kumaresan, A Patra, CP Rangan - academia.edu
We consider the round complexity of a basic cryptographic task: verifiable secret sharing
(VSS). This well-studied primitive provides a good “test case” for our understanding of round …
[PDF] psu.edu

[PDF][PDF] The Round Complexity of Verifiable Secret Sharing: The Statistical Case

R Kumaresan, A Patra, CP Rangan - Citeseer
We consider the round complexity of a basic cryptographic task: verifiable secret sharing
(VSS). This well-studied primitive provides a good “test case” for our understanding of round …
[PDF] umd.edu

[PDF][PDF] The Round Complexity of Verifiable Secret Sharing: The Statistical Case

R Kumaresan - cgis.cs.umd.edu
We consider the round complexity of a basic cryptographic task: verifiable secret sharing
(VSS). This well-studied primitive provides a good “test case” for our understanding of round …

The Round Complexity of Verifiable Secret Sharing: The Statistical Case

R Kumaresan, A Patra, CP Rangan - ASIACRYPT 2010 - Springer
We consider the round complexity of a basic cryptographic task: verifiable secret sharing
(VSS). This well-studied primitive provides a good “test case” for our understanding of round …