Redactable graph hashing, revisited (extended abstract)

DOI10.1007/978-3-319-59870-3_24zbMATH Open1426.94095OpenAlexW2617360815MaRDI QIDQ2014639FDOQ2014639

Authors: Andreas Erwig, Marc Fischlin, Martin Hald, Dominik Helm, Robert Kiel, Florian Kübler, Michael Kümmerlin, Jakob Laenge, Felix Rohrbach 

Publication date: 25 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-59870-3_24

Recommendations

• Redactable signatures for independent removal of structure and content
• Redactable signatures for tree-structured data: definitions and constructions
• Rethinking privacy for extended sanitizable signatures and a black-box construction of strongly private schemes
• A general framework for redactable signatures and new constructions
• Short Redactable Signatures Using Random Trees

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Data structures (68P05)

This page was built for publication: Redactable graph hashing, revisited (extended abstract)

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