<--- Back to Details
First PageDocument Content
Cryptography / Information retrieval / Search algorithms / Information science / Hashing / Error detection and correction / Hash function / Cryptographic hash function / RSA
Date: 2013-10-10 06:48:57
Cryptography
Information retrieval
Search algorithms
Information science
Hashing
Error detection and correction
Hash function
Cryptographic hash function
RSA

Efficient Negative Databases from Cryptographic Hash Functions George Danezis, Claudia Diaz, Sebastian Faust, Emilia K¨asper, Carmela Troncoso, and Bart Preneel K.U. Leuven, ESAT/COSIC, Kasteelpark Arenberg 10,

Add to Reading List

Source URL: www0.cs.ucl.ac.uk

Download Document from Source Website

File Size: 266,08 KB

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