Group encryption with oblivious traceability
From MaRDI portal
Cites work
- \textsf{ReSolveD}: shorter signatures from regular syndrome decoding and VOLE-in-the-head
- A code-based group signature scheme
- A framework for practical anonymous credentials from lattices
- A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
- A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
- A new paradigm for public key identification
- A provably secure group signature scheme from code-based assumptions
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Attribute-based signatures
- Automata, Languages and Programming
- Bifurcated signatures: folding the accountability vs. anonymity dilemma into a single private signing scheme
- Code-based zero-knowledge from VOLE-in-the-head and their applications: simpler, faster, and smaller
- Commitments and efficient zero-knowledge proofs from learning parity with noise
- Dual support decomposition in the head: shorter signatures from Rank SD and MinRank
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Foundations of fully dynamic group signatures
- Fully dynamic attribute-based signatures for circuits from codes
- Group Encryption
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Group encryption: non-interactive realization in the standard model
- Group Signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 4037759 (Why is no real title available?)
- scientific article; zbMATH DE number 1952906 (Why is no real title available?)
- scientific article; zbMATH DE number 2009983 (Why is no real title available?)
- scientific article; zbMATH DE number 2081064 (Why is no real title available?)
- Lattice signature with efficient protocols, application to anonymous credentials
- Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy
- Mediated traceable anonymous encryption
- Multimodal private signatures
- New code-based privacy-preserving cryptographic constructions
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- One tree to rule them all: optimizing GGM trees and OWFs for post-quantum signatures
- P-signatures and Noninteractive Anonymous Credentials
- Perfect Non-interactive Zero Knowledge for NP
- Policy-based signature scheme from lattices
- Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
- Semantic security for the McEliece cryptosystem without random oracles
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Structure-preserving signatures from standard assumptions, revisited
- The hardness of LPN over any integer ring and field for PCG applications
- The Knowledge Complexity of Interactive Proof Systems
- The syzygy distinguisher
- Theory of Cryptography
- Topics in Cryptology – CT-RSA 2005
- Toward practical group encryption
- Traceable group encryption
- Traceable policy-based signatures and instantiation from lattices
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
- 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 with oblivious traceability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7390930)
