DEPARTMENT:
Departments
ACM for the Public Good
The ACM 4.0 Initiative aims to lay the foundations of ACM for the next 25 years on issues of service to society and to ACM members, ACM membership, ACM finances, and internal processes.
Moshe Y. Vardi
Page 5
DEPARTMENT:
Career Paths in Computing
A Career Built on Using Technology to Help Others
Everyone deserves the access and opportunity to have a good and fulfilling life. Technologies can only contribute toward this goal when they are designed from an understanding of what makes a life good for the people concerned …
Jules Maitland
Page 7
DEPARTMENT:
[email protected]
Securing Data for Business Telephones
Cybersecurity consultant Alex Tray looks at potential security issues, and solutions, for business telephone systems.
Alex Tray
Pages 8-9
COLUMN:
News
AlphaFold Spreads through Protein Science
Based on machine learning, DeepMind's code now lies at the heart of a variety of protein-structure tools and workflows. It may ultimately be replaced by models that are bigger but faster.
Chris Edwards
Pages 10-12
Locking Down Secure Open Source Software
Can even secure open source software ever be considered truly safe?
Neil Savage
Pages 13-14
Women in Computer Science Are Making Strides
Computer science is still not a level playing field for those women who majored in it and choose to pursue it as a career.
Esther Shein
Pages 15-17
COLUMN:
Law and Technology
Do the Right Thing
Exploring the intersection of legal compliance and ethical judgment.
Kendra Albert, James Grimmelmann
Pages 18-20
COLUMN:
Security
Updates, Threats, and Risk Management
Revisiting a recent column considering security updates.
Steve Lipner, John Pescatore
Pages 21-23
COLUMN:
Education
Putting a Teaspoon of Programming into Other Subjects
Using teaspoon languages to integrate programming across myriad academic disciplines.
Mark Guzdial, Emma Dodoo, Bahare Naimpour, Tamara Nelson-Fromm, Aadarsh Padiyath
Pages 24-26
COLUMN:
Viewpoint
Ethics as a Participatory and Iterative Process
Facilitating ethical reflection, inquiry, and deliberation.
Marc Steen
Pages 27-29
Please Report Your Compute
Seeking consistent means of measure.
Jaime Sevilla, Anson Ho, Tamay Besiroglu
Pages 30-32
Long-Term Mentoring for Computer Science Researchers
Reaching out across computer science research communities.
Emily Ruppel, Sihang Liu, Elba Garza, Sukyoung Ryu, Alexandra Silva, Talia Ringer
Pages 33-35
NSF on Chien's Grand Challenge for Sustainability
This Viewpoint focuses on ways the computing community can contribute broadly to environmental sustainability and identifies NSF Directorate for Computer and Information Science and Engineering research programs supporting these …
Nina Amla, Dilma Da Silva, Michael Littman, Manish Parashar
Pages 36-37
SECTION:
Practice
Reinventing Backend Subsetting at Google
Designing an algorithm with reduced connection churn that could replace deterministic subsetting.
Peter Ward, Paul Wankadia, Kavita Guliani
Pages 40-47
Research for Practice: The Fun in Fuzzing
The debugging technique comes into its own.
Stefan Nagy
Pages 48-50
SECTION:
Contributed Articles
From Code Complexity Metrics to Program Comprehension
Understanding code depends not only on the code but also on the brain.
Dror G. Feitelson
Pages 52-61
Development Use Cases for Semantics-Driven Modeling Languages
Choosing underlying semantic theories and definition techniques must closely follow intended use cases for the modeling language.
Manfred Broy, Bernhard Rumpe
Pages 62-71
SECTION:
Review Articles
Unlocking the Potential of Fully Homomorphic Encryption
Exploring the transformational potential of FHE and the path toward adoption of its "stack."
Shruthi Gorantala, Rob Springer, Bryant Gipson
Pages 72-81
Disentangling Hype from Practicality: On Realistically Achieving Quantum Advantage
What are the promising applications to realize quantum advantage?
Torsten Hoefler, Thomas Häner, Matthias Troyer
Pages 82-87
SECTION:
Research Highlights
Technical Perspective: Finding Connections between One-Way Functions and Kolmogorov Complexity
"Toward Basing Cryptography on the Hardness of EXP," by Yanyi Liu and Rafael Pass, establishes surprisingly tight bidirectional connections between one-way functions and the cross-domain notion of Kolmogorov complexity.
Gil Segev
Page 90
Toward Basing Cryptography on the Hardness of EXP
We show that the only "gap" toward getting (infinitely-often) OWFs from the assumption that EXP ≠ BPP is the seemingly "minor" technical gap between two-sided error and errorless average-case hardness of the MKtP problem.
Yanyi Liu, Rafael Pass
Pages 91-99
COLUMN:
Last Byte
ChatGPT, Can You Tell Me a Story?
An exercise in challenging the true creativity of generative AI.
Ralph Raiola
Pages 104-ff