Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Practical Implementation of a Zero Knowledge Protocol for Warhead Verification.

Rebecca E Krentz-Wee

Published Jul 4, 2018• 0 citations
OpenAlex

Abstract

Object X = ?Certification -the process by which a host party gains confidence that sensitive information regarding an entity or facility remains secure.

Related papers

ZERO KNOWLEDGE PROTOCOL: CHALLENGES AND OPPORTUNITIES.

Peter Marleau, E. Brubaker, Nathan R. Hilton +4 more

Glaser, Barak, and Goldston recently described an approach for nuclear warhead verification based on the cryptographic concept of a zero-knowledge protocol (ZKP).The verification approach included both procedural elements and a physical implementation.A group of Sandia National Laboratories researchers, whose expertise include radiation instrumentation design and development, cryptography, and arms control verification implementation, jointly reviewed the paper and identified specific challenges to implementing the approach as well as some opportunities.This paper compares the ZKP concept as presented by Glaser et al., to other warhead verification concepts and approaches described in the literature.The paper also summarizes challenges and opportunities for elements of this (new) approach.We note that ZKP as used in cryptography is a useful model for the arms control verification problem, but find that the direct analogy to arms control breaks down quickly.For example, fault tolerance in cryptographic ZKP is achieved by brute force repetition of the challenge/response procedure; in arms control, repeated measurements can be expensive.The ZKP methodology fits within the general class of template-based verification techniques, where template in this case refers to a reference measurement that is used for comparison.Template methods in general confirm that a given object is like another object that has already been accepted as a warhead by some other means.This can be a powerful verification approach, but requires independent means to trust the authenticity of the reference warhead -a standard that may be difficult to achieve.Note that this use of template differs from that of Glaser et al., who use the term to describe the accepted reference warhead.In the ZKP approach as described, the reference warhead must be presentwith inspector confidence in its provenance-at each subsequent confirmation measurement.This imposes significant additional constraints on maintaining continuity of knowledge of the reference between inspections.Despite some technical challenges, the concept of last-minute selection of the pre-loads and equipment could be a valuable component of a verification regime.In addition, the neutron transmission image using a bubble detector array is an interesting idea that can be considered for template measurements independently of ZKP..

•Jun 1, 2015•0 citations

A Physical Zero-Knowledge Proof and Unclonable Sensors for Nuclear Warhead Verification

Sébastien Philippe

Future nuclear arms-control agreements may call for reductions of the total number of nuclear weapons and warheads in the world arsenals. Such agreements would require new trusted verification mechanisms to confirm that items presented to inspectors are nuclear warheads and not spoofs. Proliferation and national security concerns require, however, that inspectors gain no warhead design information through this process. To address this paradox, considerable efforts have been directed towards the development of "information barriers." These barriers consist of automated measurement systems that process sensitive information but only display the results of internal analysis in a binary valid/invalid manner. These systems are, by their nature, at risk of electronic tampering and snooping – and their trusted implementation has so far proved extremely difficult to realize. This thesis takes radically different directions to address this challenge. It demonstrates new approaches to information protection and trusted instruments for nuclear warhead verification that are based on the cryptographic concepts of zero-knowledge proofs and physically unclonable functions. To the author's knowledge, this thesis provides the first demonstration of a zero-knowledge physical measurement technique. Using fast neutron differential radiography and superheated emulsion detectors, such a technique can show two objects have identical geometry and opacity to 14-MeV neutrons without revealing what these properties are. This zero-knowledge feature no longer holds when the objects compared are significantly different. Such a technique could form the basis of a template-matching verification system that could confirm the authenticity of nuclear weapons without sharing any secret design information. The thesis then introduces and demonstrates key elements of an optical physical unclonable function sensitive to neutrons and based on superheated emulsions. Such sensors are unique objects that cannot be cloned or simulated. The data they produce are a function of both their internal disordered structure and the physical quantity they measure. Due to their sensitivity against any structural variation, including through neutron irradiation, it is possible to show that they – or the data they have recorded -- have not been tampered with. Such sensors could be used by adversarial parties in sensitive facilities without the risk of being compromised.

•Jan 1, 2018•1 citation

A zero-knowledge protocol for nuclear warhead verification

Alexander Glaser, Boaz Barak, R.J. Goldston

Nature•Jun 1, 2014•69 citations

Zero Knowledge Proofs in Quantum Networks

Tuhin Paul, Srijani Das, Manasi Patra +1 more

Zero-knowledge proofs (ZKPs) enable the verification of a statement without revealing any information beyond its validity and constitute a fundamental primitive in cryptography and information theory. However, existing constructions rely on computational assumptions and are predominantly confined to bipartite settings, leaving their information-theoretic realization in bipartite or network scenarios largely unexplored. Here we develop a framework for zero-knowledge verification based on the indistinguishability of quantum states under operational constraints. Exploiting the fundamental limitations imposed by local operations, we show that a verifier is inherently restricted from extracting information about the underlying state while retaining the ability to verify correctness. We construct explicit protocols for multiparty quantum networks that achieve information-theoretic security, ensuring that no subset of collaborating parties can gain knowledge beyond the validity of the statement, independent of their joint computational power.

quant-pharXiv:2609.35339•Sep 29, 2026•0 citations

Physical cryptographic verification of nuclear warheads

R. Kemp, Areg Danagoulian, R. Loch Macdonald +1 more

How does one prove a claim about a highly sensitive object such as a nuclear weapon without revealing information about the object? This paradox has challenged nuclear arms control for more than five decades. We present a mechanism in the form of an interactive proof system that can validate the structure and composition of an object, such as a nuclear warhead, to arbitrary precision without revealing either its structure or composition. We introduce a tomographic method that simultaneously resolves both the geometric and isotopic makeup of an object. We also introduce a method of protecting information using a provably secure cryptographic hash that does not rely on electronics or software. These techniques, when combined with a suitable protocol, constitute an interactive proof system that could reject hoax items and clear authentic warheads with excellent sensitivity in reasonably short measurement times.

Proceedings of the National Academy of Sciences•Jul 18, 2016•36 citations

Private Proofs of When and Where

Uma Girish, Greg Gluch, Shafi Goldwasser +3 more

Position verification schemes are interactive protocols where entities prove their physical location to others; this enables interactive proofs for statements of the form "I am at a location $L$." Although secure position verification cannot be achieved with classical protocols (even with computational assumptions), they are feasible with quantum protocols. In this paper we introduce the notion of zero-knowledge position verification, which generalizes position verification in two ways: 1. enabling entities to prove more sophisticated statements about their locations at different times (for example, "I was NOT near location $L$ at noon yesterday"). 2. maintaining privacy for any other detail about their true location besides the statement they are proving. We construct zero-knowledge position verification from standard position verification and post-quantum one-way functions. The central tool in our construction is a primitive we call position commitments, which allow entities to privately commit to their physical position in a particular moment, which is then revealed at some later time.

quant-pharXiv:2601.18961•Jan 28, 2026•0 citations
Glaser, Barak, and Goldston recently described an approach for nuclear warhead verification based on the cryptographic concept of a zero-knowledge protocol (ZKP).The verification approach included both procedural elements and a physical implementation.A group of Sandia National Laboratories researchers, whose expertise include radiation instrumentation design and development, cryptography, and arms control verification implementation, jointly reviewed the paper and identified specific challenges to implementing the approach as well as some opportunities.This paper compares the ZKP concept as presented by Glaser et al., to other warhead verification concepts and approaches described in the literature.The paper also summarizes challenges and opportunities for elements of this (new) approach.We note that ZKP as used in cryptography is a useful model for the arms control verification problem, but find that the direct analogy to arms control breaks down quickly.For example, fault tolerance in cryptographic ZKP is achieved by brute force repetition of the challenge/response procedure; in arms control, repeated measurements can be expensive.The ZKP methodology fits within the general class of template-based verification techniques, where template in this case refers to a reference measurement that is used for comparison.Template methods in general confirm that a given object is like another object that has already been accepted as a warhead by some other means.This can be a powerful verification approach, but requires independent means to trust the authenticity of the reference warhead -a standard that may be difficult to achieve.Note that this use of template differs from that of Glaser et al., who use the term to describe the accepted reference warhead.In the ZKP approach as described, the reference warhead must be presentwith inspector confidence in its provenance-at each subsequent confirmation measurement.This imposes significant additional constraints on maintaining continuity of knowledge of the reference between inspections.Despite some technical challenges, the concept of last-minute selection of the pre-loads and equipment could be a valuable component of a verification regime.In addition, the neutron transmission image using a bubble detector array is an interesting idea that can be considered for template measurements independently of ZKP..
Future nuclear arms-control agreements may call for reductions of the total number of nuclear weapons and warheads in the world arsenals. Such agreements would require new trusted verification mechanisms to confirm that items presented to inspectors are nuclear warheads and not spoofs. Proliferation and national security concerns require, however, that inspectors gain no warhead design information through this process. To address this paradox, considerable efforts have been directed towards the development of "information barriers." These barriers consist of automated measurement systems that process sensitive information but only display the results of internal analysis in a binary valid/invalid manner. These systems are, by their nature, at risk of electronic tampering and snooping – and their trusted implementation has so far proved extremely difficult to realize. This thesis takes radically different directions to address this challenge. It demonstrates new approaches to information protection and trusted instruments for nuclear warhead verification that are based on the cryptographic concepts of zero-knowledge proofs and physically unclonable functions. To the author's knowledge, this thesis provides the first demonstration of a zero-knowledge physical measurement technique. Using fast neutron differential radiography and superheated emulsion detectors, such a technique can show two objects have identical geometry and opacity to 14-MeV neutrons without revealing what these properties are. This zero-knowledge feature no longer holds when the objects compared are significantly different. Such a technique could form the basis of a template-matching verification system that could confirm the authenticity of nuclear weapons without sharing any secret design information. The thesis then introduces and demonstrates key elements of an optical physical unclonable function sensitive to neutrons and based on superheated emulsions. Such sensors are unique objects that cannot be cloned or simulated. The data they produce are a function of both their internal disordered structure and the physical quantity they measure. Due to their sensitivity against any structural variation, including through neutron irradiation, it is possible to show that they – or the data they have recorded -- have not been tampered with. Such sensors could be used by adversarial parties in sensitive facilities without the risk of being compromised.
Zero-knowledge proofs (ZKPs) enable the verification of a statement without revealing any information beyond its validity and constitute a fundamental primitive in cryptography and information theory. However, existing constructions rely on computational assumptions and are predominantly confined to bipartite settings, leaving their information-theoretic realization in bipartite or network scenarios largely unexplored. Here we develop a framework for zero-knowledge verification based on the indistinguishability of quantum states under operational constraints. Exploiting the fundamental limitations imposed by local operations, we show that a verifier is inherently restricted from extracting information about the underlying state while retaining the ability to verify correctness. We construct explicit protocols for multiparty quantum networks that achieve information-theoretic security, ensuring that no subset of collaborating parties can gain knowledge beyond the validity of the statement, independent of their joint computational power.
How does one prove a claim about a highly sensitive object such as a nuclear weapon without revealing information about the object? This paradox has challenged nuclear arms control for more than five decades. We present a mechanism in the form of an interactive proof system that can validate the structure and composition of an object, such as a nuclear warhead, to arbitrary precision without revealing either its structure or composition. We introduce a tomographic method that simultaneously resolves both the geometric and isotopic makeup of an object. We also introduce a method of protecting information using a provably secure cryptographic hash that does not rely on electronics or software. These techniques, when combined with a suitable protocol, constitute an interactive proof system that could reject hoax items and clear authentic warheads with excellent sensitivity in reasonably short measurement times.
Position verification schemes are interactive protocols where entities prove their physical location to others; this enables interactive proofs for statements of the form "I am at a location LLL." Although secure position verification cannot be achieved with classical protocols (even with computational assumptions), they are feasible with quantum protocols. In this paper we introduce the notion of zero-knowledge position verification, which generalizes position verification in two ways: 1. enabling entities to prove more sophisticated statements about their locations at different times (for example, "I was NOT near location LLL at noon yesterday"). 2. maintaining privacy for any other detail about their true location besides the statement they are proving. We construct zero-knowledge position verification from standard position verification and post-quantum one-way functions. The central tool in our construction is a primitive we call position commitments, which allow entities to privately commit to their physical position in a particular moment, which is then revealed at some later time.