Group encryption: full dynamicity, message filtering and code-based instantiation
From MaRDI portal
Publication:2061981
DOI10.1007/978-3-030-75248-4_24zbMath1479.94235OpenAlexW3165430365MaRDI QIDQ2061981
Willy Susilo, Huaxiong Wang, Khoa Nguyen, Neng Zeng, Yanhong Xu, Reihaneh Safavi-Naini
Publication date: 21 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-75248-4_24
Related Items
Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy ⋮ Group public key encryption supporting equality test without bilinear pairings ⋮ Efficient code-based fully dynamic group signature scheme ⋮ Group encryption: full dynamicity, message filtering and code-based instantiation ⋮ Zero-knowledge proofs for committed symmetric Boolean functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A code-based group signature scheme
- Semantic security for the McEliece cryptosystem without random oracles
- Minimum disclosure proofs of knowledge
- A code-based linkable ring signature scheme
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Group encryption: full dynamicity, message filtering and code-based instantiation
- New code-based privacy-preserving cryptographic constructions
- Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
- A Provably Secure Group Signature Scheme from Code-Based Assumptions
- Foundations of Fully Dynamic Group Signatures
- Toward Practical Group Encryption
- Scalable Group Signatures with Revocation
- Efficient Implementation of a CCA2-Secure Variant of McEliece Using Generalized Srivastava Codes
- Zero-Knowledge Protocols for the McEliece Encryption
- Group Signatures with Almost-for-Free Revocation
- Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- A CCA2 Secure Variant of the McEliece Cryptosystem
- A new paradigm for public key identification
- A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
- Mediated Traceable Anonymous Encryption
- Revocable Group Signature Schemes with Constant Costs for Signing and Verifying
- Group Encryption: Non-interactive Realization in the Standard Model
- Provably Secure Code-Based Threshold Ring Signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The Knowledge Complexity of Interactive Proof Systems
- Group Signatures
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
- Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
- Fully homomorphic encryption using ideal lattices
- A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
- Advances in Cryptology - EUROCRYPT 2004
- Group Encryption
- Traceable Group Encryption
- Topics in Cryptology – CT-RSA 2005
- Automata, Languages and Programming
- Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
- On lattices, learning with errors, random linear codes, and cryptography
