File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/978-3-030-23696-0_8
- Scopus: eid_2-s2.0-85069175560
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Ring signatures based on middle-product learning with errors problems
Title | Ring signatures based on middle-product learning with errors problems |
---|---|
Authors | |
Issue Date | 2019 |
Citation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2019, v. 11627 LNCS, p. 139-156 How to Cite? |
Abstract | © Springer Nature Switzerland AG 2019. Lattice-based (linkable) ring signatures are an important notion to cryptography since it protects signer anonymity against quantum computers. In this paper, we proposed a new lattice-based linkable ring signature scheme using a variant of Learning with Errors problem called Middle-Product Learning with Errors (MPLWE). The proposed scheme follows a framework from [10, 12] with the following improvements. Firstly, this scheme relies on a much weaker assumption. Secondly, our approach relies on a decisional problem, thus, the security analysis does not require the Forking Lemma which has been a fundamental obstacle for provable security under the quantum random oracle model (QROM). |
Persistent Identifier | http://hdl.handle.net/10722/280701 |
ISSN | 2023 SCImago Journal Rankings: 0.606 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Das, Dipayan | - |
dc.contributor.author | Au, Man Ho | - |
dc.contributor.author | Zhang, Zhenfei | - |
dc.date.accessioned | 2020-02-17T14:34:43Z | - |
dc.date.available | 2020-02-17T14:34:43Z | - |
dc.date.issued | 2019 | - |
dc.identifier.citation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2019, v. 11627 LNCS, p. 139-156 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/10722/280701 | - |
dc.description.abstract | © Springer Nature Switzerland AG 2019. Lattice-based (linkable) ring signatures are an important notion to cryptography since it protects signer anonymity against quantum computers. In this paper, we proposed a new lattice-based linkable ring signature scheme using a variant of Learning with Errors problem called Middle-Product Learning with Errors (MPLWE). The proposed scheme follows a framework from [10, 12] with the following improvements. Firstly, this scheme relies on a much weaker assumption. Secondly, our approach relies on a decisional problem, thus, the security analysis does not require the Forking Lemma which has been a fundamental obstacle for provable security under the quantum random oracle model (QROM). | - |
dc.language | eng | - |
dc.relation.ispartof | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | - |
dc.title | Ring signatures based on middle-product learning with errors problems | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/978-3-030-23696-0_8 | - |
dc.identifier.scopus | eid_2-s2.0-85069175560 | - |
dc.identifier.volume | 11627 LNCS | - |
dc.identifier.spage | 139 | - |
dc.identifier.epage | 156 | - |
dc.identifier.eissn | 1611-3349 | - |
dc.identifier.issnl | 0302-9743 | - |