File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Ring signatures based on middle-product learning with errors problems

TitleRing signatures based on middle-product learning with errors problems
Authors
Issue Date2019
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 Identifierhttp://hdl.handle.net/10722/280701
ISSN
2023 SCImago Journal Rankings: 0.606

 

DC FieldValueLanguage
dc.contributor.authorDas, Dipayan-
dc.contributor.authorAu, Man Ho-
dc.contributor.authorZhang, Zhenfei-
dc.date.accessioned2020-02-17T14:34:43Z-
dc.date.available2020-02-17T14:34:43Z-
dc.date.issued2019-
dc.identifier.citationLecture 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.issn0302-9743-
dc.identifier.urihttp://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.languageeng-
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)-
dc.titleRing signatures based on middle-product learning with errors problems-
dc.typeConference_Paper-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/978-3-030-23696-0_8-
dc.identifier.scopuseid_2-s2.0-85069175560-
dc.identifier.volume11627 LNCS-
dc.identifier.spage139-
dc.identifier.epage156-
dc.identifier.eissn1611-3349-
dc.identifier.issnl0302-9743-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats