Foundations of fully dynamic group signatures
From MaRDI portal
Publication:2822669
DOI10.1007/978-3-319-39555-5_7zbMATH Open1346.94141OpenAlexW2483112678MaRDI QIDQ2822669FDOQ2822669
Authors: Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Essam Ghadafi, Jens Groth 
Publication date: 4 October 2016
Published in: Applied Cryptography and Network Security (Search for Journal in Brave)
Full work available at URL: https://discovery.ucl.ac.uk/id/eprint/10115738/
Recommendations
Cites Work
- Title not available (Why is that?)
- Topics in Cryptology – CT-RSA 2005
- Scalable group signatures with revocation
- Group signatures with almost-for-free revocation
- Compact Group Signatures Without Random Oracles
- Group Signatures with Verifier-Local Revocation and Backward Unlinkability in the Standard Model
- Group Signatures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Group Signatures with Efficient Concurrent Join
- Fully Anonymous Group Signatures Without Random Oracles
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Topics in Cryptology – CT-RSA 2005
- Full-Domain Subgroup Hiding and Constant-Size Group Signatures
- Lattice-based group signature scheme with verifier-local revocation
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Protocols for Set Membership and Range Proofs
- Title not available (Why is that?)
- Information Security and Privacy
- Title not available (Why is that?)
- Public Key Cryptography - PKC 2006
- Dynamic fully anonymous short group signatures
- Advances in Cryptology - EUROCRYPT 2004
- Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings
- Title not available (Why is that?)
- Get shorty via group signatures without encryption
- Verifier-Local Revocation Group Signature Schemes with Backward Unlinkability from Bilinear Maps
- Group Signatures: Better Efficiency and New Theoretical Aspects
- Title not available (Why is that?)
- Quasi-Efficient Revocation of Group Signatures
- Foundations of fully dynamic group signatures
- Security in Communication Networks
- On the Security of Dynamic Group Signatures: Preventing Signature Hijacking
- Accumulating composites and improved group signing
- A revocable group signature scheme from identity-based revocation techniques: achieving constant-size revocation list
Cited In (29)
- Foundations of fully dynamic group signatures
- Ring signatures with user-controlled linkability
- New code-based cryptographic accumulator and fully dynamic group signature
- Real Hidden Identity-Based Signatures
- Survey of lattice-based group signature
- Post-quantum secure fully-dynamic logarithmic-size deniable group signature in code-based setting
- zk-SNARKs from codes with rank metrics
- Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease
- Topics in Cryptology – CT-RSA 2005
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy
- Issuer-hiding attribute-based credentials
- A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Implementation
- Skipping the \(q\) in group signatures
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- Fully dynamic attribute-based signatures for circuits from codes
- Progress in Cryptology – Mycrypt 2005
- Selectively linkable group signatures -- stronger security and preserved verifiability
- Efficient code-based fully dynamic group signature scheme
- A lattice-based fully dynamic group signature scheme without NIZK
- Foundations of fully dynamic group signatures
- Updatable signatures and message authentication codes
- On New Zero-Knowledge Proofs for Lattice-Based Group Signatures with Verifier-Local Revocation
- Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
- Achieving Almost-Full Security for Lattice-Based Fully Dynamic Group Signatures with Verifier-Local Revocation
- Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
- Secret handshakes: full dynamicity, deniability and lattice-based design
- Lattice-based group signatures with verifier-local revocation: achieving shorter key-sizes and explicit traceability with ease
This page was built for publication: Foundations of fully dynamic group signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2822669)
