Efficient traceable signatures in the standard model
From MaRDI portal
Publication:631785
DOI10.1016/J.TCS.2010.12.066zbMATH Open1256.94072OpenAlexW2047705244MaRDI QIDQ631785FDOQ631785
Authors: Benoît Libert, Moti Yung 
Publication date: 14 March 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.066
Recommendations
Cites Work
- Theory of Cryptography
- Security arguments for digital signatures and blind signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Title not available (Why is that?)
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Identity-Based Encryption Without Random Oracles
- The random oracle methodology, revisited.
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Compact Group Signatures Without Random Oracles
- Perfect NIZK with Adaptive Soundness
- Real traceable signatures
- Group Signatures
- Title not available (Why is that?)
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- 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
- Topics in Cryptology – CT-RSA 2005
- Full-Domain Subgroup Hiding and Constant-Size Group Signatures
- Randomizable Proofs and Delegatable Anonymous Credentials
- A Closer Look at PKI: Security and Efficiency
- Non-interactive Zaps and New Techniques for NIZK
- Perfect Non-interactive Zero Knowledge for NP
- Title not available (Why is that?)
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- Title not available (Why is that?)
- Information Security and Privacy
- Programmable Hash Functions and Their Applications
- Dynamic fully anonymous short group signatures
- Efficient Traceable Signatures in the Standard Model
- Advances in Cryptology - EUROCRYPT 2004
- Expressive Subgroup Signatures
- Batch Groth-Sahai
- Traceable Signature: Better Efficiency and Beyond
- Fair Traceable Multi-Group Signatures
- Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings
- Progress in Cryptology – Mycrypt 2005
Cited In (10)
- Information Security
- Traceable Signature: Better Efficiency and Beyond
- Practical Time Capsule Signatures in the Standard Model from Bilinear Maps
- Efficient Traceable Signatures in the Standard Model
- Time-Specific Signatures
- Revocable attribute-based signatures with adaptive security in the standard model
- Sound and complete computational interpretation of symbolic hashes in the standard model
- Real traceable signatures
- Stronger security notions for decentralized traceable attribute-based signatures and more efficient constructions
- Advances in Cryptology - EUROCRYPT 2004
This page was built for publication: Efficient traceable signatures in the standard model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q631785)
