Cryptology ePrint Archive: Report 2008/172
Available versions in chronological order
20080421:093346 (posted 21-Apr-2008 09:33:46 UTC)
Efficient Protocol for Generating IC Signature and its Application to Unconditional Verifiable Secret Sharing
Ashish Choudhary and Arpita Patra and AshwinKumar B.V and C. Pandu Rangan
20080603:160518 (posted 03-Jun-2008 16:05:18 UTC)
On Round Complexity of Unconditionally Secure VSS
Arpita Patra and Ashish Choudhary and Ashwinkumar B.V and C. Pandu Rangan
20080721:043529 (posted 21-Jul-2008 04:35:29 UTC)
On Round Complexity of Unconditionally Secure VSS
Arpita Patra and Ashish Choudhary and Ashwinkumar B.V and C. Pandu Rangan
20090605:054053 (posted 05-Jun-2009 05:40:53 UTC)
The Round Complexity of Verifiable Secret Sharing Revisited
Arpita Patra and Ashish Choudhary and Tal Rabin and C. Pandu Rangan
Publication Info: This is a full version of thepaper that is accepted in CRYPTO 2009
[
Cryptology ePrint archive
]