Efficient GeMSS Based Ring Signature Scheme

Date

2019-06-18

Author

Demircioğlu, Murat
Akleylek, Sedat
Cenk, Murat

Metadata

Show full item record

Item Usage Stats

433
views

0
downloads

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 GeMSS, where we achieve smaller signature size and faster verification time with respect to other alternatives.

Subject Keywords

Post-quantum cryptography, Multivariate, GeMSS, Ring signature

URI

https://hdl.handle.net/11511/72061
https://myfik.unisza.edu.my/myjcam/index.php/myjcam/article/view/41/39

Conference Name

The Second International Workshop on Cryptography and its Applications – 2’IWCA’19 (18 - 19 Haziran 2019)

Collections

Graduate School of Applied Mathematics, Conference / Seminar

Suggestions

OpenMETU
Core

Efficient multivariate-based ring signature schemes Demircioğlu, Murat; Cenk, Murat; Akleylek, Sedat; Department of Cryptography (2022-8-4) 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 w...
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...
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...
On the ntru public key cryptosystem Çimen, Canan; Çakçak, Emrah; Department of Cryptography (2008) NTRU is a public key cryptosystem, which was first introduced in 1996. It is a ring-based cryptosystem and its security relies on the complexity of a well-known lattice problem, i.e. shortest vector problem (SVP). There is no efficient algorithm known to solve SVP exactly in arbitrary high dimensional lattices. However, approximate solutions to SVP can be found by lattice reduction algorithms. LLL is the first polynomial time algorithm that finds reasonable short vectors of a lattice. The best known attacks...
Security of Quantum Key Recycling Akyuz, Kaan; Turgut, Sadi; Department of Physics (2022-9-1) In cryptography, unconditional security is achieved by hiding the message under a sufficiently long one-time pad, a key that is completely unknown from outside. The one-time pad is single-use-only, because the presence of an eavesdropper is undetectable in a classical channel. In contrast, an adversary is highly detectable in a quantum channel. Quantum key recycling’s objective is to detect the adversary and re-use the one-time pad. The analysis of quantum key recycling is mainly concerned with the rate and...

Citation Formats

M. Demircioğlu, S. Akleylek, and M. Cenk, “Efficient GeMSS Based Ring Signature Scheme,” presented at the The Second International Workshop on Cryptography and its Applications – 2’IWCA’19 (18 - 19 Haziran 2019), Oran, Cezayir, 2019, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/72061.