Efficient distributed tag-based encryption and its application to group signatures with efficient distributed traceability
From MaRDI portal
Publication:2946483
Recommendations
Cites work
- scientific article; zbMATH DE number 1302792 (Why is no real title available?)
- scientific article; zbMATH DE number 1088250 (Why is no real title available?)
- scientific article; zbMATH DE number 2009983 (Why is no real title available?)
- scientific article; zbMATH DE number 1759783 (Why is no real title available?)
- A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- 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}}\))
- Compact Group Signatures Without Random Oracles
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Dynamic fully anonymous short group signatures
- Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings
- Efficient noninteractive proof systems for bilinear groups
- Fair Traceable Multi-Group Signatures
- Full-Domain Subgroup Hiding and Constant-Size Group Signatures
- Fully Anonymous Group Signatures Without Random Oracles
- Get shorty via group signatures without encryption
- Groth–Sahai Proofs Revisited
- Group Signatures
- Group Signatures with Efficient Concurrent Join
- Group Signatures: Better Efficiency and New Theoretical Aspects
- Group signatures with almost-for-free revocation
- Group signatures with message-dependent opening
- How to share a secret
- Information Security and Privacy
- On the Security of Dynamic Group Signatures: Preventing Signature Hijacking
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
- Pairings for cryptographers
- Public-key encryption with non-interactive opening: new constructions and stronger definitions
- Scalable group signatures with revocation
- Security in Communication Networks
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Structure-preserving signatures and commitments to group elements
- Theory of Cryptography
- Topics in Cryptology – CT-RSA 2005
- Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures
Cited in
(5)- Foundations of fully dynamic group signatures
- Attribute based tracing for securing group signatures against centralized authorities
- Efficient democratic group signatures with threshold traceability
- Stronger security notions for decentralized traceable attribute-based signatures and more efficient constructions
- Short group signatures with distributed traceability
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)
