Group encryption: full dynamicity, message filtering and code-based instantiation

DOI10.1007/978-3-030-75248-4_24zbMATH Open1479.94235OpenAlexW3165430365MaRDI QIDQ2061981FDOQ2061981

Authors: Hoa Nguyen, Willy Susilo, Huaxiong Wang, Yanhong Xu, Neng Zeng, Reihaneh Safavi-Naini 

Publication date: 21 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-75248-4_24

Recommendations

• Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy
• Toward practical group encryption
• Group-based cryptography
• Group Encryption
• Dynamic group key exchange revisited
• scientific article; zbMATH DE number 6403891
• Traceable group encryption
• Interactively secure groups from obfuscation
• A convertible multi-authenticated encryption scheme for group communications
• Publicly Verifiable Privacy-Preserving Group Decryption

zbMATH Keywords

random oracle modelfully dynamic group encryptionmessage filtering

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Fully homomorphic encryption using ideal lattices
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimum disclosure proofs of knowledge
• Title not available (Why is that?)
• A CCA2 Secure Variant of the McEliece Cryptosystem
• Title not available (Why is that?)
• On lattices, learning with errors, random linear codes, and cryptography
• Scalable group signatures with revocation
• Group signatures with almost-for-free revocation
• Group encryption: non-interactive realization in the standard model
• Group Signatures
• Title not available (Why is that?)
• Topics in Cryptology – CT-RSA 2005
• The Knowledge Complexity of Interactive Proof Systems
• A new paradigm for public key identification
• Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
• A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
• Title not available (Why is that?)
• Semantic security for the McEliece cryptosystem without random oracles
• A provably secure group signature scheme from code-based assumptions
• Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
• A code-based group signature scheme
• Advances in Cryptology - EUROCRYPT 2004
• A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
• Provably Secure Code-Based Threshold Ring Signatures
• 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
• Better zero-knowledge proofs for lattice encryption and their application to group signatures
• A code-based linkable ring signature scheme
• Commitments and efficient zero-knowledge proofs from learning parity with noise
• 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
• Efficient implementation of a CCA2-secure variant of McEliece using generalized Srivastava codes
• Title not available (Why is that?)
• Foundations of fully dynamic group signatures
• New code-based privacy-preserving cryptographic constructions
• Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
• Zero-knowledge protocols for the McEliece encryption
• Revocable Group Signature Schemes with Constant Costs for Signing and Verifying

Cited In (9)

• Zero-knowledge proofs for committed symmetric Boolean functions
• Group encryption: full dynamicity, message filtering and code-based instantiation
• Interactively secure groups from obfuscation
• Group encryption: full dynamicity, message filtering and code-based instantiation
• Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy
• Group public key encryption supporting equality test without bilinear pairings
• Fully dynamic attribute-based signatures for circuits from codes
• Group encryption: non-interactive realization in the standard model
• Efficient code-based fully dynamic group signature scheme

This page was built for publication: Group encryption: full dynamicity, message filtering and code-based instantiation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2061981)