Computational Verifiable Secret Sharing Revisited
From MaRDI portal
Publication:3102212
DOI10.1007/978-3-642-25385-0_32zbMath1227.94071OpenAlexW2277839617MaRDI QIDQ3102212
Arpita Patra, Aniket Kate, Michael Backes
Publication date: 2 December 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25385-0_32
Related Items (8)
Constructions of dynamic and non-dynamic threshold public-key encryption schemes with decryption consistency ⋮ Improving the efficiency of optimally-resilient statistically-secure asynchronous multi-party computation ⋮ Dynamic Threshold Public-Key Encryption with Decryption Consistency from Static Assumptions ⋮ Dynamic and Verifiable Hierarchical Secret Sharing ⋮ Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) ⋮ Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) ⋮ Beyond honest majority: the round complexity of fair and robust multi-party computation ⋮ On the exact round complexity of secure three-party computation
This page was built for publication: Computational Verifiable Secret Sharing Revisited
