


default search action
"The Round Complexity of Verifiable Secret Sharing: The Statistical Case."
Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan (2010)
- Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan:
The Round Complexity of Verifiable Secret Sharing: The Statistical Case. ASIACRYPT 2010: 431-447

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.