Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJune 2023
- columnMay 2022
- research-articleMarch 2021
Succinct range filters
- Huanchen Zhang,
- Hyeontaek Lim,
- Viktor Leis,
- David G. Andersen,
- Michael Kaminsky,
- Kimberly Keeton,
- Andrew Pavlo
Communications of the ACM (CACM), Volume 64, Issue 4April 2021, Pages 166–173https://doi.org/10.1145/3450262We present the Succinct Range Filter (SuRF), a fast and compact data structure for approximate membership tests. Unlike traditional Bloom filters, SuRF supports both single-key lookups and common range queries, such as range counts. SuRF is based on a ...
- articleMarch 2021
-
- research-articleMarch 2021
The worsening state of ransomware
Communications of the ACM (CACM), Volume 64, Issue 4April 2021, Pages 15–17https://doi.org/10.1145/3449054Sophisticated, dangerous ransomware is the new normal … and there is no simple fix.
- research-articleNovember 2020
The life of a data byte
Communications of the ACM (CACM), Volume 63, Issue 12December 2020, Pages 38–45https://doi.org/10.1145/3410625Be kind and rewind.
- research-articleMarch 2016
More encryption means less privacy
Communications of the ACM (CACM), Volume 59, Issue 4April 2016, Pages 40–42https://doi.org/10.1145/2890774Retaining electronic privacy requires more political engagement.
- research-articleMay 2014
The NSA and Snowden: securing the all-seeing eye
Communications of the ACM (CACM), Volume 57, Issue 5May 2014, Pages 44–51https://doi.org/10.1145/2594502How good security at the NSA could have stopped him.
- research-articleMay 2014
Cloud security: a gathering storm
Communications of the ACM (CACM), Volume 57, Issue 5May 2014, Pages 70–79https://doi.org/10.1145/2593686Users' trust in cloud systems is undermined by the lack of transparency in existing security policies.
- research-articleMarch 2014
Trends in steganography
Communications of the ACM (CACM), Volume 57, Issue 3March 2014, Pages 86–95https://doi.org/10.1145/2566590.2566610Methods for embedding secret data are more sophisticated than their ancient predecessors, but the basic principles remain unchanged.
- research-articleMarch 2014
Big-data applications in the government sector
Communications of the ACM (CACM), Volume 57, Issue 3March 2014, Pages 78–85https://doi.org/10.1145/2500873In the same way businesses use big data to pursue profits, governments use it to promote the public good.
- newsJanuary 2014
French team invents faster code-breaking algorithm
Communications of the ACM (CACM), Volume 57, Issue 1January 2014, Pages 21–23https://doi.org/10.1145/2555807New method can crack certain cryptosystems far faster than earlier alternatives.
- newsNovember 2013
Future-proof encryption
Communications of the ACM (CACM), Volume 56, Issue 11November 2013, Pages 12–14https://doi.org/10.1145/2524713.2524718Researchers are relying on quantum mechanics to generate unhackable methods of communication.
- departmentJune 2013
Q&A: Cracking the code
Communications of the ACM (CACM), Volume 56, Issue 6June 2013, Pages 120–ffhttps://doi.org/10.1145/2461256.2461281Turing Award recipients Shafi Goldwasser and Silvio Micali talk about proofs, probability, and poker.
- departmentJune 2013
Proofs probable
Communications of the ACM (CACM), Volume 56, Issue 6June 2013, Pages 22–24https://doi.org/10.1145/2461256.2461265Shafi Goldwasser and Silvio Micali laid the foundations for modern cryptography, with contributions including interactive and zero-knowledge proofs.
- research-articleNovember 2012
Functional encryption: a new vision for public-key cryptography
Communications of the ACM (CACM), Volume 55, Issue 11November 2012, Pages 56–64https://doi.org/10.1145/2366316.2366333Decryption keys allow users to learn a specific function of the encrypted data and nothing else.
- departmentAugust 2012
DARPA Shredder challenge solved
Communications of the ACM (CACM), Volume 55, Issue 8August 2012, Pages 16–17https://doi.org/10.1145/2240236.2240242The eight-person winning team used original computer algorithms to narrow the search space and then relied on human observation to move the pieces into their final positions.
- research-articleJune 2011
10 rules for scalable performance in 'simple operation' datastores
Communications of the ACM (CACM), Volume 54, Issue 6June 2011, Pages 72–80https://doi.org/10.1145/1953122.1953144Partition data and operations, keep administration simple, do not assume one size fits all.
- departmentApril 2011
The quest for randomness
Communications of the ACM (CACM), Volume 54, Issue 4April 2011, Pages 13–15https://doi.org/10.1145/1924421.1924427It's not easy to generate a string of numbers that lack any pattern or rule, or even to define exactly what randomness means.