Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The Round Complexity of Verifiable Secret Sharing Revisited."

Arpita Patra et al. (2009)

> Home

Details and statistics

DOI: 10.1007/978-3-642-03356-8_29

access: open

type: Conference or Workshop Paper

metadata version: 2022-10-02

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/crypto/PatraCRR09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/crypto/PatraCRR09
Arpita Patra, Ashish Choudhary, Tal Rabin, C. Pandu Rangan:
The Round Complexity of Verifiable Secret Sharing Revisited. CRYPTO 2009: 487-504

a service of

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.