Theory of Cryptography
From MaRDI portal
Publication:5898362
DOI10.1007/11681878zbMath1112.94028WikidataQ57254512 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
94A62: Authentication, digital signatures and secret sharing
Related Items
Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience, Key Management in Sensor Networks, Verifiable secret sharing in a total of three rounds, Efficient VSS free of computational assumption, Strong \((n, t, n)\) verifiable secret sharing scheme, On expected constant-round protocols for Byzantine agreement, Perennial secure multi-party computation of universal Turing machine, Efficient asynchronous verifiable secret sharing and multiparty computation, Cheating identifiable secret sharing scheme using symmetric bivariate polynomial, Asynchronous Byzantine agreement with optimal resilience, Dynamic threshold secret reconstruction and its application to the threshold cryptography, Improving the round complexity of VSS in point-to-point networks, Broadcast (and Round) Efficient Verifiable Secret Sharing, Dynamic and Verifiable Hierarchical Secret Sharing