Short Redactable Signatures Using Random Trees
From MaRDI portal
Recommendations
- Redactable signatures for independent removal of structure and content
- Redactable signatures for tree-structured data: definitions and constructions
- A t-out-of-n Redactable Signature Scheme
- A general framework for redactable signatures and new constructions
- A Storage Efficient Redactable Signature in the Standard Model
Cites work
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 1263180 (Why is no real title available?)
- scientific article; zbMATH DE number 2079931 (Why is no real title available?)
- scientific article; zbMATH DE number 2079932 (Why is no real title available?)
- scientific article; zbMATH DE number 1759660 (Why is no real title available?)
- scientific article; zbMATH DE number 1406782 (Why is no real title available?)
- Directed Transitive Signature Scheme
- Extended Sanitizable Signatures
- Information and Communications Security
- Secure Hash-and-Sign Signatures Without the Random Oracle
- The continuum random tree. III
Cited in
(9)- Computing on authenticated data
- Redactable graph hashing, revisited (extended abstract)
- Redactable signatures for tree-structured data: definitions and constructions
- Identity-based quotable ring signature
- Zero-Knowledge Authenticated Order Queries and Order Statistics on a List
- A Storage Efficient Redactable Signature in the Standard Model
- Redactable signatures for independent removal of structure and content
- Efficient redactable signature and application to anonymous credentials
- Verifiable zero-knowledge order queries and updates for fully dynamic lists and trees
This page was built for publication: Short Redactable Signatures Using Random Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3623041)