default search action

combined dblp search
author search
venue search
publication search

ask others

Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID

"The Round Complexity of Verifiable Secret Sharing Revisited."

Arpita Patra et al. (2008)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2020-05-11

- view
  - electronic edition @ iacr.org (open access)
- export record
  dblp key:
  - journals/iacr/PatraCRR08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iacr/PatraCRR08
Arpita Patra, Ashish Choudhary, Tal Rabin, C. Pandu Rangan:
The Round Complexity of Verifiable Secret Sharing Revisited. IACR Cryptol. ePrint Arch. 2008: 172 (2008)

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.