On secret sharing with nonlinear product reconstruction
Multiplicative linear secret sharing is a fundamental notion in the area of secure multi- party computation (MPC) and, since recently, in the area of two-party cryptography as well. In a nutshell, this notion guarantees that \the product of two secrets is obtained as a linear function of the vector...
| Autores: | , , , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2015 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/86921 |
| Acceso en línea: | https://hdl.handle.net/2117/86921 https://dx.doi.org/10.1137/130931886 |
| Access Level: | acceso abierto |
| Palabra clave: | Arithmetic (arithmetic) secret sharing Aritmètica Classificació AMS::94 Information And Communication, Circuits::94A Communication, information Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica aplicada a les ciències |
| Sumario: | Multiplicative linear secret sharing is a fundamental notion in the area of secure multi- party computation (MPC) and, since recently, in the area of two-party cryptography as well. In a nutshell, this notion guarantees that \the product of two secrets is obtained as a linear function of the vector consisting of the coordinate-wise product of two respective share-vectors |
|---|