Efficient Traceable Signatures in the Standard Model

DOI10.1007/978-3-642-03298-1_13MaRDI QIDQ3392912zbMATH OpenOpenAlexFDO

Authors Benoît Libert, Moti 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

zbMATH Keywords

anonymitystandard modeltraceable signatures

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Efficient traceable signatures in the standard model
• Advances in Cryptology - EUROCRYPT 2004
• Real traceable signatures
• Traceable Signature: Better Efficiency and Beyond
• Traceable Signature with Stepping Capabilities

Cites work

• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Compact Group Signatures Without Random Oracles
• Dynamic fully anonymous short group signatures
• Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings
• Efficient Identity-Based Encryption Without Random Oracles
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Expressive Subgroup Signatures
• Fair Traceable Multi-Group Signatures
• Full-Domain Subgroup Hiding and Constant-Size Group Signatures
• Fully Anonymous Group Signatures Without Random Oracles
• Group Signatures
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• scientific article; zbMATH DE number 176566 (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 2086700 (Why is no real title available?)
• Information Security and Privacy
• Non-interactive Zaps and New Techniques for NIZK
• P-signatures and Noninteractive Anonymous Credentials
• Perfect NIZK with Adaptive Soundness
• Perfect Non-interactive Zero Knowledge for NP
• Progress in Cryptology – Mycrypt 2005
• Randomizable Proofs and Delegatable Anonymous Credentials
• Sequential Aggregate Signatures and Multisignatures Without Random Oracles
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
• The random oracle methodology, revisited.
• Theory of Cryptography
• Topics in Cryptology – CT-RSA 2005
• Traceable Signature: Better Efficiency and Beyond

Cited in

(14)

• New forward-secure signature schemes with untrusted update
• Sound and complete computational interpretation of symbolic hashes in the standard model
• Stronger security notions for decentralized traceable attribute-based signatures and more efficient constructions
• Traceable identity-based group signature
• A traceable scheme for anonymous signature
• Traceable Signature: Better Efficiency and Beyond
• Fair Traceable Multi-Group Signatures
• Real traceable signatures
• A code-based group signature scheme
• A practical group signature scheme based on rank metric
• Advances in Cryptology - EUROCRYPT 2004
• Practical Time Capsule Signatures in the Standard Model from Bilinear Maps
• Information Security
• Efficient traceable signatures in the standard model

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 Q3392912)