Original title: Secure Two-Party Computation for weak Boneh-Boyen Signature
Authors: Sečkár, M. ; Ricci, S.
Document type: Papers
Language: eng
Publisher: Vysoké učení technické v Brně, Fakulta elektrotechniky a komunikačních technologií
Abstract: 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.
Keywords: C Language; GMP; Group Signature; OpenSSL; Paillier Cryptosystem; Secure Multi-Party Computation
Host item entry: Proceedings I of the 28st Conference STUDENT EEICT 2022: General papers, ISBN 978-80-214-6029-4

Institution: Brno University of Technology (web)
Document availability information: Fulltext is available in the Brno University of Technology Digital Library.
Original record: http://hdl.handle.net/11012/209313

Permalink: http://www.nusl.cz/ntk/nusl-524740


The record appears in these collections:
Universities and colleges > Public universities > Brno University of Technology
Conference materials > Papers
 Record created 2023-05-07, last modified 2023-05-07


No fulltext
  • Export as DC, NUŠL, RIS
  • Share