An r-hiding revocable group signature scheme: group signatures with the property of hiding the number of revoked users
From MaRDI portal
Publication:2336893
Summary: If there are many displaced workers in a company, then a person who goes for job hunting might not select this company. That is, the number of members who quit is quite negative information. Similarly, in revocable group signature schemes, if one knows (or guesses) the number of revoked users (say \(r)\), then one may guess the reason behind such circumstances, and it may lead to harmful rumors. However, no previous revocation procedure can achieve hiding \(r\). In this paper, we propose the first revocable group signature scheme, where \(r\) is kept hidden, which we call \(r\)-hiding revocable group signature. To handle this property, we newly define the security notion called anonymity with respect to the revocation which guarantees the unlinkability of revoked users.
Recommendations
- A revocable group signature scheme with the property of hiding the number of revoked users
- scientific article; zbMATH DE number 2239283
- A revocable group signature scheme from identity-based revocation techniques: achieving constant-size revocation list
- Quasi-Efficient Revocation of Group Signatures
- Scalable group signatures with revocation
Cites work
- A Group Signature Scheme from Lattice Assumptions
- A revocable group signature scheme with the property of hiding the number of revoked users
- Advances in Cryptology – CRYPTO 2004
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- An anonymous designated verifier signature scheme with revocation: how to protect a company's reputation
- Anonymous broadcast encryption: adaptive security and efficient constructions in the standard model
- Attribute-based signatures
- Building Key-Private Public-Key Encryption Schemes
- Constant-Size Dynamic k-TAA
- Decentralized attribute-based signatures
- Dynamic attribute based group signature with attribute anonymity and tracing in the standard model
- Dynamic fully anonymous short group signatures
- Efficient attribute-based signatures for non-monotone predicates in the standard model
- Efficient group signatures in the standard model
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Efficient Proofs for CNF Formulas on Attributes in Pairing-Based Anonymous Credential System
- Fair Traceable Multi-Group Signatures
- Forward-Secure Group Signatures from Pairings
- Full-Domain Subgroup Hiding and Constant-Size Group Signatures
- Fully Anonymous Group Signatures Without Random Oracles
- Fully forward-secure group signatures
- Fully secure attribute-based systems with short ciphertexts/signatures and threshold access structures
- Get shorty via group signatures without encryption
- Group Signatures
- Group signatures with almost-for-free revocation
- Group Signatures with Efficient Concurrent Join
- Group signatures with message-dependent opening
- Group signatures with message-dependent opening in the standard model
- Group Signatures with Verifier-Local Revocation and Backward Unlinkability in the Standard Model
- Hidden attribute-based signatures without anonymity revocation
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 2009983 (Why is no real title available?)
- scientific article; zbMATH DE number 1842485 (Why is no real title available?)
- scientific article; zbMATH DE number 1408383 (Why is no real title available?)
- Identity Based Group Signatures from Hierarchical Identity-Based Encryption
- Information and Communications Security
- Information Security and Privacy
- Information Security and Privacy
- Lattice-based group signature scheme with verifier-local revocation
- Lattice-based group signatures with logarithmic signature size
- On the Security of Dynamic Group Signatures: Preventing Signature Hijacking
- On the Theoretical Gap between Group Signatures with and without Unlinkability
- Outsider-anonymous broadcast encryption with sublinear ciphertexts
- Public-Key Encryption with Non-interactive Opening
- Revocable Group Signature Schemes with Constant Costs for Signing and Verifying
- Robust Encryption
- Scalable group signatures with revocation
- Short attribute-based signatures for threshold predicates
- Short pairing-efficient threshold-attribute-based signature
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Structure-preserving signatures and commitments to group elements
- Threshold Attribute-Based Signatures and Their Application to Anonymous Credential Systems
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Topics in Cryptology – CT-RSA 2005
- Topics in Cryptology – CT-RSA 2005
- Verifier-Local Revocation Group Signature Schemes with Backward Unlinkability from Bilinear Maps
Cited in
(4)- Efficient traceable ring signature scheme without pairings
- A revocable group signature scheme with the property of hiding the number of revoked users
- An anonymous designated verifier signature scheme with revocation: how to protect a company's reputation
- A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Implementation
This page was built for publication: An \(r\)-hiding revocable group signature scheme: group signatures with the property of hiding the number of revoked users
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2336893)
