Publication

Cryptographically verifiable data structure having multi-hop forward and backwards links and associated systems and methods

Bryan Alexander Ford, Philipp Svetolik Jovanovic, Linus Gasser, Eleftherios Kokoris Kogias
2018
Patents

Abstract

Data storage and retrieval systems, methods, and computer-readable media utilize a cryptographically verifiable data structure that facilitates verification of a transaction in a decentralized peer-to-peer environment using multi-hop backwards and forwards links. Backward links are cryptographic hashes of past records. Forward links are cryptographic signatures of future records that are added retroactively to records once the target block has been appended to the data structure.

Official source

https://infoscience.epfl.ch/entities/publication/1826bdf1-dfeb-40e3-acc2-0c875e6825fd

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Cryptographically verifiable data structure having multi-hop forward and backwards links and associated systems and methods

Chat with Graph Search

On the Theory and Practice of Modern Secure Messaging

Differentially private multi-agent constraint optimization

Side-channel analysis of isogeny-based key encapsulation mechanisms and hash-based digital signatures