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

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 2081086 (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?)
scientific article; zbMATH DE number 1440063 (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
Accountable tracing signatures from lattices
Adaptive oblivious transfer with access control from lattice assumptions
Advances in Cryptology - EUROCRYPT 2004
Asymptotically efficient lattice-based digital signatures
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
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Efficient implementation of a CCA2-secure variant of McEliece using generalized Srivastava codes
Faster 2-regular information-set decoding
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
Low-complexity cryptographic hash functions
Mediated traceable anonymous encryption
Minimum disclosure proofs of knowledge
New code-based privacy-preserving cryptographic constructions
On ideal lattices and learning with errors over rings
On lattices, learning with errors, random linear codes, and cryptography
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
Progress in Cryptology – Mycrypt 2005
Provably Secure Code-Based Threshold Ring Signatures
Provably Secure Group Signature Schemes From Code-Based Assumptions
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
The hardness of LPN over any integer ring and field for PCG applications
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

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 Q6564029)