May 2023 - Vol. 66 No. 5
Features
A Career Built on Using Technology to Help Others
Securing Data for Business Telephones
AlphaFold Spreads through Protein Science
Locking Down Secure Open Source Software
Women in Computer Science Are Making Strides
Updates, Threats, and Risk Management
Putting a Teaspoon of Programming into Other Subjects
Ethics as a Participatory and Iterative Process
Long-Term Mentoring for Computer Science Researchers
NSF on Chien’s Grand Challenge for Sustainability
Reinventing Backend Subsetting at Google
From Code Complexity Metrics to Program Comprehension
Understanding code depends not only on the code but also on the brain.
Development Use Cases for Semantics-Driven Modeling Languages
Unlocking the Potential of Fully Homomorphic Encryption
Disentangling Hype from Practicality: On Realistically Achieving Quantum Advantage
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.
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.
ChatGPT, Can You Tell Me a Story?