Decentraland: The Alleged Decentralization of Blockchain Applications
Theory
Disentangling Hype from Practicality: On Realistically Achieving Quantum Advantage
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?
Locking Down Secure Open Source Software
Updates, Threats, and Risk Management
Ethics as a Participatory and Iterative Process
Reinventing Backend Subsetting at Google
Development Use Cases for Semantics-Driven Modeling Languages
From Code Complexity Metrics to Program Comprehension
Understanding code depends not only on the code but also on the brain.
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.
Artificial Intelligence for Materials Discovery
Contracting for Artificial Intelligence
Hoping for the Best as AI Evolves
Cyber Efficiency and Cyber Resilience
Where Is the Research on Cryptographic Transition and Agility?
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get InvolvedCommunications of the ACM (CACM) is now a fully Open Access publication.
By opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.
Learn More