Log In Sign Up

Lightweight Selective Disclosure for Verifiable Documents on Blockchain

by   Kenji Saito, et al.

To achieve lightweight selective disclosure for protecting privacy of document holders, we propose an XML format for documents that can hide arbitrary elements using a cryptographic hash function and salts, which allows to be partially digitally signed and efficiently verified, as well as a JSON format that can be converted to such XML. The documents can be efficiently proven to exist by representing multiple such structures as a Merkle tree and storing its root in blockchain. We show that our proposal has advantages over known methods that represent the document itself as a Merkle tree and partially hide it.


page 3

page 5


Verification of a Merkle Patricia Tree Library Using F*

A Merkle tree is a data structure for representing a key-value store as ...

Radically Lower Data-Labeling Costs for Visually Rich Document Extraction Models

A key bottleneck in building automatic extraction models for visually ri...

Constant-delay enumeration algorithms for document spanners over nested documents

Some of the most relevant document schemas used online, such as XML and ...

CanvasVAE: Learning to Generate Vector Graphic Documents

Vector graphic documents present visual elements in a resolution free, c...

A Practical Approach to expressing digitally signed documents

Initially developed and considered for providing authentication and inte...

Corpus Conversion Service: A machine learning platform to ingest documents at scale [Poster abstract]

Over the past few decades, the amount of scientific articles and technic...