Efficient unique ring signatures from lattices

DOI10.1007/978-3-031-17146-8_22zbMath1524.94087MaRDI QIDQ6109450

Unnamed Author, Kazuhide Fukushima, Fuchun Guo, Willy Susilo, Tuong Ngoc Nguyen, Anh The Ta, Dung Hoang Duong, Shinsaku Kiyomoto

Publication date: 28 July 2023

Published in: Computer Security – ESORICS 2022 (Search for Journal in Brave)

zbMATH Keywords

lattice-based cryptographyunique ring signaturesMerkle tree accumulatorzero-knowledge argument of knowledge

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel coin-tossing and constant-round secure two-party computation
• Compact ring signatures from learning with errors
• Short lattice-based one-out-of-many proofs and applications to ring signatures
• Ring signatures: logarithmic-size, no setup -- from standard assumptions
• Pseudorandom Functions and Lattices
• A new paradigm for public key identification
• Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
• Trapdoors for hard lattices and new cryptographic constructions
• Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
• Information Security and Privacy
• Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting

This page was built for publication: Efficient unique ring signatures from lattices