Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures
From MaRDI portal
Publication:2701489
DOI10.1007/s10623-022-01177-2OpenAlexW4320933233MaRDI QIDQ2701489
Koji Nuida, Noboru Kunihiro, Reo Eriguchi
Publication date: 28 April 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-022-01177-2
secure multiparty computationverifiabilitymultipartite adversary structuremultiplicative secret sharing
Cites Work
- Ideal multipartite secret sharing schemes
- On \(d\)-multiplicative secret sharing
- On the asymptotic behaviour of some towers of function fields over finite fields
- Secret sharing schemes with detection of cheaters for a general access structure
- Algebraic manipulation detection codes
- Secure multi-party computation made simple
- Efficient General-Adversary Multi-Party Computation
- Ideal Secret Sharing Schemes for Useful Multipartite Access Structures
- How to share a secret
- Algebraic Function Fields and Codes
- Multiplicative Linear Secret Sharing Schemes Based on Connectivity of Graphs
- Scalable and Unconditionally Secure Multiparty Computation
- Strongly Multiplicative Hierarchical Threshold Secret Sharing
- Verifiably Multiplicative Secret Sharing
- Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
- Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- d-Multiplicative Secret Sharing for Multipartite Adversary Structures
- Unnamed Item
- Unnamed Item
