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_18zbMath1370.94515MaRDI QIDQ2946483
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
Related Items
Attribute based tracing for securing group signatures against centralized authorities, Foundations of fully dynamic group signatures, Stronger Security Notions for Decentralized Traceable Attribute-Based Signatures and More Efficient Constructions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pairings for cryptographers
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Breaking ‘128-bit Secure’ Supersingular Binary Curves
- Dynamic Fully Anonymous Short Group Signatures
- Scalable Group Signatures with Revocation
- On the Security of Dynamic Group Signatures: Preventing Signature Hijacking
- Group Signatures with Almost-for-Free Revocation
- How to share a secret
- Public-Key Encryption with Non-Interactive Opening: New Constructions and Stronger Definitions
- Groth–Sahai Proofs Revisited
- Structure-Preserving Signatures and Commitments to Group Elements
- Get Shorty via Group Signatures without Encryption
- Compact Group Signatures Without Random Oracles
- Fair Traceable Multi-Group Signatures
- Group Signatures
- Efficient Noninteractive Proof Systems for Bilinear Groups
- Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions
- Group Signatures with Message-Dependent Opening
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Group Signatures with Efficient Concurrent Join
- Fully Anonymous Group Signatures Without Random Oracles
- A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings
- Information Security and Privacy
- Security in Communication Networks
- Group Signatures: Better Efficiency and New Theoretical Aspects
- Topics in Cryptology – CT-RSA 2005
- Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures
- Full-Domain Subgroup Hiding and Constant-Size Group Signatures
- Theory of Cryptography
