How Can Cryptography Protect Data, Verify Computation and Prepare Security for the Quantum Era? 28 NTT Research Papers Accepted at CRYPTO 2026 Offer New Insights

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 HighlightsCan Quantum Systems Support Anonymous Money and Verifiable Voting?Anonymous Public-Key Quantum Money and Universally Verifiable Quantum VotingThis 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.AuthorsAlper Çakan — Carnegie Mellon UniversityVipul Goyal — Cryptography & Information Security (CIS) Laboratories, NTT Research; Carnegie Mellon UniversityTakashi Yamakawa — NTT Social Informatics LaboratoriesWhat Happens When Adversaries Receive Multiple Copies of Quantum Information?Multi-Copy Security in Quantum Cryptography and MoreThis 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.AuthorsAlper Çakan — Carnegie Mellon UniversityVipul Goyal — Cryptography & Information Security (CIS) Laboratories, NTT Research; Carnegie Mellon UniversityFuyuki Kitagawa — NTT Social Informatics LaboratoriesRyo Nishimaki — NTT Social Informatics LaboratoriesTakashi Yamakawa — NTT Social Informatics LaboratoriesCan Digital Information Be Verifiably Deleted Yet Remain Deniable?How to Delete Without a Trace: Certified Deniability in a Quantum WorldThis 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.AuthorsAlper Çakan — Carnegie Mellon UniversityVipul Goyal — Cryptography & Information Security (CIS) Laboratories, NTT Research; Carnegie Mellon UniversityJustin Raizes — Carnegie Mellon UniversityHow Can Attribute-Based Encryption Scale to Rich Access Policies?Pairing-Based Registered ABE for Boolean Formulas with a Linear-Size CRSThis 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.AuthorsRoy Stracovsky — Georgia Institute of TechnologyBrent Waters — The University of Texas at Austin; Cryptography & Information Security (CIS) Laboratories, NTT ResearchDavid J. Wu — The University of Texas at AustinCan Parties Compute Securely Even When Most Participants Are Dishonest?Dishonest-Majority Secure Computation via PIR-Authenticated Multiplication TriplesThis 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.AuthorsElette Boyle — Cryptography & Information Security (CIS) Laboratories, NTT Research; Reichman UniversityNiv Gilboa — Ben-Gurion University of the NegevMatan Hamilis — Reichman UniversityYuval Ishai — Technion – Israel Institute of TechnologyAriel Nof — Bar-Ilan UniversityHow Secure Are UOV-Based Post-Quantum Signature Designs Against New Algebraic Attacks?Key Recovery Attacks on UOV Using p^l-Truncated Polynomial RingsThis 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.AuthorsHiroki Furue — NTT Social Informatics LaboratoriesYasuhiko Ikematsu — Kyushu UniversityAdditional Accepted PapersThe following NTT-affiliated papers were also accepted at CRYPTO 2026:Verifiable Computation, Zero-Knowledge and Program ProtectionHow Can Computation Be Verified as It Progresses?Incrementally Verifiable Computation without ExtractionAuthorsAbhishek Jain — Cryptography & Information Security (CIS) Laboratories, NTT Research; Johns Hopkins UniversitySurya Mathialagan — Cryptography & Information Security (CIS) Laboratories, NTT ResearchBrent Waters — Cryptography & Information Security (CIS) Laboratories, NTT Research; The University of Texas at AustinCan We Build Stronger Program Obfuscation from Polynomial Hardness?How to use Polynomially-Hard iO: Turing Machine Obfuscation and MoreAuthorsJesko Dujmovic — Northeastern UniversityYao-Ching Hsieh — University of WashingtonAbhishek Jain — Cryptography & Information Security (CIS) Laboratories, NTT Research; Johns Hopkins UniversityWilly Quach — CISPA Helmholtz Center for Information SecurityCan One Proof System Be Transformed into Another More Broadly?From NIZK Arguments to ZAPs, GenericallyAuthorsAnish Banerjee — The University of Texas at AustinBrent Waters — The University of Texas at Austin; Cryptography & Information Security (CIS) Laboratories, NTT ResearchDavid J. Wu — The University of Texas at AustinWhat Is the Minimum Foundation Needed for Zero-Knowledge?Non-Trivial Zero-Knowledge Implies One-Way FunctionsAuthorsSuvradip Chakraborty — Visa ResearchJames Hulett — University of Illinois Urbana-ChampaignDakshita Khurana — University of Illinois Urbana-Champaign; Cryptography & Information Security (CIS) Laboratories, NTT ResearchKabir Tomer — University of Illinois Urbana-ChampaignCan Succinct Proofs Remain Unique and Secure Against Adaptive Attacks?Unique SNARGs with Adaptive Security: Constructions and Black-Box SeparationsAuthorsCody Freitag — Northeastern University, Hebrew University of JerusalemDaniel Wichs — Northeastern University; Cryptography & Information Security (CIS) Laboratories, NTT ResearchCan Error-Correcting Codes Reach the Fundamental Communication Limit Against Efficient Adversaries?Achieving Shannon Capacity for Computationally Bounded ErrorsAuthorsGeorge Lu — University of Texas at AustinJad Silbak — Massachusetts Institute of TechnologyDaniel Wichs — Northeastern University; Cryptography & Information Security (CIS) Laboratories, NTT ResearchScalable Encryption and Digital TrustHow Can Any Number of Parties Establish Keys Without Interaction?Adaptive NIKE for Unbounded PartiesAuthorsShafik Nassar — The University of Texas at AustinBrent Waters — The University of Texas at Austin; Cryptography & Information Security (CIS) Laboratories, NTT ResearchHow Can Programmable Cryptographic Functions Enable More Powerful Garbled Computation?Suffix-Invariant Programmable PRFs and Applications to Stacked GarblingAuthorsVipul Goyal — Cryptography & Information Security (CIS) Laboratories, NTT ResearchDavid Heath — University of Illinois Urbana-ChampaignAbhishek Jain — Cryptography & Information Security (CIS) Laboratories, NTT Research; Johns Hopkins UniversityYibin Yang —Cryptography & Information Security (CIS) Laboratories, NTT ResearchCan Privacy-Preserving Signatures Be Both Distributed and Communication-Efficient?Round-Optimal Threshold Blind Signatures without Random OraclesAuthorsGeorg Fuchsbauer — TU WienFabian Regen — TU WienHoeteck Wee — Cryptography & Information Security (CIS) Laboratories, NTT ResearchHow Can Encrypted Data Reach Unlimited Audiences Without Ciphertexts Growing Linearly?Unbounded Broadcast and KP-ABE with Sublinear Ciphertext from PairingsAuthorsJunichi Tomida — Cryptography & Information Security (CIS) Laboratories, NTT ResearchHoeteck Wee — Cryptography & Information Security (CIS) Laboratories, NTT ResearchSecure Multiparty ComputationHow Can Secure Multiparty Computation Become Faster at Scale?Fast PCGs for Batch-Authenticated Multiplication TriplesAuthorsElette Boyle — Cryptography & Information Security (CIS) Laboratories, NTT Research; Reichman UniversityNiv Gilboa — Ben-Gurion UniversityMatan Hamilis — Reichman UniversityYuval Ishai — Technion – Israel Institute of TechnologyAriel Nof — Bar-Ilan UniversityQuantum Cryptography and VerificationHow Can a Prover Demonstrate Possession of Quantum Knowledge?A New Approach to Arguments of Quantum KnowledgeAuthorsJames Bartusek — Columbia UniversityRuta Jawale — University of Illinois Urbana-ChampaignJustin Raizes — Cryptography & Information Security (CIS) Laboratories, NTT ResearchKabir Tomer — University of Illinois Urbana-ChampaignCan Cryptographic Information Remain Uncopyable with Realistic Quantum Memory?Uncloneable Cryptography in Linear Quantum MemoryAuthorsAndrew Huang — Massachusetts Institute of TechnologyOmri Shmueli — Cryptography & Information Security (CIS) Laboratories, NTT ResearchVinod Vaikuntanathan — Massachusetts Institute of TechnologyMark Zhandry — Stanford UniversityCan Quantum Information Support Publicly Verifiable, Destructive Cryptographic Objects?Public-Key Quantum Fire and Key-Fire From Classical OraclesAuthorsAlper Çakan — Carnegie Mellon UniversityVipul Goyal — Cryptography & Information Security (CIS) Laboratories, NTT Research; Carnegie Mellon UniversityOmri Shmueli —Cryptography & Information Security (CIS) Laboratories, NTT ResearchWhat Assumptions Are Truly Needed to Verify Quantum Computation Classically?Separating Non-Interactive Classical Verification of Quantum Computation from Falsifiable AssumptionsAuthorsMohammed Barhoush — Université de MontréalTomoyuki Morimae — Kyoto UniversityRyo Nishimaki — NTT Social Informatics LaboratoriesTakashi Yamakawa — NTT Social Informatics LaboratoriesPost-Quantum and Symmetric SecurityWhere Do Familiar Hash Constructions Reach Their Post-Quantum Limits?The Impossibility of Post-Quantum Public Indifferentiability for Merkle-DamgardAuthorsAkinori Hosoyamada — NTT Social Informatics LaboratoriesDoes HCTR2 Reliably Bind Ciphertexts to a Single Key?Key Committing Security of HCTR2, RevisitedAuthorsDonghoon Chang — FWI / NIST AssociateYu Long Chen — KU LeuvenYukihito Hiraga — The University of Electro-CommunicationsKazuhiko Minematsu — NEC Corporation, The University of OsakaNicky Mouha — KeyCrypticYusuke Naito — Mitsubishi Electric CorporationYu Sasaki — NTT Social Informatics Laboratories, NIST AssociateTakeshi Sugawara — The University of Electro-CommunicationsCan Common Padding Choices Weaken Ascon-Based Security?Generic Committing Attacks: Zero-Padded Ascon is Less Secure than ExpectedAuthorsNilanjan Datta — Institute for Advancing Intelligence, TCG CRESTHrithik Nandi — Institute for Advancing Intelligence, TCG CREST / Ramakrishna Mission Vivekananda Educational and Research InstituteSoumit Pal — Indian Statistical InstituteYu Sasaki — NTT Social Informatics Laboratories, NIST AssociatePatrick Struck — University of KonstanzMaximiliane Weishäupl — University of RegensburgCan Cryptographic Keys Be Leased and Reliably Returned Using Quantum Information?A Unified Approach to Quantum Key Leasing with a Classical LessorAuthorsFuyuki Kitagawa — NTT Social Informatics LaboratoriesJiahui Liu — Fujitsu ResearchShota Yamada — AISTTakashi Yamakawa — NTT Social Informatics LaboratoriesHow Can Lattice Cryptography Better Resist Side-Channel Attacks?Maskaglia: A New, Efficient Approach to Masked Discrete Gaussian SamplingAuthorsCalvin Abou Haidar — NTT Social Informatics LaboratoriesThomas Espitau — PQShieldClément Hoffmann — NTT Social Informatics LaboratoriesMehdi Tibouchi — NTT Social Informatics LaboratoriesCan Circular-Security Techniques Be Understood Through One Framework?A Unifying Umbrella for Circular-Secure Cryptographic PrimitivesAuthorsFuyuki Kitagawa — NTT Social Informatics LaboratoriesTakahiro Matsuda — AISTAI Model SecurityHow Efficient Are Cryptanalytic Model-Extraction Attacks in Practice and Theory?Is the Hard-Label Cryptanalytic Model Extraction Really Polynomial?AuthorsAkira Ito — Tohoku UniversityTakayuki Miura — NTT Social Informatics LaboratoriesYosuke Todo — NTT Social Informatics LaboratoriesAbout the Cryptography & Information Security (CIS) LabThe 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 LaboratoriesNTT 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 2026The 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 ResearchNTT 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.