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
Authors: Jing Pan, Xiaofeng Chen, Fangguo Zhang, Willy Susilo 
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
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
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
- Efficient concurrent zero-knowledge in the auxiliary string model
- 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 (5)
- 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: full dynamicity, message filtering and code-based instantiation
- Ideal dynamic threshold multi-secret data sharing in smart environments for sustainable cities
- Forward-Secure Group Encryptions from Lattices
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)
