Group encryption: full dynamicity, message filtering and code-based instantiation
From MaRDI portal
Publication:2061981
DOI10.1007/978-3-030-75248-4_24zbMATH Open1479.94235OpenAlexW3165430365MaRDI QIDQ2061981FDOQ2061981
Willy Susilo, Huaxiong Wang, Hoa Nguyen, Reihaneh Safavi-Naini, Neng Zeng, Yanhong Xu
Publication date: 21 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-75248-4_24
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Minimum disclosure proofs of knowledge
- A CCA2 Secure Variant of the McEliece Cryptosystem
- 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
- 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
- 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
- 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 (8)
- 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
- Efficient code-based fully dynamic group signature scheme
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 π π
- Title not available (Why is that?) π π
- Traceable Group Encryption π π
- Interactively secure groups from obfuscation π π
- A convertible multi-authenticated encryption scheme for group communications π π
- Publicly Verifiable Privacy-Preserving Group Decryption π π
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)