[Resource Topic] 2016/450: A Provably Secure Code-based Concurrent Signature Scheme

Welcome to the resource topic for 2016/450

Title:
A Provably Secure Code-based Concurrent Signature Scheme

Authors: Maryam Rajabzadeh Asaar, Mahmoud Salmasizadeh, Mohammad Reza Aref

Abstract:

Concurrent signatures allow two entities to generate two signatures in such a way that both signatures are ambiguous till some information is revealed by one of the parties. This kind of signature is useful in auction protocols and a wide range of scenarios in which involving participants are mutually distrustful. In this paper, to have quantum-attack-resistant concurrent signatures as recommended by National Institute of Standards and Technology (NISTIR 8105), the first concurrent signature scheme based on coding theory is proposed. Then, its security is proved under Goppa Parameterized Bounded Decoding and the Goppa Code Distinguishing assumptions in the random oracle model. We should highlight that our proposal can be a post-quantum candidate for fair exchange of signatures without a trusted third party in an efficient way (without a highly degree of interactions).

ePrint: https://eprint.iacr.org/2016/450

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .