The round complexity of verifiable secret sharing and secure multicast

DOI10.1145/380752.380853zbMath1317.68072OpenAlexW2033376960MaRDI QIDQ5176016

Tal Rabin, Yuval Ishai, Eyal Kushilevitz, Rosario Gennaro

Publication date: 27 February 2015

Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/380752.380853

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items

Broadcast-optimal two round MPC with an honest majority ⋮ Improving the round complexity of VSS in point-to-point networks ⋮ Paillier-based publicly verifiable (non-interactive) secret sharing ⋮ Dynamic and Verifiable Hierarchical Secret Sharing ⋮ Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) ⋮ Asymptotically free broadcast in constant expected time via packed VSS ⋮ Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) ⋮ Four-round black-box non-malleable schemes from one-way permutations ⋮ Perfect MPC over layered graphs ⋮ Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience ⋮ Secure message transmission in asynchronous networks ⋮ Verifiable secret sharing in a total of three rounds ⋮ 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 ⋮ Verifiable quantum secret sharing based on a single qudit ⋮ On the exact round complexity of secure three-party computation ⋮ Towards a scalable and robust DHT ⋮ On expected constant-round protocols for Byzantine agreement ⋮ Going beyond dual execution: MPC for functions with efficient verification ⋮ Two-Message, Oblivious Evaluation of Cryptographic Functionalities ⋮ An information theoretically secure e-lottery scheme based on symmetric bivariate polynomials ⋮ MPC with friends and foes ⋮ Dynamic threshold secret reconstruction and its application to the threshold cryptography ⋮ Broadcast-optimal two-round MPC

Cites Work

• A constant-factor approximation algorithm for the k -median problem (extended abstract)