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

IEICE Technical Report; IEICE Tech. Rep.

Identification Scheme Based on the Hardness of Ideal Lattice Problems in all Rings.

Kaoru Takemure, Bagus Santoso

Published Feb 28, 2019• 0 citations
OpenAlex

Related papers

Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings

Vadim Lyubashevsky

Lecture notes in computer science•Jan 1, 2016•38 citations

Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems

亮周 河内, Akinori Kawachi, KEISUKE TANAKA +2 more

•Dec 1, 2008•0 citations

Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems

Akinori Kawachi, Keisuke Tanaka, Keita Xagawa

Lecture notes in computer science•Jan 1, 2008•217 citations

An Identity-Based Ring Signcryption Scheme in Ideal Lattice.

Yiru Sun, Weimin Zheng

•Jan 1, 2018•10 citations

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.

•Sep 1, 2020•5 citations

On Ideal Lattices and Learning with Errors over Rings

Vadim Lyubashevsky, Chris Peikert, Oded Regev

Lecture notes in computer science•Jan 1, 2010•1,909 citations
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.