Fully Anonymous Group Signatures Without Random Oracles
From MaRDI portal
Recommendations
Cites work
- A Closer Look at PKI: Security and Efficiency
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Compact Group Signatures Without Random Oracles
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Full-Domain Subgroup Hiding and Constant-Size Group Signatures
- Group Signatures
- Group Signatures with Efficient Concurrent Join
- Group Signatures: Better Efficiency and New Theoretical Aspects
- scientific article; zbMATH DE number 1942416 (Why is no real title available?)
- scientific article; zbMATH DE number 2009971 (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?)
- scientific article; zbMATH DE number 1775406 (Why is no real title available?)
- Information Security and Privacy
- Shorter Verifier-Local Revocation Group Signatures from Bilinear Maps
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Theory of Cryptography
- Theory of Cryptography
- Theory of Cryptography
- Topics in Cryptology – CT-RSA 2005
Cited in
(57)- Memory lower bounds of reductions revisited
- A lattice-based group signature scheme with verifier-local revocation
- Selectively linkable group signatures -- stronger security and preserved verifiability
- Skipping the \(q\) in group signatures
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions
- Foundations of fully dynamic group signatures
- 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
- An \(r\)-hiding revocable group signature scheme: group signatures with the property of hiding the number of revoked users
- Group signature without random oracles from randomizable signatures
- Practical dynamic group signatures without knowledge extractors
- The electronic cash system based on non-interactive zero-knowledge proofs
- Foundations of fully dynamic group signatures
- A lattice-based group signature scheme with message-dependent opening
- Dynamic fully anonymous short group signatures
- Plaintext-checkable encryption
- Structure-preserving signatures and commitments to group elements
- Efficient distributed tag-based encryption and its application to group signatures with efficient distributed traceability
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- A signature scheme with efficient proof of validity
- Revocable attribute-based signatures with adaptive security in the standard model
- Non-interactive confirmer signatures
- Unconditionally anonymous ring and mesh signatures
- Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures
- Efficient Traceable Signatures in the Standard Model
- Structure-preserving signatures from standard assumptions, revisited
- Short group signatures via structure-preserving signatures: standard model security from simple assumptions
- Compact Group Signatures Without Random Oracles
- Unlinkable Randomizable Signature and Its Application in Group Signature
- Ambiguous Optimistic Fair Exchange
- Anonymous Consecutive Delegation of Signing Rights: Unifying Group and Proxy Signatures
- Group-oriented fair exchange of signatures
- scientific article; zbMATH DE number 1941243 (Why is no real title available?)
- Ambiguous optimistic fair exchange: definition and constructions
- Tagged one-time signatures: tight security and optimal tag size
- A code-based group signature scheme
- A practical group signature scheme based on rank metric
- Formalizing group blind signatures and practical constructions without random oracles
- Group signatures with message-dependent opening in the standard model
- Short Group Signature Without Random Oracles
- Group Signatures: Better Efficiency and New Theoretical Aspects
- Full-Domain Subgroup Hiding and Constant-Size Group Signatures
- Real Hidden Identity-Based Signatures
- Survey of lattice-based group signature
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- An efficient identity tracing scheme for blockchain-based systems
- 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
- Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease
- TVES: threshold verifiably encrypted signature and its applications
- Module lattice based constant-size group signature with verifier local revocation and backward unlinkability
- Laconic PSI on authenticated inputs and applications
This page was built for publication: Fully Anonymous Group Signatures Without Random Oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387098)
