Efficient distributed tag-based encryption and its application to group signatures with efficient distributed traceability
From MaRDI portal
Publication:2946483
DOI10.1007/978-3-319-16295-9_18zbMATH Open1370.94515OpenAlexW754953234MaRDI QIDQ2946483FDOQ2946483
Authors: Essam Ghadafi
Publication date: 17 September 2015
Published in: Progress in Cryptology - LATINCRYPT 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-16295-9_18
Recommendations
Cites Work
- Short signatures without random oracles and the SDH assumption in bilinear groups
- How to share a secret
- A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
- Public-key encryption with non-interactive opening: new constructions and stronger definitions
- Theory of Cryptography
- Pairings for cryptographers
- Scalable group signatures with revocation
- Group signatures with almost-for-free revocation
- Structure-preserving signatures and commitments to group elements
- Compact Group Signatures Without Random Oracles
- Group Signatures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
- 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
- Efficient noninteractive proof systems for bilinear groups
- Breaking `128-bit secure' supersingular binary curves. (Or how to solve discrete logarithms in \({\mathbb F}_{2^{4 \cdot 1223}}\) and \({\mathbb F}_{2^{12 \cdot 367}}\))
- Title not available (Why is that?)
- Information Security and Privacy
- Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures
- Dynamic fully anonymous short group signatures
- Advances in Cryptology - EUROCRYPT 2004
- Fair Traceable Multi-Group Signatures
- Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings
- Title not available (Why is that?)
- Group signatures with message-dependent opening
- Get shorty via group signatures without encryption
- Group Signatures: Better Efficiency and New Theoretical Aspects
- Groth–Sahai Proofs Revisited
- Security in Communication Networks
- On the Security of Dynamic Group Signatures: Preventing Signature Hijacking
Cited In (5)
- Foundations of fully dynamic group signatures
- Efficient democratic group signatures with threshold traceability
- Short group signatures with distributed traceability
- Stronger security notions for decentralized traceable attribute-based signatures and more efficient constructions
- Attribute based tracing for securing group signatures against centralized authorities
This page was built for publication: Efficient distributed tag-based encryption and its application to group signatures with efficient distributed traceability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946483)