<--- Back to Details
First PageDocument Content
Hashing / Cryptographic hash function / Trie / Merkle tree / RSA / B-tree
Date: 2015-01-11 00:33:17
Hashing
Cryptographic hash function
Trie
Merkle tree
RSA
B-tree

VeriStream – A Framework for Verifiable Data Streaming Dominique Sch¨oder and Mark Simkin Saarland University Saarbr¨ ucken, Germany

Add to Reading List

Source URL: fc15.ifca.ai

Download Document from Source Website

File Size: 3,08 MB

Share Document on Facebook

Similar Documents

MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity Martin Albrecht1 , Lorenzo Grassi3 , Christian Rechberger2,3 , Arnab Roy2 , and Tyge Tiessen2 1

MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity Martin Albrecht1 , Lorenzo Grassi3 , Christian Rechberger2,3 , Arnab Roy2 , and Tyge Tiessen2 1

DocID: 1xUN2 - View Document

Introduction to Locality-Sensitive Hashing Tyler NeylonFormats: html | pdf | kindle pdf] Locality-sensitive hashing (LSH) is a set of techniques that

Introduction to Locality-Sensitive Hashing Tyler NeylonFormats: html | pdf | kindle pdf] Locality-sensitive hashing (LSH) is a set of techniques that

DocID: 1xTR9 - View Document

Proceedings: Equality and Hashing for (Almost) Free: Generating Implementations from Abstraction Functions

Proceedings: Equality and Hashing for (Almost) Free: Generating Implementations from Abstraction Functions

DocID: 1xTdH - View Document