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

Cites Work

Fully homomorphic encryption using ideal lattices
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
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
Title not available (Why is that?)
Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
On ideal lattices and learning with errors over rings
A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
Progress in Cryptology – Mycrypt 2005
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
Provably Secure Group Signature Schemes From Code-Based Assumptions
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
Title not available (Why is that?)
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?)
Low-complexity cryptographic hash functions
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
Asymptotically efficient lattice-based digital signatures
Faster 2-regular information-set decoding
Foundations of fully dynamic group signatures
Accountable tracing signatures from lattices
Adaptive oblivious transfer with access control from lattice assumptions
The hardness of LPN over any integer ring and field for PCG applications

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)