Efficient traceable signatures in the standard model

DOI10.1016/J.TCS.2010.12.066zbMath1256.94072OpenAlexW2047705244MaRDI QIDQ631785

Benoît Libert, Mordechai M. 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

zbMATH Keywords

standard modelanonymitytraceable signatures

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

Revocable Attribute-Based Signatures with Adaptive Security in the Standard Model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Security arguments for digital signatures and blind signatures
• Dynamic Fully Anonymous Short Group Signatures
• The random oracle methodology, revisited
• Randomizable Proofs and Delegatable Anonymous Credentials
• Efficient Traceable Signatures in the Standard Model
• Expressive Subgroup Signatures
• Batch Groth–Sahai
• 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
• Programmable Hash Functions and Their Applications
• Fair Traceable Multi-Group Signatures
• Real Traceable Signatures
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Group Signatures
• Advances in Cryptology - EUROCRYPT 2004
• 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
• A Closer Look at PKI: Security and Efficiency
• Non-interactive Zaps and New Techniques for NIZK

This page was built for publication: Efficient traceable signatures in the standard model