Efficient multivariate-based ring signature schemes

Download

index.pdf

Date

2022-8-4

Author

Demircioğlu, Murat

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

439
views

376
downloads

The ring signature scheme has a wide range of usage areas in public-key cryptography. One is leaking information within a group without exposing the signer's identity. The majority of the ring signature techniques in use, on the other hand, rely on classical crypto-systems such as RSA and ECDH, which are known to be vulnerable to Shor's algorithm on a large-scale quantum computer. In this thesis, we propose efficient quantum-resistant ring signature schemes based on GeMSS and Gui signature algorithms. Gui was a candidate in Round 1, and GeMSS was one of two multivariate-based signature algorithms along with Rainbow in Round 3 of the Post-Quantum Cryptography Standardization Project initiated by NIST in 2016. When we compare our proposed scheme with a Rainbow-based ring signature scheme, the experimental results show that we achieve 300 times faster signature verification and almost 50 times faster signature generation as the number of users in the group increases to 50. Moreover, the proposed scheme provides at least 20% smaller signature sizes. Therefore, our scheme is verified to be more effective to be used.

Subject Keywords

cryptography, post-quantum, multivariate, GeMSS, Gui, ring signature

URI

https://hdl.handle.net/11511/98585

Collections

Graduate School of Applied Mathematics, Thesis

Suggestions

OpenMETU
Core

Efficient GeMSS Based Ring Signature Scheme Demircioğlu, Murat; Akleylek, Sedat; Cenk, Murat (2019-06-18) The ring signature scheme has an important usage area of public key crypto-system. It can be used for e-voting,as well as leaking information without revealing identity within a group. However, mostof these systems relies ontraditional crypto-systems which are not secure against quantum computing related attacks. Multivariate cryptography is one of themost popular researchareas on quantum resilient crypto-systems. In this work, we propose an efficient ring signature scheme based on GeM...
Design and analysis of hash functions Koçak, Onur; Doğanaksoy, Ali; Department of Cryptography (2009) Hash functions are cryptographic tools that are used in various applications like digital signature, message integrity checking, password storage and random number generation. These cryptographic primitives were, first, constructed using modular arithmetical operations which were popular at that time because of public key cryptography. Later, in 1989, Merkle and Damgard independently proposed an iterative construction method. This method was easy to implement and had a security proof. MD-4 was the first has...
Infinite length hash chains and their applications Bicakci, K; Baykal, Nazife (2002-06-12) Hash Chains are used extensively in various cryptography, applications such as one-time passwords, server-supported signatures and micropayments. In this paper, we present a method, called Infinite Length Hash Chains to improve the flexibility of this chaining idea by using public-key techniques. One of its distinguishing features is that communication and computation overhead of restarting of the system is avoided. For the owner of the chain it is possible to go in either way in the chain at any time witho...
Efficient Modular Exponentiation Methods for RSA Güner, Hatice; Cenk, Murat; Çalık, Çağdaş (2015-11-03) RSA is a commonly used asymmetric key cryptosystem that is used in encrypting and signing messages. The efficiency of the implementation is an important factor in effectively using the system. The RSA algorithm heavily depends on the modular exponentiation operation on large integers. A drawback of this system is that it becomes inefficient so quickly when the parameters are adjusted to increase security. This situation causes the operations to be performed with large numbers. Therefore, implementations req...
An efficient RSA public key encryption scheme Aboud, Sattar J.; AL-Fayoumi, Mohammad A.; Al-Fayoumi, Mustafa; Jabbar, Haidar S. (2008-04-09) In this paper, we propose an efficient RSA public key encryption scheme, which is an improved version of original RSA scheme. The proposed RSA encryption scheme is based on linear group over the ring of integer mod a composite modulus n which is the product of two distinct prime numbers. In the proposed scheme the original message and the encrypted message are h x h square matrices with entities in z(n) indicated via l(h,z(n)). Since the original RSA Scheme is a block cipher in which the original message an...

Citation Formats

M. Demircioğlu, “Efficient multivariate-based ring signature schemes,” Ph.D. - Doctoral Program, Middle East Technical University, 2022.