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

Source URL: eprint.iacr.org

• 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 Derler‡ , Tibor Jagerk , Daniel Slamanig§ , Christoph Striecks§ May 3, 2018—Eurocrypt 2018, Tel Aviv, Israel

Source URL: david.derler.info

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

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

Source URL: cs.tau.ac.il

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

Source URL: rwc.iacr.org

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

Hierarchical Bloom Filter Trees for Approximate Matching

Source URL: markscanlon.co

A Model for Learned Bloom Filters and Related Structures Michael Mitzenmacher1 Abstract— Recent work has suggested enhancing Bloom filters by using a pre-filter, based on applying machine learning to model the data set

Source URL: www.eecs.harvard.edu

Forwarding Anomalies in Bloom Filter Based Multicast Mikko S¨arel¨a, Christian Esteve Rothenberg, Tuomas Aura, Andras Zahemszky, Pekka Nikander, and J¨org Ott Abstract—Several recently proposed multicast protocols u

Source URL: pdfs.semanticscholar.org

PROGRAMMING Cuckoo Filter: Better Than Bloom B I N FA N , DAV I D G . A N D E R S E N , A N D M I C H A E L K A M I N S K Y Bin Fan is a Ph.D. student in the

Source URL: www.cs.cmu.edu

Cuckoo Filter: Practically Better Than Bloom Bin Fan, David G. Andersen, Michael Kaminsky† , Michael D. Mitzenmacher‡ Carnegie Mellon University, † Intel Labs, ‡ Harvard University {binfan,dga}@cs.cmu.edu, michae

Source URL: www.cs.cmu.edu

Cache-, Hash- and Space-Efficient Bloom Filters FELIX PUTZE, PETER SANDERS and JOHANNES SINGLER Universit¨at Karlsruhe A Bloom filter is a very compact data structure that supports approximate membership queries on a se

Source URL: algo2.iti.kit.edu