This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revisionBoth sides next revision |
| public:research:main [2024-01-18 15:50] – [Randomness statistical testing of TRNG and PRNG] xjancar | public:research:main [2024-01-18 15:50] – [Secure Multiparty Computation on limited devices] xjancar |
|---|
| With the use of secure multi-party computation, the risk of vulnerable implementations can be mitigated. Secure multi-party computation allows for splitting of the secret key among multiple devices, which partake in an interactive protocol to perform cryptographic operations. The complete secret key is never reconstructed during this protocol, so if at least one of the devices remains uncorrupted, the secret key is not exposed. Our research focuses on secure multi-party computation executed on the specialized cryptographic devices, which bring interesting constraints to protocol design and implementation. | With the use of secure multi-party computation, the risk of vulnerable implementations can be mitigated. Secure multi-party computation allows for splitting of the secret key among multiple devices, which partake in an interactive protocol to perform cryptographic operations. The complete secret key is never reconstructed during this protocol, so if at least one of the devices remains uncorrupted, the secret key is not exposed. Our research focuses on secure multi-party computation executed on the specialized cryptographic devices, which bring interesting constraints to protocol design and implementation. |
| |
| <button collapse="smpc">Find out more</button> | <button icon="fa fa-caret-down" collapse="smpc">Find out more</button> |
| <button icon="fa fa-file-text-o">[[:publications:keywords:smpc|Publications]]</button> | <button icon="fa fa-file-text-o">[[:publications:keywords:smpc|Publications]]</button> |
| |