Fully dynamic attribute-based signatures for circuits from codes
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1618050 (Why is no real title available?)
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1162684 (Why is no real title available?)
- scientific article; zbMATH DE number 1942413 (Why is no real title available?)
- scientific article; zbMATH DE number 2081086 (Why is no real title available?)
- 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 identification scheme based on syndrome decoding
- A new paradigm for public key identification
- A provably secure group signature scheme from code-based assumptions
- Accountable tracing signatures from lattices
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- An equivalence between attribute-based signatures and homomorphic signatures, and new constructions for both
- Asymptotically efficient lattice-based digital signatures
- Attribute-based signatures
- Attribute-based signatures for circuits from bilinear map
- Attribute-based signatures for unbounded circuits in the ROM and efficient instantiations from lattices
- Attribute-based signatures for unbounded languages from standard assumptions
- Attribute-based signatures from RSA
- Attribute-based signatures with user-controlled linkability
- Better zero-knowledge proofs for lattice encryption and their application to group signatures
- Bicameral and auditably private signatures
- Code-based signatures from new proofs of knowledge for the syndrome decoding problem
- Commitments and efficient zero-knowledge proofs from learning parity with noise
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Decentralized attribute-based signatures
- Decentralized traceable attribute-based signatures
- Durandal: a rank metric based signature scheme
- Efficient attribute-based signatures for non-monotone predicates in the standard model
- Efficient attribute-based signatures for unbounded arithmetic branching programs
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Faster 2-regular information-set decoding
- Foundations of fully dynamic group signatures
- Foundations of fully dynamic group signatures
- Fully dynamic attribute-based signatures for circuits from codes
- Functional signatures and pseudorandom functions
- Group Signatures
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Group signatures with almost-for-free revocation
- Hierarchical Attribute-Based Signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
- Lattice signatures without trapdoors
- Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
- Low-complexity cryptographic hash functions
- Mesh Signatures
- Multimodal private signatures
- New code-based privacy-preserving cryptographic constructions
- Non-interactive zero-knowledge proofs in the quantum random oracle model
- On lattices, learning with errors, random linear codes, and cryptography
- Policy-Based Signatures
- Policy-based signature scheme from lattices
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Progress in Cryptology – Mycrypt 2005
- Provably Secure Code-Based Threshold Ring Signatures
- Provably Secure Group Signature Schemes From Code-Based Assumptions
- Random oracles in a quantum world
- Revocable attribute-based signatures with adaptive security in the standard model
- Revocable hierarchical attribute-based signatures from lattices
- Scalable group signatures with revocation
- Secure Stern Signatures in Quantum Random Oracle Model
- Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature
- Short signatures from regular syndrome decoding in the head
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Syndrome decoding in the head: shorter signatures from zero-knowledge proofs
- The Knowledge Complexity of Interactive Proof Systems
- Trapdoors for hard lattices and new cryptographic constructions
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
- 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 proofs for committed symmetric Boolean functions
- Zero-knowledge protocols for the McEliece encryption
Cited in
(3)
This page was built for publication: Fully dynamic attribute-based signatures for circuits from codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635745)
