Efficient Traceable Signatures in the Standard Model
From MaRDI portal
Publication:3392912
DOI10.1007/978-3-642-03298-1_13zbMath1248.94108MaRDI QIDQ3392912
Benoît Libert, Mordechai M. Yung
Publication date: 18 August 2009
Published in: Pairing-Based Cryptography – Pairing 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03298-1_13
94A62: Authentication, digital signatures and secret sharing
Related Items
A Practical Group Signature Scheme Based on Rank Metric, A code-based group signature scheme, Efficient traceable signatures in the standard model, New forward-secure signature schemes with untrusted update
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic Fully Anonymous Short Group Signatures
- The random oracle methodology, revisited
- Randomizable Proofs and Delegatable Anonymous Credentials
- Expressive Subgroup Signatures
- Perfect Non-interactive Zero Knowledge for NP
- Compact Group Signatures Without Random Oracles
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- Perfect NIZK with Adaptive Soundness
- Traceable Signature: Better Efficiency and Beyond
- Fair Traceable Multi-Group Signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Group Signatures
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Fully Anonymous Group Signatures Without Random Oracles
- Advances in Cryptology - CRYPTO 2003
- P-signatures and Noninteractive Anonymous Credentials
- Efficient Non-interactive Proof Systems for Bilinear Groups
- 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
- Progress in Cryptology – Mycrypt 2005
- Topics in Cryptology – CT-RSA 2005
- Theory of Cryptography
- Full-Domain Subgroup Hiding and Constant-Size Group Signatures
- Non-interactive Zaps and New Techniques for NIZK