Secure Authentication of ADS-B Aircraft Communications using Retroactive Key Publication
Pith reviewed 2026-05-24 23:17 UTC · model grok-4.3
The pith
Retroactive key publication authenticates ADS-B messages on existing hardware without prior connections or two-way exchange.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
Retroactive key publication enables authentication of ADS-B messages by delaying key release until after the protected data has been sent, allowing receivers to verify signatures on earlier packets without any prior setup or connection, while still accommodating lost packets and preserving the broadcast-only nature of the protocol.
What carries the argument
Retroactive key publication scheme, in which senders release keys after broadcasting the messages they authenticate.
If this is right
- The protocol runs on the same ADS-B hardware and message formats already in use.
- Security is added while keeping the system fully open and one-way broadcast.
- Packet loss from high air traffic does not break the authentication process.
- Operational efficiency and procedures remain unchanged for current aircraft systems.
Where Pith is reading between the lines
- The same delayed-key pattern might extend to other unidirectional broadcast systems that cannot afford setup traffic.
- Receivers would need to store recent messages for a bounded time window matching the key publication delay.
- If key publication timing is fixed, the scheme could be combined with existing time-synchronization standards already present in ADS-B.
Load-bearing premise
Receivers can reliably match delayed keys to the earlier messages they protect, even when some packets are lost and without any prior connection or two-way exchange.
What would settle it
A test in which simulated ADS-B traffic with 15 percent random packet loss shows that more than 10 percent of received messages cannot be correctly paired with their later keys within the expected publication window.
Figures
read the original abstract
Automatic Dependent Surveillance-Broadcast(ADSB), is the next generation Air Traffic management system to monitor the airspace for air traffic communication and traffic information. While the ADS-B empowers aircraft to broadcast their location information automatically and provide situational awareness, it is susceptible to attacks and security issues. In this paper, we introduce a method to secure the ADS-B protocol in aircraft communication using Retroactive Key Publication where senders publish their keys retroactively, which is different from the traditional asymmetric cryptography. The deduced solution does not rely on a connection or two-way packets exchange to establish security. It compensates for the loss of packets owing to huge air traffic, yet preserving the open and broadcast nature of ADS-B. Our proposed protocol uses the existing ADS-B system and same hardware with no modifications but still adds security. Our secure system has low impact on current operations and retains the operational efficiency of the current aircraft system.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proposes a method for secure authentication of ADS-B aircraft communications using retroactive key publication. The scheme is claimed to use the existing ADS-B system and hardware with no modifications, add security without relying on connections or two-way exchanges, compensate for packet losses while preserving the open broadcast nature of ADS-B, and have low impact on current operations.
Significance. If the proposed protocol can be shown to work as described, it would be of high significance for air traffic management security, as it would allow authentication of broadcast messages without changing the protocol or hardware, addressing known vulnerabilities in ADS-B while maintaining operational efficiency.
major comments (2)
- [Abstract] Abstract, paragraph on protocol properties: The claim that the retroactive key publication scheme compensates for packet loss while preserving broadcast properties relies on an unstated mechanism for associating delayed keys with earlier messages. This association must tolerate independent losses without prior state or bidirectional exchange, but no details, equations, or arguments are provided to show how this is achieved. This is load-bearing for the central claim of using unmodified hardware and protocol, as failure would result in unverifiable messages or security breaches under realistic ADS-B loss rates.
- [Abstract] Abstract: No security analysis, threat model, protocol specification, or evaluation data is presented to support that the scheme adds security to ADS-B communications or that it can be implemented with zero modifications.
minor comments (1)
- [Abstract] Inconsistent abbreviation: 'ADSB' and 'ADS-B' are used interchangeably; standardize notation.
Simulated Author's Rebuttal
We thank the referee for the careful review and constructive feedback on our manuscript. We agree that the abstract lacks sufficient detail on key aspects of the protocol and will revise the paper to address these points by expanding the description, adding analysis, and including supporting material.
read point-by-point responses
-
Referee: [Abstract] Abstract, paragraph on protocol properties: The claim that the retroactive key publication scheme compensates for packet loss while preserving broadcast properties relies on an unstated mechanism for associating delayed keys with earlier messages. This association must tolerate independent losses without prior state or bidirectional exchange, but no details, equations, or arguments are provided to show how this is achieved. This is load-bearing for the central claim of using unmodified hardware and protocol, as failure would result in unverifiable messages or security breaches under realistic ADS-B loss rates.
Authors: The referee is correct that the abstract provides no details, equations, or arguments for the key-message association mechanism or its loss tolerance. The manuscript as written is high-level and does not contain this information. We will revise by adding a dedicated protocol section with a description of the association method (using sequence numbers and delayed disclosure intervals), equations for verification under loss, and an argument showing tolerance to independent losses without prior state or bidirectional exchange. revision: yes
-
Referee: [Abstract] Abstract: No security analysis, threat model, protocol specification, or evaluation data is presented to support that the scheme adds security to ADS-B communications or that it can be implemented with zero modifications.
Authors: We agree that the abstract (and the manuscript) contains no security analysis, threat model, formal protocol specification, or evaluation data. The current text is limited to a high-level claim. In revision we will add a threat model, a precise protocol specification, a security analysis, and preliminary evaluation results on overhead and security to substantiate the claims of added security with zero hardware or protocol modifications. revision: yes
Circularity Check
Protocol proposal contains no derivation chain or self-referential reductions
full rationale
The manuscript presents a descriptive protocol for retroactive key publication in ADS-B without any equations, fitted parameters, predictions derived from subsets of data, or load-bearing self-citations. The central claims (no hardware changes, compensation for packet loss, no two-way exchange) are stated directly as properties of the proposed scheme rather than derived from prior results or definitions that reduce to the inputs. No uniqueness theorems, ansatzes, or renamings of known results appear. The association mechanism under loss is an explicit design assumption of the protocol, not a circular output. This is the common case of a self-contained engineering proposal with no mathematical circularity.
Axiom & Free-Parameter Ledger
Reference graph
Works this paper leans on
- [1]
-
[2]
Realities and challenges of nextgen air traffic management: The case of ads-b,
M. Strohmeier, M. Schafer, V . Lenders, and I. Marti- novic, “Realities and challenges of nextgen air traffic management: The case of ads-b,” IEEE Communica- tions Magazine, vol. 52, no. 5, pp. 111–118, Jun. 2014, ISSN : 0163-6804
work page 2014
-
[3]
RTCA, Inc., “Minimum aviation system performance standards for automatic dependant surveillance - broad- cast (ADS-B),” RTCA, Standard Report DO242A, 2006
work page 2006
-
[4]
On the security of the automatic dependent surveillance- broadcast protocol,
M. Strohmeier, V . Lenders, and I. Martinovic, “On the security of the automatic dependent surveillance- broadcast protocol,” IEEE Communications Surveys Tu- torials, vol. 17, no. 2, pp. 1066–1087, 2015
work page 2015
-
[5]
FAA, Automatic dependent surveillance-broadcast (ADS-B), Mar. 2019. [Online]. Available: https://www. faa.gov/nextgen/programs/adsb/
work page 2019
-
[6]
Sun, The 1090mhz riddle: An open-access book about decoding mode-s and ads-b data , 2017
J. Sun, The 1090mhz riddle: An open-access book about decoding mode-s and ads-b data , 2017. [On- line]. Available: https : / / mode - s . org / decode / book - the 1090mhz riddle-junzi sun.pdf
work page 2017
-
[7]
Q. Dang, Nist special publication 800-107 revision 1 recommendation for applications using approved hash algorithms, 2012
work page 2012
-
[8]
The TESLA Broadcast Authentication Protocol,
A. Perrig, R. Canetti, J. D. Tygar, and D. Song, “The TESLA Broadcast Authentication Protocol,” RSA Cryp- tobytes, vol. 5, no. 2, p. 213, 2002
work page 2002
-
[9]
Message Authentication using Hash Functions- The HMAC Con- struction,
M. Bellare, R. Canetti, and H. Krawczyk, “Message Authentication using Hash Functions- The HMAC Con- struction,” CryptoBytes, vol. 2, no. 1, 1996
work page 1996
-
[10]
The probability of collisions in Wireless Sensor Network with random sending,
S Rajba and T. Rajba, “The probability of collisions in Wireless Sensor Network with random sending,” Przeglad Elektrotechniczny, vol. 88, pp. 243–246, Jan. 2012
work page 2012
- [11]
-
[12]
The Mode S Beacon Radar System Air Traffic Control Radar Beacon System,
V . A. Orlando, “The Mode S Beacon Radar System Air Traffic Control Radar Beacon System,” 3, vol. 2, 1989
work page 1989
-
[13]
E. Chang, R. Hu, D. Lai, R. Li, Q. Scott, and T. Tyan, “The story of mode s,” pp. 1–40, Dec. 2000. [Online]. Available: http://web.mit.edu/6.933/www/Fall2000/ mode-s/mode-s.pdf
work page 2000
-
[14]
Bringing up opensky: A large- scale ads-b sensor network for research,
M. Schfer, M. Strohmeier, V . Lenders, I. Martinovic, and M. Wilhelm, “Bringing up opensky: A large- scale ads-b sensor network for research,” in IPSN-14 Proceedings of the 13th International Symposium on Information Processing in Sensor Networks , Apr. 2014, pp. 83–94
work page 2014
-
[15]
S. Sciancalepore and R. Di Pietro, “Sos - securing open skies,” in 11th International Conference on Security, Privacy, and Anonymity in Computation, Communica- tion, and Storage (SPACCS 2018) , Springer Interna- tional Publishing, 2018, pp. 15–32, ISBN : 978-3-030- 05345-1
work page 2018
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.