<--- Back to Details
First PageDocument Content
Information retrieval / Information science / Perfect hash function / Hash function / Hash table / Universal hashing / Bloom filter / Trie / Linear hashing / Hashing / Search algorithms / Artificial intelligence
Date: 2007-10-26 13:18:17
Information retrieval
Information science
Perfect hash function
Hash function
Hash table
Universal hashing
Bloom filter
Trie
Linear hashing
Hashing
Search algorithms
Artificial intelligence

Add to Reading List

Source URL: homepages.dcc.ufmg.br

Download Document from Source Website

File Size: 212,33 KB

Share Document on Facebook

Similar Documents

Cryptography / Public-key cryptography / Ciphertext indistinguishability / ID-based encryption / Chosen-plaintext attack / RSA / Ciphertext / Proxy re-encryption / Homomorphic encryption / XTR / Key encapsulation / Semantic security

Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange David Derler1 , Kai Gellert2 , Tibor Jager2 , Daniel Slamanig3 , and Christoph Striecks3 1 Graz University of Technology

DocID: 1xVie - View Document

Cryptography / Computing / Internet / Internet protocols / Public-key cryptography / Transport Layer Security / Secure communication / Cryptographic protocols / QUIC / Transmission Control Protocol / Forward secrecy

Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange David Derler‡ , Tibor Jagerk , Daniel Slamanig§ , Christoph Striecks§ May 3, 2018—Eurocrypt 2018, Tel Aviv, Israel

DocID: 1xV7Y - View Document

Improving Bloom filter performance on sequence data using k-mer Bloom filters David Pellow1? , Darya Filippova2 , and Carl Kingsford2?? 1 The Blavatnik School of Computer Science, Tel Aviv University, Tel Aviv 69978, Is

DocID: 1vcxL - View Document

Cryptography / Computing / Internet / Internet protocols / Transport Layer Security / Secure communication / Internet Standards / QUIC / Transmission Control Protocol / Forward secrecy

Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange David Derler‡ , Tibor Jagerk , Daniel Slamanig§ , Christoph Striecks§ January 12, 2018—RWC 2018, Zurich, Switzerland

DocID: 1uxHv - View Document

Hierarchical Bloom Filter Trees for Approximate Matching

DocID: 1uvQT - View Document