NTT Research’s Cryptography & Information Security (CIS) Lab and NTT Social Informatics Laboratories in collaboration with Carnegie Mellon, Stanford, and others advance research in post-quantum cryptography, zero-knowledge proofs, secure multiparty computation, attribute-based encryption and quantum security.
SUNNYVALE, Calif. and TOKYO, August 17, 2026 — 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, today announced that NTT-affiliated researchers contributed to 28 papers accepted at the International Cryptology Conference (CRYPTO) 2026, one of the world’s premier conferences for cryptographic research. The work comes from NTT Research‘s Cryptography & Information Security (CIS) Lab and NTT Social Informatics Laboratories, in collaboration with researchers from leading institutions including Carnegie Mellon University, MIT, Stanford University, Johns Hopkins University, Columbia University, The University of Texas at Austin, the University of Illinois Urbana-Champaign, Northeastern University and Technion – Israel Institute of Technology.
Together, the accepted papers address three essential questions: What new cryptographic capabilities are now possible? Why do they matter for security, privacy and trustworthy computing? And why are they urgent as organizations prepare for quantum computing, distributed data sharing, AI-driven systems and increasingly sophisticated attacks?
The research spans advanced encryption, zero-knowledge proofs, secure multiparty computation, quantum cryptography, post-quantum security, side-channel resistance, verifiable computation and machine-learning model security. Collectively, it strengthens the scientific foundations needed to protect data and computation across classical, quantum and AI-enabled systems.
“Cryptography must evolve before the systems and threats it is designed to address fully arrive. These papers deepen our understanding of what is possible, what is impossible and what must be made more efficient, from quantum security and advanced encryption to secure computation and verifiable proofs. That combination of foundational insight and practical direction is essential to building security and privacy for the next era of computing,” said Brent Waters, Director of the Cryptography & Information Security Lab at NTT Research and Professor of Computer Science at The University of Texas at Austin.
Research Highlights
Can Quantum Systems Support Anonymous Money and Verifiable Voting?
Anonymous Public-Key Quantum Money and Universally Verifiable Quantum Voting
This research explores how quantum information could enable anonymous digital money that cannot be copied and voting systems whose results can be publicly verified. The findings address growing demands for greater privacy, authenticity and public trust in digital financial and election systems.
Authors
Alper Çakan — Carnegie Mellon University
Vipul Goyal — Cryptography & Information Security (CIS) Laboratories, NTT Research; Carnegie Mellon University
Takashi Yamakawa — NTT Social Informatics Laboratories
What Happens When Adversaries Receive Multiple Copies of Quantum Information?
Multi-Copy Security in Quantum Cryptography and More
This paper examines whether quantum cryptographic protections remain secure when an adversary obtains multiple copies of the same quantum information. The research closes an important gap between single-copy security models and the more complex attacks that emerging quantum networks and applications may face.
Authors
Alper Çakan — Carnegie Mellon University
Vipul Goyal — Cryptography & Information Security (CIS) Laboratories, NTT Research; Carnegie Mellon University
Fuyuki Kitagawa — NTT Social Informatics Laboratories
Ryo Nishimaki — NTT Social Informatics Laboratories
Takashi Yamakawa — NTT Social Informatics Laboratories
Can Digital Information Be Verifiably Deleted Yet Remain Deniable?
How to Delete Without a Trace: Certified Deniability in a Quantum World
This research introduces new protections that can provide evidence that quantum information was deleted while preventing it from being recovered or used later. The work could strengthen privacy as cloud replication, persistent data storage and quantum computing make meaningful digital deletion increasingly difficult.
Authors
Alper Çakan — Carnegie Mellon University
Vipul Goyal — Cryptography & Information Security (CIS) Laboratories, NTT Research; Carnegie Mellon University
Justin Raizes — Carnegie Mellon University
How Can Attribute-Based Encryption Scale to Rich Access Policies?
Pairing-Based Registered ABE for Boolean Formulas with a Linear-Size CRS
This paper advances attribute-based encryption by supporting complex access policies while improving the scalability of the system’s setup requirements. The research could enable more precise control over sensitive data as information moves among cloud platforms, organizations, users and AI agents.
Authors
Roy Stracovsky — Georgia Institute of Technology
Brent Waters — The University of Texas at Austin; Cryptography & Information Security (CIS) Laboratories, NTT Research
David J. Wu — The University of Texas at Austin
Can Parties Compute Securely Even When Most Participants Are Dishonest?
Dishonest-Majority Secure Computation via PIR-Authenticated Multiplication Triples
This research enables multiple parties to perform computations on shared data even when most participants may be dishonest, without exposing the underlying information. The work could support safer collaboration among organizations that need to analyze sensitive data but cannot fully trust one another.
Authors
Elette Boyle — Cryptography & Information Security (CIS) Laboratories, NTT Research; Reichman University
Niv Gilboa — Ben-Gurion University of the Negev
Matan Hamilis — Reichman University
Yuval Ishai — Technion – Israel Institute of Technology
Ariel Nof — Bar-Ilan University
How Secure Are UOV-Based Post-Quantum Signature Designs Against New Algebraic Attacks?
Key Recovery Attacks on UOV Using p^l-Truncated Polynomial Rings
This paper identifies new attacks that can recover cryptographic keys from certain Unbalanced Oil and Vinegar post-quantum signature designs. The findings demonstrate why proposed quantum-resistant technologies must undergo rigorous testing before governments and businesses rely on them to protect long-lived systems and data.
Authors
Hiroki Furue — NTT Social Informatics Laboratories
Yasuhiko Ikematsu — Kyushu University
Additional Accepted Papers
The following NTT-affiliated papers were also accepted at CRYPTO 2026:
Verifiable Computation, Zero-Knowledge and Program Protection
How Can Computation Be Verified as It Progresses?
Incrementally Verifiable Computation without Extraction
Authors
Abhishek Jain — Cryptography & Information Security (CIS) Laboratories, NTT Research; Johns Hopkins University
Surya Mathialagan — Cryptography & Information Security (CIS) Laboratories, NTT Research
Brent Waters — Cryptography & Information Security (CIS) Laboratories, NTT Research; The University of Texas at Austin
Can We Build Stronger Program Obfuscation from Polynomial Hardness?
How to use Polynomially-Hard iO: Turing Machine Obfuscation and More
Authors
Jesko Dujmovic — Northeastern University
Yao-Ching Hsieh — University of Washington
Abhishek Jain — Cryptography & Information Security (CIS) Laboratories, NTT Research; Johns Hopkins University
Willy Quach — CISPA Helmholtz Center for Information Security
Can One Proof System Be Transformed into Another More Broadly?
From NIZK Arguments to ZAPs, Generically
Authors
Anish Banerjee — The University of Texas at Austin
Brent Waters — The University of Texas at Austin; Cryptography & Information Security (CIS) Laboratories, NTT Research
David J. Wu — The University of Texas at Austin
What Is the Minimum Foundation Needed for Zero-Knowledge?
Non-Trivial Zero-Knowledge Implies One-Way Functions
Authors
Suvradip Chakraborty — Visa Research
James Hulett — University of Illinois Urbana-Champaign
Dakshita Khurana — University of Illinois Urbana-Champaign; Cryptography & Information Security (CIS) Laboratories, NTT Research
Kabir Tomer — University of Illinois Urbana-Champaign
Can Succinct Proofs Remain Unique and Secure Against Adaptive Attacks?
Unique SNARGs with Adaptive Security: Constructions and Black-Box Separations
Authors
Cody Freitag — Northeastern University, Hebrew University of Jerusalem
Daniel Wichs — Northeastern University; Cryptography & Information Security (CIS) Laboratories, NTT Research
Can Error-Correcting Codes Reach the Fundamental Communication Limit Against Efficient Adversaries?
Achieving Shannon Capacity for Computationally Bounded Errors
Authors
George Lu — University of Texas at Austin
Jad Silbak — Massachusetts Institute of Technology
Daniel Wichs — Northeastern University; Cryptography & Information Security (CIS) Laboratories, NTT Research
Scalable Encryption and Digital Trust
How Can Any Number of Parties Establish Keys Without Interaction?
Adaptive NIKE for Unbounded Parties
Authors
Shafik Nassar — The University of Texas at Austin
Brent Waters — The University of Texas at Austin; Cryptography & Information Security (CIS) Laboratories, NTT Research
How Can Programmable Cryptographic Functions Enable More Powerful Garbled Computation?
Suffix-Invariant Programmable PRFs and Applications to Stacked Garbling
Authors
Vipul Goyal — Cryptography & Information Security (CIS) Laboratories, NTT Research
David Heath — University of Illinois Urbana-Champaign
Abhishek Jain — Cryptography & Information Security (CIS) Laboratories, NTT Research; Johns Hopkins University
Yibin Yang —Cryptography & Information Security (CIS) Laboratories, NTT Research
Can Privacy-Preserving Signatures Be Both Distributed and Communication-Efficient?
Round-Optimal Threshold Blind Signatures without Random Oracles
Authors
Georg Fuchsbauer — TU Wien
Fabian Regen — TU Wien
Hoeteck Wee — Cryptography & Information Security (CIS) Laboratories, NTT Research
How Can Encrypted Data Reach Unlimited Audiences Without Ciphertexts Growing Linearly?
Unbounded Broadcast and KP-ABE with Sublinear Ciphertext from Pairings
Authors
Junichi Tomida — Cryptography & Information Security (CIS) Laboratories, NTT Research
Hoeteck Wee — Cryptography & Information Security (CIS) Laboratories, NTT Research
Secure Multiparty Computation
How Can Secure Multiparty Computation Become Faster at Scale?
Fast PCGs for Batch-Authenticated Multiplication Triples
Authors
Elette Boyle — Cryptography & Information Security (CIS) Laboratories, NTT Research; Reichman University
Niv Gilboa — Ben-Gurion University
Matan Hamilis — Reichman University
Yuval Ishai — Technion – Israel Institute of Technology
Ariel Nof — Bar-Ilan University
Quantum Cryptography and Verification
How Can a Prover Demonstrate Possession of Quantum Knowledge?
A New Approach to Arguments of Quantum Knowledge
Authors
James Bartusek — Columbia University
Ruta Jawale — University of Illinois Urbana-Champaign
Justin Raizes — Cryptography & Information Security (CIS) Laboratories, NTT Research
Kabir Tomer — University of Illinois Urbana-Champaign
Can Cryptographic Information Remain Uncopyable with Realistic Quantum Memory?
Uncloneable Cryptography in Linear Quantum Memory
Authors
Andrew Huang — Massachusetts Institute of Technology
Omri Shmueli — Cryptography & Information Security (CIS) Laboratories, NTT Research
Vinod Vaikuntanathan — Massachusetts Institute of Technology
Mark Zhandry — Stanford University
Can Quantum Information Support Publicly Verifiable, Destructive Cryptographic Objects?
Public-Key Quantum Fire and Key-Fire From Classical Oracles
Authors
Alper Çakan — Carnegie Mellon University
Vipul Goyal — Cryptography & Information Security (CIS) Laboratories, NTT Research; Carnegie Mellon University
Omri Shmueli —Cryptography & Information Security (CIS) Laboratories, NTT Research
What Assumptions Are Truly Needed to Verify Quantum Computation Classically?
Authors
Mohammed Barhoush — Université de Montréal
Tomoyuki Morimae — Kyoto University
Ryo Nishimaki — NTT Social Informatics Laboratories
Takashi Yamakawa — NTT Social Informatics Laboratories
Post-Quantum and Symmetric Security
Where Do Familiar Hash Constructions Reach Their Post-Quantum Limits?
The Impossibility of Post-Quantum Public Indifferentiability for Merkle-Damgard
Authors
Akinori Hosoyamada — NTT Social Informatics Laboratories
Does HCTR2 Reliably Bind Ciphertexts to a Single Key?
Key Committing Security of HCTR2, Revisited
Authors
Donghoon Chang — FWI / NIST Associate
Yu Long Chen — KU Leuven
Yukihito Hiraga — The University of Electro-Communications
Kazuhiko Minematsu — NEC Corporation, The University of Osaka
Nicky Mouha — KeyCryptic
Yusuke Naito — Mitsubishi Electric Corporation
Yu Sasaki — NTT Social Informatics Laboratories, NIST Associate
Takeshi Sugawara — The University of Electro-Communications
Can Common Padding Choices Weaken Ascon-Based Security?
Generic Committing Attacks: Zero-Padded Ascon is Less Secure than Expected
Authors
Nilanjan Datta — Institute for Advancing Intelligence, TCG CREST
Hrithik Nandi — Institute for Advancing Intelligence, TCG CREST / Ramakrishna Mission Vivekananda Educational and Research Institute
Soumit Pal — Indian Statistical Institute
Yu Sasaki — NTT Social Informatics Laboratories, NIST Associate
Patrick Struck — University of Konstanz
Maximiliane Weishäupl — University of Regensburg
Can Cryptographic Keys Be Leased and Reliably Returned Using Quantum Information?
A Unified Approach to Quantum Key Leasing with a Classical Lessor
Authors
Fuyuki Kitagawa — NTT Social Informatics Laboratories
Jiahui Liu — Fujitsu Research
Shota Yamada — AIST
Takashi Yamakawa — NTT Social Informatics Laboratories
How Can Lattice Cryptography Better Resist Side-Channel Attacks?
Maskaglia: A New, Efficient Approach to Masked Discrete Gaussian Sampling
Authors
Calvin Abou Haidar — NTT Social Informatics Laboratories
Thomas Espitau — PQShield
Clément Hoffmann — NTT Social Informatics Laboratories
Mehdi Tibouchi — NTT Social Informatics Laboratories
Can Circular-Security Techniques Be Understood Through One Framework?
A Unifying Umbrella for Circular-Secure Cryptographic Primitives
Authors
Fuyuki Kitagawa — NTT Social Informatics Laboratories
Takahiro Matsuda — AIST
AI Model Security
How Efficient Are Cryptanalytic Model-Extraction Attacks in Practice and Theory?
Is the Hard-Label Cryptanalytic Model Extraction Really Polynomial?
Authors
Akira Ito — Tohoku University
Takayuki Miura — NTT Social Informatics Laboratories
Yosuke Todo — NTT Social Informatics Laboratories
About the 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 CIS Lab works to establish the scientific foundations for trustworthy computing and information protection.
About NTT Social Informatics Laboratories
NTT Social Informatics Laboratories conducts research to create secure, trustworthy and inclusive information systems for society. Its cryptography research includes post-quantum security, quantum cryptography, symmetric-key cryptanalysis, privacy-enhancing technologies and secure digital infrastructure designed to address emerging risks across a rapidly changing technology landscape.
About CRYPTO 2026
The International Cryptology Conference (CRYPTO) is one of the world’s leading conferences dedicated to advances in cryptography and information security. Organized by the International Association for Cryptologic Research (IACR), CRYPTO 2026 will take place August 17–20, 2026, in Santa Barbara, California. Researchers from academia and industry gather to present breakthroughs in cryptographic theory, quantum and post-quantum cryptography, secure computation, zero-knowledge, advanced encryption and related areas.
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.
From its headquarters in Sunnyvale, California, NTT Research brings together world-class scientists across four research pillars: the Physics & Informatics (PHI) Lab, the Cryptography & Information Security (CIS) Lab, the Medical & Health Informatics (MEI) Lab, and the 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 understand how intelligence works.
As part of NTT, Inc., a global enterprise with more than $90 billion in annual revenue, serving 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.
Through the annual NTT Research’s Upgrade conference and 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. or NTT Research, Inc., and/or their affiliates. All other referenced product names are trademarks of their respective owners. © 2026 NTT Research, Inc.
| NTT Research Contact: Chris Shaw Chief Marketing Officer NTT Research +1-312-888-5412 chris.shaw@ntt-research.com | Media Contact: Cara Milan AMP Marketing and Public Relations For NTT Research +1- 415-792-2968 cara@amppublicrelations.com |