Group encryption: full dynamicity, message filtering and code-based instantiation
From MaRDI portal
(Redirected from Publication:2061981)
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
Cites work
- scientific article; zbMATH DE number 1618037 (Why is no real title available?)
- scientific article; zbMATH DE number 1618050 (Why is no real title available?)
- scientific article; zbMATH DE number 4037759 (Why is no real title available?)
- scientific article; zbMATH DE number 1942413 (Why is no real title available?)
- scientific article; zbMATH DE number 2009983 (Why is no real title available?)
- scientific article; zbMATH DE number 2081087 (Why is no real title available?)
- scientific article; zbMATH DE number 1394309 (Why is no real title available?)
- A CCA2 Secure Variant of the McEliece Cryptosystem
- A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
- A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
- A code-based group signature scheme
- A code-based linkable ring signature scheme
- A new paradigm for public key identification
- A provably secure group signature scheme from code-based assumptions
- Advances in Cryptology - EUROCRYPT 2004
- Automata, Languages and Programming
- Better zero-knowledge proofs for lattice encryption and their application to group signatures
- Commitments and efficient zero-knowledge proofs from learning parity with noise
- Efficient implementation of a CCA2-secure variant of McEliece using generalized Srivastava codes
- Foundations of fully dynamic group signatures
- Fully homomorphic encryption using ideal lattices
- Group Encryption
- Group Signatures
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Group encryption: non-interactive realization in the standard model
- Group signatures with almost-for-free revocation
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
- Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
- Mediated traceable anonymous encryption
- Minimum disclosure proofs of knowledge
- New code-based privacy-preserving cryptographic constructions
- On lattices, learning with errors, random linear codes, and cryptography
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Provably Secure Code-Based Threshold Ring Signatures
- Revocable Group Signature Schemes with Constant Costs for Signing and Verifying
- Scalable group signatures with revocation
- Semantic security for the McEliece cryptosystem without random oracles
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- The Knowledge Complexity of Interactive Proof Systems
- Topics in Cryptology – CT-RSA 2005
- Toward practical group encryption
- Traceable group encryption
- 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
- Zero-knowledge protocols for the McEliece encryption
Cited in
(10)- Code-based zero-knowledge from VOLE-in-the-head and their applications: simpler, faster, and smaller
- Zero-knowledge proofs for committed symmetric Boolean functions
- Interactively secure groups from obfuscation
- Group encryption: full dynamicity, message filtering and code-based instantiation
- 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
- Group encryption: non-interactive realization in the standard model
- Fully dynamic attribute-based signatures for circuits from codes
- 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)
