The round complexity of verifiable secret sharing and secure multicast
From MaRDI portal
(Redirected from The round complexity of verifiable secret sharing and secure multicast)
Recommendations
Cites work
Cited in
(48)- 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
- Verifiable quantum secret sharing based on a single qudit
- Going beyond dual execution: MPC for functions with efficient verification
- MPC with friends and foes
- Broadcast-optimal two-round MPC
- A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity
- Broadcast-optimal two round MPC with an honest majority
- Asynchronous Byzantine agreement with optimal resilience
- An information theoretically secure e-lottery scheme based on symmetric bivariate polynomials
- Dynamic threshold secret reconstruction and its application to the threshold cryptography
- Improving the round complexity of VSS in point-to-point networks
- Two-message, oblivious evaluation of cryptographic functionalities
- Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
- Broadcast (and round) efficient verifiable secret sharing
- Dynamic and verifiable hierarchical secret sharing
- The round complexity of verifiable secret sharing: the statistical case
- The Round Complexity of Verifiable Secret Sharing Revisited
- On the complexity of verifiable secret sharing and multiparty computation
- Paillier-based publicly verifiable (non-interactive) secret sharing
- Verifiable secret sharing in a total of three rounds
- Efficient statistical asynchronous verifiable secret sharing with optimal resilience
- On the exact round complexity of secure three-party computation
- A generalization of Bernstein-Vazirani algorithm with multiple secret keys and a probabilistic oracle
- 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
- VSS Made Simpler
- The round complexity of statistical MPC with optimal resiliency
- On the round complexity of fully secure solitary MPC with honest majority
- Your reputation's safe with me: framing-free distributed zero-knowledge proofs
- Peeking into the future: MPC resilient to super-rushing adversaries
- Black-box constant-round secure 2PC with succinct communication
- Asymptotically free broadcast in constant expected time via packed VSS
- Statistical layered MPC
- Rumors MPC: GOD for dynamic committees, low communication via constant-round chat
- Information-theoretic broadcast-optimal MPC
- Round-optimal Byzantine agreement without trusted setup
- PUFF: maximally \underline{p}roactive sec\underline{u}rity \underline{f}or \underline{f}ree in perfectly secure mpc with guaranteed output delivery
- Towards a scalable and robust DHT
- On round-optimal computational VSS
- Consumable data via quantum communication
- Consumable data via quantum communication
This page was built for publication: The round complexity of verifiable secret sharing and secure multicast
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176016)