Efficient traceable signatures in the standard model

DOI10.1016/J.TCS.2010.12.066MaRDI QIDQ631785zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

standard modelanonymitytraceable signatures

Mathematics Subject Classification ID

Cryptography (94A60) 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

• 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?)
• A Closer Look at PKI: Security and Efficiency
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Batch Groth-Sahai
• Compact Group Signatures Without Random Oracles
• Dynamic fully anonymous short group signatures
• Efficient Identity-Based Encryption Without Random Oracles
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Efficient Traceable Signatures in the Standard Model
• Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings
• 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
• 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
• Programmable Hash Functions and Their Applications
• Progress in Cryptology – Mycrypt 2005
• Randomizable Proofs and Delegatable Anonymous Credentials
• Real traceable signatures
• Security arguments for digital signatures and blind signatures
• 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

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