File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Raptor: A practical lattice-based (linkable) ring signature

TitleRaptor: A practical lattice-based (linkable) ring signature
Authors
Issue Date2019
Citation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2019, v. 11464 LNCS, p. 110-130 How to Cite?
Abstract© Springer Nature Switzerland AG 2019. We present Raptor, the first practical lattice-based (linkable) ring signature scheme with implementation. Raptor is as fast as classical solutions; while the size of the signature is roughly 1.3 KB per user. Prior to our work, all existing lattice-based solutions are analogues of their discrete-log or pairing-based counterparts. We develop a generic construction of (linkable) ring signatures based on the well-known generic construction from Rivest et al., which is not fully compatible with lattices. Our generic construction is provably secure in random oracle model. We also give instantiations from both standard lattice, as a proof of concept, and NTRU lattice, as an efficient instantiation. We show that the latter construction, called Raptor, is almost as efficient as the classical RST ring signatures and thus may be of practical interest.
Persistent Identifierhttp://hdl.handle.net/10722/280492
ISSN
2020 SCImago Journal Rankings: 0.249
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorLu, Xingye-
dc.contributor.authorAu, Man Ho-
dc.contributor.authorZhang, Zhenfei-
dc.date.accessioned2020-02-17T14:34:10Z-
dc.date.available2020-02-17T14:34:10Z-
dc.date.issued2019-
dc.identifier.citationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2019, v. 11464 LNCS, p. 110-130-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/10722/280492-
dc.description.abstract© Springer Nature Switzerland AG 2019. We present Raptor, the first practical lattice-based (linkable) ring signature scheme with implementation. Raptor is as fast as classical solutions; while the size of the signature is roughly 1.3 KB per user. Prior to our work, all existing lattice-based solutions are analogues of their discrete-log or pairing-based counterparts. We develop a generic construction of (linkable) ring signatures based on the well-known generic construction from Rivest et al., which is not fully compatible with lattices. Our generic construction is provably secure in random oracle model. We also give instantiations from both standard lattice, as a proof of concept, and NTRU lattice, as an efficient instantiation. We show that the latter construction, called Raptor, is almost as efficient as the classical RST ring signatures and thus may be of practical interest.-
dc.languageeng-
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)-
dc.titleRaptor: A practical lattice-based (linkable) ring signature-
dc.typeConference_Paper-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/978-3-030-21568-2_6-
dc.identifier.scopuseid_2-s2.0-85067260875-
dc.identifier.volume11464 LNCS-
dc.identifier.spage110-
dc.identifier.epage130-
dc.identifier.eissn1611-3349-
dc.identifier.isiWOS:000501602600006-
dc.identifier.issnl0302-9743-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats