Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy

DOI10.1007/978-3-030-92068-5_6MaRDI QIDQ6041283zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

zero-knowledgelattice cryptographygroup encryptionmessage filteringfull dynamicity

Mathematics Subject Classification ID

Cryptography (94A60)

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

• scientific article; zbMATH DE number 1618050 (Why is no real title available?)
• scientific article; zbMATH DE number 1942413 (Why is no real title available?)
• scientific article; zbMATH DE number 1952906 (Why is no real title available?)
• scientific article; zbMATH DE number 2009983 (Why is no real title available?)
• A new paradigm for public key identification
• Advances in Cryptology - EUROCRYPT 2004
• Automata, Languages and Programming
• Bonsai trees, or how to delegate a lattice basis
• Classical hardness of learning with errors
• Efficient concurrent zero-knowledge in the auxiliary string model
• Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
• Foundations of fully dynamic group signatures
• Group Encryption
• Group Signatures
• Group encryption: full dynamicity, message filtering and code-based instantiation
• Group encryption: non-interactive realization in the standard model
• Hardness of SIS and LWE with small parameters
• Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
• Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease
• Lattice-based group signature scheme with verifier-local revocation
• Lattice-based zero-knowledge arguments for integer relations
• Mediated traceable anonymous encryption
• More efficient commitments from structured lattice assumptions
• New bounds in some transference theorems in the geometry of numbers
• On lattices, learning with errors, random linear codes, and cryptography
• On the Security of Dynamic Group Signatures: Preventing Signature Hijacking
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Public-key cryptosystems from the worst-case shortest vector problem
• Revocable Group Signature Schemes with Constant Costs for Signing and Verifying
• Scalable group signatures with revocation
• Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
• Topics in Cryptology – CT-RSA 2005
• Topics in Cryptology – CT-RSA 2005
• Toward practical group encryption
• Traceable group encryption
• Trapdoors for hard lattices and new cryptographic constructions
• Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
• Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption

Cited in

(5)

• Ideal dynamic threshold multi-secret data sharing in smart environments for sustainable cities
• 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

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)