Publication detail

Secure Two-Party Computation for weak Boneh-Boyen Signature

SEČKÁR, M. RICCI, S.

Original Title

Secure Two-Party Computation for weak Boneh-Boyen Signature

Type

conference paper

Language

English

Original 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

Secure Multi-Party Computation; Paillier Cryptosystem; Group Signature; C Language; OpenSSL; GMP

Authors

SEČKÁR, M.; RICCI, S.

Released

26. 4. 2022

Publisher

Brno University of Technology, Faculty of Electrical Engineering and Communication

Location

Brno

ISBN

978-80-214-6029-4

Book

Proceedings I of the 28th Conference STUDENT EEICT 2022 General Papers

Edition

1

Pages from

145

Pages to

148

Pages count

4

URL

BibTex

@inproceedings{BUT178917,
  author="Martin {Sečkár} and Sara {Ricci}",
  title="Secure Two-Party Computation for weak Boneh-Boyen Signature",
  booktitle="Proceedings I of the 28th Conference STUDENT EEICT 2022 General Papers",
  year="2022",
  series="1",
  pages="145--148",
  publisher="Brno University of Technology, Faculty of Electrical Engineering and Communication",
  address="Brno",
  isbn="978-80-214-6029-4",
  url="https://www.eeict.cz/eeict_download/archiv/sborniky/EEICT_2022_sbornik_1_v2.pdf"
}