Unlinkable Randomizable Signature and Its Application in Group Signature

DOI10.1007/978-3-540-79499-8_26MaRDI QIDQ3600344zbMATH OpenOpenAlexFDO

Authors Sujing Zhou, Dongdai Lin

Publication date 10 February 2009

Published in Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-79499-8_26

zbMATH Keywords

Digital SignatureGroup SignatureRandomizable SignatureSigma-protocol

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Group signature without random oracles from randomizable signatures
• scientific article; zbMATH DE number 1305483
• On the Theoretical Gap between Group Signatures with and without Unlinkability
• Formalizing group blind signatures and practical constructions without random oracles
• Fully Anonymous Group Signatures Without Random Oracles

Cites work

• scientific article; zbMATH DE number 4191103 (Why is no real title available?)
• scientific article; zbMATH DE number 1302792 (Why is no real title available?)
• scientific article; zbMATH DE number 1031000 (Why is no real title available?)
• scientific article; zbMATH DE number 1088250 (Why is no real title available?)
• scientific article; zbMATH DE number 1952906 (Why is no real title available?)
• scientific article; zbMATH DE number 1759783 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology – CRYPTO 2004
• Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
• Compact Group Signatures Without Random Oracles
• Efficient Identity-Based Encryption Without Random Oracles
• Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings
• Foundations of Cryptography
• Full-Domain Subgroup Hiding and Constant-Size Group Signatures
• Group Signatures with Efficient Concurrent Join
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• On Signatures of Knowledge
• Security arguments for digital signatures and blind signatures
• Shorter Verifier-Local Revocation Group Signatures from Bilinear Maps
• Topics in Cryptology – CT-RSA 2005

Cited in

(6)

• Group signature scheme based on verifiable random number
• Efficient signatures on randomizable ciphertexts
• Efficient and Perfectly Unlinkable Sanitizable Signatures without Group Signatures
• On the Theoretical Gap between Group Signatures with and without Unlinkability
• One-time delegation of unlinkable signing rights and its application
• Unlinkable policy-based sanitizable signatures

This page was built for publication: Unlinkable Randomizable Signature and Its Application in Group Signature

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600344)