Back to News
quantum-computing

How Can We Build More Trustworthy Computing? Three NTT Research Papers at IEEE FOCS 2026 Advance Randomness, Quantum Software Protection, and Succinct Cryptography

milan5167a05619
Loading...
8 min read
0 likes
⚡ Quantum Brief
In a theoretical oracle model, this paper shows how an ordinary classical computer can protect a broad class of quantum programs, allowing the protected software to be shared as ordinary digital files and executed on quantum computers. Three NTT Research Papers at IEEE FOCS 2026 Advance Randomness, Quantum Software Protection, and Succinct Cryptography appeared first on NTT Research, Inc.. Research addresses three basic trust questions: Are random numbers genuine? By pursuing fundamental breakthroughs and collaborating with leading researchers worldwide, the Lab works to establish the scientific foundations for trustworthy computing and information protection.
AI Audio Summary
0:00 / 0:00
Click to play
page-006-object-005.webp
Quantum News · Media Library

Research addresses three basic trust questions: Are random numbers genuine? Can valuable quantum software remain protected? Can advanced cryptographic tools avoid unnecessary padding? SUMMARY: NTT Research scientists are advancing three foundations for trustworthy computing: certified randomness, protected quantum software, and more succinct cryptographic methods. SUNNYVALE, Calif., November 8, 2026 — NTT Research, the Silicon Valley research arm of NTT, Inc., a global technology and business solutions provider serving more than 75% of the Fortune Global 100 and investing billions of dollars annually in research and development, announced today that scientists from the NTT Research Cryptography & Information Security (CIS) Lab contributed to three papers accepted at the 67th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2026). The conference takes place November 8–11, 2026, at the NYU Kimmel Center for University Life in New York City. Quantum computers may become extremely powerful, but that power has limited value unless people can verify that the results are correct and the systems are secure. Their random numbers must be unpredictable, valuable software must run without exposing its design, and advanced cryptographic tools must avoid unnecessary padding that makes them larger and less efficient. These papers advance the mathematical foundations required to establish that trust. While they present foundational research rather than new products, future computing technologies depend on the questions they address. The papers were developed with researchers from the University of Illinois Urbana-Champaign, the University of California, Berkeley, Columbia University, MIT CSAIL, the University of Washington, and Johns Hopkins University. Together, they focus on certified randomness, quantum program protection, publicly verifiable quantum computation, and more succinct cryptographic tools. “People should not have to understand quantum physics to trust a quantum system. They should be able to know its random numbers are genuine, its programs are protected, and its results can be verified,” said Brent Waters, Director of the NTT Research Cryptography & Information Security (CIS) Lab and Professor of Computer Science at the University of Texas at Austin. “These papers tackle the mathematics needed to make that kind of trust possible before quantum computing becomes widely used.” Trustworthy Computing Needs Strong Security Foundations Cryptography is the hidden machinery that protects online banking, private messages, medical records, and digital identities. Quantum computing could eventually perform certain calculations that are impractical for today’s computers, but it also creates new security and verification challenges. At the same time, some advanced cryptographic constructions rely on extra padding that prevents them from becoming succinct. The three papers examine mathematical tools for certifying randomness, protecting quantum programs, and removing this barrier to more efficient cryptography.

Why It Matters Every strong digital lock depends on unpredictable numbers. Companies also need ways to protect valuable software, users need evidence that remote computation produced the right answer, and advanced cryptographic tools must remain compact enough to scale. If computing systems cannot meet those basic tests, their power will be difficult to use safely in finance, healthcare, government, cloud services, and other sensitive settings.

Why Now Quantum computing is still developing, which makes this the right time to establish its security foundations. Cryptography is also advancing toward more powerful tools whose parameters can become impractically large when security proofs require extra padding. Addressing both challenges before systems are widely deployed helps build trust and efficiency into the foundation instead of adding them later.

Research Highlights How to Prove a Number Is Random Paper: Certified Randomness without Structure Against Shallow-Query AdversariesEvery digital lock depends on unpredictable random numbers. Quantum computers could become powerful sources of trusted randomness, but only if they can prove the numbers are genuinely unpredictable and have not been manipulated. This paper strengthens a method for certifying quantum-generated randomness. It proves security without relying on any unproven conjectures, for a class of limited-depth attacks. The result is a step toward randomness that others can independently trust. Authors:Dakshita Khurana — NTT Research Cryptography & Information Security (CIS) Lab and University of Illinois Urbana-ChampaignBhaskar Roberts — NTT Research Cryptography & Information Security (CIS) Lab and University of California, BerkeleyAvishay Tal — University of California, Berkeley How Can the Secret Recipe Inside Quantum Software Be Protected? Paper: Classical Obfuscation of Quantum Circuits via Publicly-Verifiable QFHEProgram obfuscation is the digital equivalent of placing software inside a locked box: the program still works, but its internal design is harder to inspect. In a theoretical oracle model, this paper shows how an ordinary classical computer can protect a broad class of quantum programs, allowing the protected software to be shared as ordinary digital files and executed on quantum computers. It also develops a form of quantum fully homomorphic encryption (QFHE) that supports encrypted computation and allows anyone to verify that the computation was performed correctly without revealing the private data. Together, the findings could help shape future ways to protect proprietary quantum algorithms and make outsourced quantum computation more trustworthy. Authors:James Bartusek — Columbia UniversityAparna Gupte — MIT CSAILSaachi Mutreja — Columbia UniversityOmri Shmueli — NTT Research Cryptography & Information Security (CIS) Lab How to Prove Security Without Hidden Costs: Removing Padding from Cryptography Paper: Overcoming Padding in Cryptography via Hardness of Certifying Random StringsIn theoretical cryptography, proving that a scheme is secure sometimes requires the scheme to be larger than it needs to be. Extra space is added purely so that the proof goes through; it plays no role in what the scheme actually does. The paper calls this “superfluous padding” and shows that it is surprisingly common. It is also a real cost: the padding prevents cryptographic tools from becoming succinct, because the size of the scheme ends up growing with the size of the inputs it handles. The researchers present a framework for eliminating this padding by establishing a new connection between cryptography and proof complexity, the study of how hard mathematical statements are to prove. The key observation is that any attacker able to exploit the missing padding could be turned into an efficient method for certifying that a given string is incompressible, meaning it cannot be described more briefly than by writing it out. Almost every string has this property, but verifying it for a specific string is widely conjectured to be hard. Under this assumption, the framework yields more succinct versions of several advanced cryptographic tools, including program obfuscation, witness encryption, succinct non-interactive arguments, and multi-input functional encryption. The result opens a path toward cryptographic systems that retain strong security without carrying size overhead that exists only to satisfy a proof. Authors:Yao-Ching Hsieh — University of WashingtonAbhishek Jain — NTT Research Cryptography & Information Security (CIS) Lab and Johns Hopkins UniversityJiatu Li — MITSurya Mathialagan — NTT Research Cryptography & Information Security (CIS) Lab About the NTT Research Cryptography & Information Security (CIS) Lab The NTT Research Cryptography & Information Security (CIS) Lab invents the future of foundational cryptography to enhance security and privacy for all. Its research spans advanced encryption, attribute-based encryption, secure multiparty computation, zero-knowledge proofs, program obfuscation, quantum cryptography, and post-quantum security. By pursuing fundamental breakthroughs and collaborating with leading researchers worldwide, the Lab works to establish the scientific foundations for trustworthy computing and information protection. About FOCS 2026 The 67th Annual IEEE Symposium on Foundations of Computer Science is sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing. FOCS 2026 takes place November 8–11 at the NYU Kimmel Center for University Life in New York City and is co-located with the Theory of Cryptography Conference (TCC 2026). About NTT Research NTT Research is the Silicon Valley research arm of NTT, one of the world’s largest technology and business solutions providers. Founded in 2019, NTT Research invents the future of foundational science while accelerating its real-world impact across NTT’s global ecosystem. As part of NTT, Inc., a global enterprise with more than $90 billion in annual revenue, serving more than 75% of the Fortune Global 100 and investing billions of dollars annually in research and development, NTT Research is uniquely positioned to carry deep science from the lab to global-scale deployment. From its headquarters in Sunnyvale, California, NTT Research brings together world-class scientists across four research pillars: the NTT Research Physics & Informatics (PHI) Lab, the NTT Research Cryptography & Information Security (CIS) Lab, the NTT Research Biomedical Engineering Innovation (MEI) Lab, and the NTT Research Physics of Artificial Intelligence (PAI) Lab. Their work advances fields that define the next era of optical computing, photonics, next-generation cryptography, biodigital twins to enable precision medicine, and the physics of AI to better understand how intelligence works. Through its annual NTT Research Upgrade conference and its technology incubator, Scale Academy, NTT Research accelerates the path from discovery to application, transforming fundamental research into technologies that solve real-world problems across industries. ### The names NTT and NTT Research, as well as the NTT and NTT Research logos, are trademarks and service marks of NTT, Inc., NTT Research, Inc., or their respective affiliates, as applicable. All other referenced product names are trademarks of their respective owners. © 2026 NTT Research, Inc. Contacts NTT Research ContactChris ShawChief Marketing OfficerNTT Research+1 312-888-5412chris.shaw@ntt-research.comMedia ContactCara MilanAMP Marketing and PRFor NTT Research+1 415-792-2968cara@amppublicrelations.com The post How Can We Build More Trustworthy Computing? Three NTT Research Papers at IEEE FOCS 2026 Advance Randomness, Quantum Software Protection, and Succinct Cryptography appeared first on NTT Research, Inc..

Read Original

Tags

quantum-software

Source Information

Source: NTT Research – Quantum Lab

Discussion

0 professional contributions

Sign in to join this professional discussion.

Be the first to add a constructive contribution.