Pages that link to "Item:Q3058670"
From MaRDI portal
The following pages link to The Round Complexity of Verifiable Secret Sharing: The Statistical Case (Q3058670):
Displaying 4 items.
- Verifiable quantum secret sharing based on a single qudit (Q2024856) (← links)
- Cheating identifiable secret sharing scheme using symmetric bivariate polynomial (Q2195383) (← links)
- Dynamic threshold secret reconstruction and its application to the threshold cryptography (Q2353654) (← links)
- Broadcast (and Round) Efficient Verifiable Secret Sharing (Q2948264) (← links)
