Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
An accumulator is a function that hashes a set of inputs into a short, constant-size string while preserving the ability to efficiently prove the inclusion of a specific input element in the hashed set. It has proved useful in the design of numerous privacy-enhancing protocols, in order to handle re...
Saved in:
Main Authors: | Libert, Benoît, Ling, San, Nguyen, Khoa, Wang, Huaxiong |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2024
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/172932 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Accountable Trapdoor Sanitizable Signatures
by: LAI, Junzuo, et al.
Published: (2013) -
A lattice-based linkable ring signature supporting stealth addresses
by: Liu, Zhen, et al.
Published: (2020) -
A lattice-based linkable ring signature supporting stealth addresses
by: LIU, Zhen, et al.
Published: (2019) -
Traceable policy-based signatures and instantiation from lattices
by: Xu, Yanhong, et al.
Published: (2022) -
A lattice-based group signature scheme with verifier-local revocation
by: Ling, San, et al.
Published: (2020)