Redactable signatures for tree-structured data: definitions and constructions
From MaRDI portal
Recommendations
Cited in
(21)- Identity-based quotable ring signature
- Efficient digital signatures from RSA without random oracles
- Redactable graph hashing, revisited (extended abstract)
- Efficient redactable signature and application to anonymous credentials
- Unlinkable and invisible \(\gamma \)-sanitizable signatures
- Dissemination of authenticated tree-structured data with privacy protection and fine-grained control in outsourced databases
- Computing on authenticated data
- Zero-Knowledge Authenticated Order Queries and Order Statistics on a List
- A general framework for redactable signatures and new constructions
- Verifiable zero-knowledge order queries and updates for fully dynamic lists and trees
- Redactable signatures for independent removal of structure and content
- A t-out-of-n Redactable Signature Scheme
- Short Redactable Signatures Using Random Trees
- Drawing bobbin lace graphs, or, fundamental cycles for a subclass of periodic graphs
- Efficient completely context-hiding quotable and linearly homomorphic signatures
- Ring trapdoor redactable signatures from lattice
- On updatable redactable signatures
- Chameleon-hashes with ephemeral trapdoors and applications to invisible sanitizable signatures
- Protean Signature Schemes
- Quotable signatures for authenticating shared quotes
- SoK: signatures with randomizable keys
This page was built for publication: Redactable signatures for tree-structured data: definitions and constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575039)