Fully Anonymous Group Signatures Without Random Oracles
From MaRDI portal
Publication:5387098
DOI10.1007/978-3-540-76900-2_10zbMath1153.94386OpenAlexW1854738139MaRDI QIDQ5387098
Publication date: 15 May 2008
Published in: Advances in Cryptology – ASIACRYPT 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-76900-2_10
Related Items (43)
Plaintext-Checkable Encryption ⋮ Structure-preserving signatures and commitments to group elements ⋮ Structure-Preserving Signatures from Standard Assumptions, Revisited ⋮ Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions ⋮ Unconditionally anonymous ring and mesh signatures ⋮ Selectively linkable group signatures -- stronger security and preserved verifiability ⋮ Skipping the \(q\) in group signatures ⋮ Memory lower bounds of reductions revisited ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ Efficient Distributed Tag-Based Encryption and Its Application to Group Signatures with Efficient Distributed Traceability ⋮ An efficient identity tracing scheme for blockchain-based systems ⋮ Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions ⋮ End-to-end secure messaging with traceability only for illegal content ⋮ Multimodal private signatures ⋮ A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Implementation ⋮ What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable? ⋮ Efficient traceable signatures in the standard model ⋮ Practical dynamic group signatures without knowledge extractors ⋮ Group-oriented fair exchange of signatures ⋮ Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions ⋮ Foundations of fully dynamic group signatures ⋮ Ambiguous optimistic fair exchange: definition and constructions ⋮ A Signature Scheme with Efficient Proof of Validity ⋮ Revocable Attribute-Based Signatures with Adaptive Security in the Standard Model ⋮ A code-based group signature scheme ⋮ A lattice-based group signature scheme with verifier-local revocation ⋮ Tagged One-Time Signatures: Tight Security and Optimal Tag Size ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ Ambiguous Optimistic Fair Exchange ⋮ The electronic cash system based on non-interactive zero-knowledge proofs ⋮ Non-interactive Confirmer Signatures ⋮ Anonymous Consecutive Delegation of Signing Rights: Unifying Group and Proxy Signatures ⋮ Foundations of Fully Dynamic Group Signatures ⋮ A Lattice-Based Group Signature Scheme with Message-Dependent Opening ⋮ Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures ⋮ Efficient Traceable Signatures in the Standard Model ⋮ Lattice-based group signatures: achieving full dynamicity (and deniability) with ease ⋮ Efficient fully structure-preserving signatures and shrinking commitments ⋮ Short tightly secure signatures for signing a vector of group elements: a new approach ⋮ Real Hidden Identity-Based Signatures ⋮ An \(r\)-hiding revocable group signature scheme: group signatures with the property of hiding the number of revoked users ⋮ Survey of Lattice-Based Group Signature ⋮ A Practical Group Signature Scheme Based on Rank Metric
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Compact Group Signatures Without Random Oracles
- Group Signatures
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Group Signatures with Efficient Concurrent Join
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Information Security and Privacy
- Group Signatures: Better Efficiency and New Theoretical Aspects
- Shorter Verifier-Local Revocation Group Signatures from Bilinear Maps
- Topics in Cryptology – CT-RSA 2005
- Full-Domain Subgroup Hiding and Constant-Size Group Signatures
- A Closer Look at PKI: Security and Efficiency
- Theory of Cryptography
- Theory of Cryptography
- Theory of Cryptography
This page was built for publication: Fully Anonymous Group Signatures Without Random Oracles
