Compact Group Signatures Without Random Oracles
From MaRDI portal
Publication:3593110
DOI10.1007/11761679_26zbMath1140.94327OpenAlexW1496914902MaRDI QIDQ3593110
Publication date: 24 September 2007
Published in: Advances in Cryptology - EUROCRYPT 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11761679_26
Related Items (38)
A scalable post-quantum hash-based group signature ⋮ Structure-preserving signatures and commitments to group elements ⋮ Generic Framework for Attribute-Based Group Signature ⋮ Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions ⋮ Skipping the \(q\) in group signatures ⋮ Efficient Distributed Tag-Based Encryption and Its Application to Group Signatures with Efficient Distributed Traceability ⋮ Batch verification of short signatures ⋮ Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions ⋮ Towards Certificate-Based Group Encryption ⋮ Anonymous yet Traceable Strong Designated Verifier Signature ⋮ A novel lightweight decentralized attribute-based signature scheme for social co-governance ⋮ Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs ⋮ Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials ⋮ Efficient traceable signatures in the standard model ⋮ Finding composite order ordinary elliptic curves using the Cocks-Pinch method ⋮ Group-oriented fair exchange of signatures ⋮ Foundations of fully dynamic group signatures ⋮ Proxy Re-signatures in the Standard Model ⋮ Fully Anonymous Group Signatures Without Random Oracles ⋮ Group Encryption ⋮ Several cryptographic applications of \(\Sigma\)-protocol ⋮ Identity-based quotable ring signature ⋮ Unlinkable Randomizable Signature and Its Application in Group Signature ⋮ Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis ⋮ Signatures in hierarchical certificateless cryptography: efficient constructions and provable security ⋮ Optimised Versions of the Ate and Twisted Ate Pairings ⋮ Attribute-Based Signatures ⋮ Sub-linear Size Traceable Ring Signatures without Random Oracles ⋮ Practical Short Signature Batch Verification ⋮ Identity-Based Group Encryption ⋮ A lattice-based fully dynamic group signature scheme without NIZK ⋮ 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 ⋮ Identity Based Group Signatures from Hierarchical Identity-Based Encryption ⋮ Efficient Traceable Signatures in the Standard Model ⋮ Using abelian varieties to improve pairing-based cryptography ⋮ Survey of Lattice-Based Group Signature
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Weil pairing, and its efficient calculation
- Quasi-Efficient Revocation of Group Signatures
- Perfect Non-interactive Zero Knowledge for NP
- Group Signatures
- Hierarchical ID-Based Cryptography
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Group Signatures with Efficient Concurrent Join
- Advances in Cryptology - CRYPTO 2003
- Group Signatures: Better Efficiency and New Theoretical Aspects
- Topics in Cryptology – CT-RSA 2005
- Theory of Cryptography
- Non-interactive Zaps and New Techniques for NIZK
This page was built for publication: Compact Group Signatures Without Random Oracles