Lattice-based secret handshakes with reusable credentials
From MaRDI portal
Publication:2672459
DOI10.1007/978-3-030-88052-1_14zbMath1501.94064OpenAlexW3200105706MaRDI QIDQ2672459
Zhuoran Zhang, Zhiyuan An, Fangguo Zhang, Yamin Wen
Publication date: 8 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-88052-1_14
Related Items (2)
Forward-secure revocable secret handshakes from lattices ⋮ Secret handshakes: full dynamicity, deniability and lattice-based design
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Generating shorter bases for hard random lattices
- Secret handshakes from ID-based message recovery signatures: a new generic approach
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Secret Handshakes with Dynamic Expressive Matching Policy
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Private Mutual Authentication and Conditional Oblivious Transfer
- Trapdoors for hard lattices and new cryptographic constructions
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- The knowledge complexity of interactive proof-systems
- Group Secret Handshakes Or Affiliation-Hiding Authenticated Group Key Agreement
- Lattice-Based Group Signature Scheme with Verifier-Local Revocation
- Secret Handshakes from CA-Oblivious Encryption
- Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
- On lattices, learning with errors, random linear codes, and cryptography
- DSH: Deniable Secret Handshake Framework
This page was built for publication: Lattice-based secret handshakes with reusable credentials