More efficient construction of anonymous signatures

DOI10.1007/978-3-030-88052-1_23zbMath1500.94069OpenAlexW3199366466MaRDI QIDQ2673068

Rui Zhang, Yang Tao, Yunfeng Ji

Publication date: 8 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-88052-1_23

zbMATH Keywords

post-quantum securitylattice-based signatureanonymous signature

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Unnamed Item
• Unnamed Item
• More efficient commitments from structured lattice assumptions
• Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Random Oracles in a Quantum World
• Trapdoors for hard lattices and new cryptographic constructions
• Strong Anonymous Signatures
• Anonymous Signatures Revisited
• Group Signatures
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• Anonymous Signatures Made Easy
• Theory of Cryptography
• Theory of Cryptography
• Public Key Cryptography - PKC 2006

This page was built for publication: More efficient construction of anonymous signatures