Theory of Cryptography

DOI10.1007/11681878zbMath1112.94028OpenAlexW3149533473WikidataQ57254512 ScholiaQ57254512MaRDI QIDQ5898362

Kannan Srinathan, Shyamnath Gollakota, Juan A. Garay, Matthias Fitzi, C. Pandu Rangan

Publication date: 12 February 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11681878

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (14)

Improving the round complexity of VSS in point-to-point networks ⋮ Broadcast (and Round) Efficient Verifiable Secret Sharing ⋮ Dynamic and Verifiable Hierarchical Secret Sharing ⋮ Cheating identifiable secret sharing scheme using symmetric bivariate polynomial ⋮ Verifiable secret sharing in a total of three rounds ⋮ Key Management in Sensor Networks ⋮ Efficient VSS free of computational assumption ⋮ Perennial secure multi-party computation of universal Turing machine ⋮ Asynchronous Byzantine agreement with optimal resilience ⋮ Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience ⋮ Efficient asynchronous verifiable secret sharing and multiparty computation ⋮ Strong \((n, t, n)\) verifiable secret sharing scheme ⋮ On expected constant-round protocols for Byzantine agreement ⋮ Dynamic threshold secret reconstruction and its application to the threshold cryptography

This page was built for publication: Theory of Cryptography