The following pages link to Theory of Cryptography (Q5898362):
Displaying 19 items.
- Verifiable secret sharing in a total of three rounds (Q456152) (← links)
- Efficient VSS free of computational assumption (Q663418) (← links)
- Strong \((n, t, n)\) verifiable secret sharing scheme (Q991242) (← links)
- On expected constant-round protocols for Byzantine agreement (Q1004599) (← links)
- Perennial secure multi-party computation of universal Turing machine (Q1737594) (← links)
- Efficient asynchronous verifiable secret sharing and multiparty computation (Q2018817) (← links)
- Cheating identifiable secret sharing scheme using symmetric bivariate polynomial (Q2195383) (← links)
- Asynchronous Byzantine agreement with optimal resilience (Q2251153) (← links)
- Dynamic threshold secret reconstruction and its application to the threshold cryptography (Q2353654) (← links)
- Improving the round complexity of VSS in point-to-point networks (Q2389350) (← links)
- (Q2757242) (← links)
- Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model (Q2936611) (← links)
- Broadcast (and Round) Efficient Verifiable Secret Sharing (Q2948264) (← links)
- Dynamic and Verifiable Hierarchical Secret Sharing (Q2953806) (← links)
- Information-theoretic secure verifiable secret sharing over RSA modulus (Q3443323) (← links)
- Round-Optimal Contributory Conference Key Agreement (Q4414705) (← links)
- Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience (Q4931669) (← links)
- Key Management in Sensor Networks (Q5391137) (← links)
- Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) (Q6111540) (← links)
