Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy
From MaRDI portal
Publication:6041283
DOI10.1007/978-3-030-92068-5_6zbMATH Open1514.94123OpenAlexW3217509233MaRDI QIDQ6041283FDOQ6041283
Jing Pan, Willy Susilo, Fangguo Zhang, Xiaofeng Chen
Publication date: 26 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-92068-5_6
Cites Work
- Public-key cryptosystems from the worst-case shortest vector problem
- On lattices, learning with errors, random linear codes, and cryptography
- Trapdoors for hard lattices and new cryptographic constructions
- Bonsai Trees, or How to Delegate a Lattice Basis
- Title not available (Why is that?)
- Topics in Cryptology – CT-RSA 2005
- Title not available (Why is that?)
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Classical hardness of learning with errors
- New bounds in some transference theorems in the geometry of numbers
- Scalable Group Signatures with Revocation
- Group Encryption: Non-interactive Realization in the Standard Model
- Group Signatures
- Title not available (Why is that?)
- Topics in Cryptology – CT-RSA 2005
- A new paradigm for public key identification
- Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
- Lattice-Based Group Signature Scheme with Verifier-Local Revocation
- Title not available (Why is that?)
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Advances in Cryptology - EUROCRYPT 2004
- More efficient commitments from structured lattice assumptions
- Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
- Lattice-based zero-knowledge arguments for integer relations
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption
- Hardness of SIS and LWE with Small Parameters
- Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease
- Toward Practical Group Encryption
- Mediated Traceable Anonymous Encryption
- Group Encryption
- Traceable Group Encryption
- Automata, Languages and Programming
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Title not available (Why is that?)
- Foundations of Fully Dynamic Group Signatures
- Revocable Group Signature Schemes with Constant Costs for Signing and Verifying
- On the Security of Dynamic Group Signatures: Preventing Signature Hijacking
Cited In (3)
Recommendations
- Group encryption: full dynamicity, message filtering and code-based instantiation 👍 👎
- Forward-Secure Group Encryptions from Lattices 👍 👎
- Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption 👍 👎
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption 👍 👎
- Group Encryption 👍 👎
This page was built for publication: Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041283)