File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/978-3-030-21568-2_6
- Scopus: eid_2-s2.0-85067260875
- WOS: WOS:000501602600006
- Find via
Supplementary
- Citations:
- Appears in Collections:
Conference Paper: Raptor: A practical lattice-based (linkable) ring signature
Title | Raptor: A practical lattice-based (linkable) ring signature |
---|---|
Authors | |
Issue Date | 2019 |
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 Identifier | http://hdl.handle.net/10722/280492 |
ISSN | 2023 SCImago Journal Rankings: 0.606 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lu, Xingye | - |
dc.contributor.author | Au, Man Ho | - |
dc.contributor.author | Zhang, Zhenfei | - |
dc.date.accessioned | 2020-02-17T14:34:10Z | - |
dc.date.available | 2020-02-17T14:34:10Z | - |
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. 11464 LNCS, p. 110-130 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://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.language | eng | - |
dc.relation.ispartof | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | - |
dc.title | Raptor: A practical lattice-based (linkable) ring signature | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/978-3-030-21568-2_6 | - |
dc.identifier.scopus | eid_2-s2.0-85067260875 | - |
dc.identifier.volume | 11464 LNCS | - |
dc.identifier.spage | 110 | - |
dc.identifier.epage | 130 | - |
dc.identifier.eissn | 1611-3349 | - |
dc.identifier.isi | WOS:000501602600006 | - |
dc.identifier.issnl | 0302-9743 | - |