Short Redactable Signatures Using Random Trees

DOI10.1007/978-3-642-00862-7_9zbMath1237.94107OpenAlexW1493718049MaRDI QIDQ3623041

Chee Liang Lim, Jia Xu, Ee-Chien Chang

Publication date: 29 April 2009

Published in: Topics in Cryptology – CT-RSA 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00862-7_9

zbMATH Keywords

privacyrandom treeredactable signature scheme

Mathematics Subject Classification ID

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

Related Items (5)

Identity-based quotable ring signature ⋮ Zero-Knowledge Authenticated Order Queries and Order Statistics on a List ⋮ Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees ⋮ A Storage Efficient Redactable Signature in the Standard Model ⋮ Computing on authenticated data

Cites Work

• The continuum random tree. III
• Secure Hash-and-Sign Signatures Without the Random Oracle
• Extended Sanitizable Signatures
• Directed Transitive Signature Scheme
• Information and Communications Security
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Short Redactable Signatures Using Random Trees