Lightweight Selective Disclosure for Verifiable Documents on Blockchain

03/13/2021
by   Kenji Saito, et al.
0

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.

READ FULL TEXT

page 3

page 5

research
06/09/2021

Verification of a Merkle Patricia Tree Library Using F*

A Merkle tree is a data structure for representing a key-value store as ...
research
10/28/2022

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

A key bottleneck in building automatic extraction models for visually ri...
research
10/12/2020

Constant-delay enumeration algorithms for document spanners over nested documents

Some of the most relevant document schemas used online, such as XML and ...
research
08/03/2021

CanvasVAE: Learning to Generate Vector Graphic Documents

Vector graphic documents present visual elements in a resolution free, c...
research
10/18/2019

A Practical Approach to expressing digitally signed documents

Initially developed and considered for providing authentication and inte...
research
05/15/2018

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...
research
09/06/2023

Synthetic Text Generation using Hypergraph Representations

Generating synthetic variants of a document is often posed as text-to-te...

Please sign up or login with your details

Forgot password? Click here to reset