Secret handshakes: full dynamicity, deniability and lattice-based design

DOI10.1016/j.tcs.2022.10.035OpenAlexW4307302865MaRDI QIDQ2699945

Fangguo Zhang, Yamin Wen, Jing Pan, Zhiyuan An

Publication date: 20 April 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.10.035

zbMATH Keywords

zero-knowledgedeniabilitysecret handshakelattice cryptographyfull dynamicity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• On the concrete hardness of learning with errors
• Minimum disclosure proofs of knowledge
• Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
• Short lattice-based one-out-of-many proofs and applications to ring signatures
• Lattice-based secret handshakes with reusable credentials
• Secret Handshakes with Dynamic Expressive Matching Policy
• Foundations of Fully Dynamic Group Signatures
• Hardness of SIS and LWE with Small Parameters
• Lattice-Based Group Signatures with Logarithmic Signature Size
• Lattice Signatures without Trapdoors
• Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
• Better Key Sizes (and Attacks) for LWE-Based Encryption
• A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem
• A new paradigm for public key identification
• Private Mutual Authentication and Conditional Oblivious Transfer
• Trapdoors for hard lattices and new cryptographic constructions
• Unlinkable Secret Handshakes and Key-Private Group Key Management Schemes
• Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
• The knowledge complexity of interactive proof-systems
• Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
• Group Secret Handshakes Or Affiliation-Hiding Authenticated Group Key Agreement
• Lattice-Based Group Signature Scheme with Verifier-Local Revocation
• Lattice-Based Identification Schemes Secure Under Active Attacks
• Verifier-Local Revocation Group Signature Schemes with Backward Unlinkability from Bilinear Maps
• New Construction of Group Secret Handshakes Based on Pairings
• Predicting Lattice Reduction
• Secret Handshakes from CA-Oblivious Encryption
• Classical hardness of learning with errors
• Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
• Applied Cryptography and Network Security
• On lattices, learning with errors, random linear codes, and cryptography
• DSH: Deniable Secret Handshake Framework

This page was built for publication: Secret handshakes: full dynamicity, deniability and lattice-based design