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

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
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
Foundations of fully dynamic group signatures
Accountable tracing signatures from lattices
Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
Asymptotically efficient lattice-based digital signatures
A Provably Secure Group Signature Scheme from Code-Based Assumptions
Toward Practical Group Encryption
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
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
Faster 2-Regular Information-Set Decoding
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
Provably Secure Group Signature Schemes From Code-Based Assumptions
Fully homomorphic encryption using ideal lattices
A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
Advances in Cryptology - EUROCRYPT 2004
Group Encryption
On Ideal Lattices and Learning with Errors over Rings
Traceable Group Encryption
Progress in Cryptology – Mycrypt 2005
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
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