Unbalanced private set intersection cardinality protocol with low communication cost

Space/time trade-offs in hash coding with allowable errors

Burton H. Bloom · Communications of the ACM · 1970 · 7.4K citations · Full text

Engineering, Computational Factors, Verification +19

Universally composable security: a new paradigm for cryptographic protocols

Ran Canetti · 2001 · 3.2K citations

Composable Security, Novel Paradigm, Cryptographic Primitive +15

Probabilistic encryption

Shafi Goldwasser, Silvio Micali · Journal of Computer and System Sciences · 1984 · 2.5K citations

An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)

S.C. Pohlig, Martin E. Hellman · IEEE Transactions on Information Theory · 1978 · 1.2K citations

Theory and Practice of Bloom Filters for Distributed Systems

Sasu Tarkoma, Christian Esteve Rothenberg, Eemil Lagerspetz · IEEE Communications Surveys & Tutorials · 2011 · 517 citations

Cluster Computing, Engineering, Network Analysis +16