Group signatures from lattices : simpler, tighter, shorter, ring-based
We introduce a lattice-based group signature scheme that provides several noticeable improvements over the contemporary ones: simpler construction, weaker hardness assumptions, and shorter sizes of keys and signatures. Moreover, our scheme can be transformed into the ring setting, resulting in a sch...
Saved in:
Main Authors: | Ling, San, Nguyen, Khoa, Wang, Huaxiong |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2015
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/107303 http://hdl.handle.net/10220/25432 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
by: Libert, Benoît, et al.
Published: (2024) -
A family of group character codes
by: Ling, San
Published: (2013) -
Split group codes
by: Kohel, David R., et al.
Published: (2013) -
Provably secure group signature schemes from code-based assumptions
by: Ezerman, Martianus Frederic, et al.
Published: (2020) -
Elementary 2-group character codes
by: Kohel, David R., et al.
Published: (2013)