Národní úložiště šedé literatury Nalezeno 1 záznamů.  Hledání trvalo 0.01 vteřin. 

Warning: Requested record does not seem to exist.
Secure Two-Party Computation for weak Boneh-Boyen Signature
Sečkár, M. ; Ricci, S.
Secure two-party computation allows two entities to securely calculate a common result keeping their private inputs secret. By applying this to the weak Boneh-Boyen signature, a trusted third party is able to sign the user’s message (or a secret key) without knowing its content (or value). In this article, we present a C library that implements a two-party computation algorithm for generating a user’s secret key that can be used in a group signature scheme. The library provides a structured output ready to be serialized and sent over a network. We also show the computational benchmarks of the implemented algorithms. The computations on the sender’s side are relatively fast, which broadens the possibilities of deployment on constrained devices.

Chcete být upozorněni, pokud se objeví nové záznamy odpovídající tomuto dotazu?
Přihlásit se k odběru RSS.