Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Short Lattice-Based One-out-of-Many Proofs and Applications to Ring Signatures

Muhammed F. Esgin, Ron Steinfeld, Amin Sakzad, Joseph K. Liu, Dongxi Liu

Published Jan 1, 2019• 75 citations
Publisher
DOI
10.1007/978-3-030-21568-2_4

Related papers

Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs

Cecilia Boschini, Jan L. Camenisch, Gregory Neven

Lecture notes in computer science•Jan 1, 2018•11 citations

Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures

Fabrice Benhamouda, Jan L. Camenisch, Stephan Krenn +2 more

Lecture notes in computer science•Jan 1, 2014•106 citations

A Blind Ring Signature Based on the Short Integer Solution Problem

Huy Quoc Le, Dung Hoang Duong, Willy Susilo

Lecture notes in computer science•Jan 1, 2020•13 citations

Short Lattice Signature Scheme with Tighter Reduction under Ring-SIS Assumption

Kaisei Kajita, Go Ohtake, Kazuto Ogawa +2 more

We propose a short signature scheme under the ring-SIS assumption in the standard model. Specifically, by revisiting an existing construction [Ducas and Micciancio, CRYPTO 2014], we demonstrate lattice-based signatures with improved reduction loss. As far as we know, there are no ways to use multiple tags in the signature simulation of security proof in the lattice tag-based signatures. We address the tag-collision possibility in the lattice setting, which improves reduction loss. Our scheme generates tags from messages by constructing a scheme under a mild security condition that is existentially unforgeable against random message attack with auxiliary information. Thus our scheme can reduce the signature size since it does not need to send tags with the signatures. Our scheme has short signature sizes of O(1) and achieves tighter reduction loss than that of Ducas et al.'s scheme. Our proposed scheme has two variants. Our scheme with one property has tighter reduction and the same verification key size of O(log n) as that of Ducas et al.'s scheme, where n is the security parameter. Our scheme with the other property achieves much tighter reduction loss of O(Q/n) and verification key size of O(n), where Q is the number of signing queries.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Sep 7, 2022•1 citation

A Novel Lattice-Based Threshold Ring Signature Scheme

Sedat Akleylek, Meryem Soysaldı

In this paper, we present a new TRSS (threshold ring signature scheme) which depends on the worst-case hardness of a lattice problem. We apply Fiat-Shamir transform to a lattice-based identification scheme to obtain the proposed scheme. The hardness of the identification scheme which is the hybrid combination of two different designs is based on inhomogeneous short integer solution (ISIS) problem. We give security proof for the proposed TRSS. Comparing the proposed TRSS and the others which are quantum secure, the size of key pairs and the length of the signature are nearly same. Therefore, the proposed scheme is an alternative to the threshold ring signature schemes in post-quantum area.

International Conference on Computer Science and Engineering (UBMK)•Sep 1, 2020•5 citations

Efficient Identity-Based Signature from Lattices

Miaomiao Tian, Liusheng Huang

IFIP advances in information and communication technology•Jan 1, 2014•31 citations
We propose a short signature scheme under the ring-SIS assumption in the standard model. Specifically, by revisiting an existing construction [Ducas and Micciancio, CRYPTO 2014], we demonstrate lattice-based signatures with improved reduction loss. As far as we know, there are no ways to use multiple tags in the signature simulation of security proof in the lattice tag-based signatures. We address the tag-collision possibility in the lattice setting, which improves reduction loss. Our scheme generates tags from messages by constructing a scheme under a mild security condition that is existentially unforgeable against random message attack with auxiliary information. Thus our scheme can reduce the signature size since it does not need to send tags with the signatures. Our scheme has short signature sizes of O(1) and achieves tighter reduction loss than that of Ducas et al.'s scheme. Our proposed scheme has two variants. Our scheme with one property has tighter reduction and the same verification key size of O(log n) as that of Ducas et al.'s scheme, where n is the security parameter. Our scheme with the other property achieves much tighter reduction loss of O(Q/n) and verification key size of O(n), where Q is the number of signing queries.
In this paper, we present a new TRSS (threshold ring signature scheme) which depends on the worst-case hardness of a lattice problem. We apply Fiat-Shamir transform to a lattice-based identification scheme to obtain the proposed scheme. The hardness of the identification scheme which is the hybrid combination of two different designs is based on inhomogeneous short integer solution (ISIS) problem. We give security proof for the proposed TRSS. Comparing the proposed TRSS and the others which are quantum secure, the size of key pairs and the length of the signature are nearly same. Therefore, the proposed scheme is an alternative to the threshold ring signature schemes in post-quantum area.