Skip to content

The Round Complexity of Verifiable Secret Sharing: The Statistical Case.

Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan

Year2010
ProceedingsASIACRYPT

Browse the full ASIACRYPT paper archive.