Stephen McQuistin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Stephen McQuistin has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Colin Perkins
University of Glasgow, Glasgow, UK
12 shared publications - Gareth Tyson
The Hong Kong University of Science and Technology (Guangzhou), Guangzhou, China
4 shared publications - Marwan Fayed
Cloudflare Inc., London, United Kingdom
3 shared publications - Elizabeth Boswell
University of Glasgow
2 shared publications - Hamed Haddadi
Imperial College London, London, United Kingdom
2 shared publications - Ignacio Castro
Queen Mary University of London, London, United Kingdom
2 shared publications
Latest Publications
- 10 March 2026
- Published by Springer Nature
- p. 185-201
Black Holes and Prisoners: Understanding AS112 Deployment Characteristics
- 10 March 2026
- Published by Springer Nature
- p. 185-201
Black Holes and Prisoners: Understanding AS112 Deployment Characteristics
- Open Access
- 22 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 17-23
Two Decades of IETF Affiliations: Evolution and Impact
- 22 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 17-23
Open AccessTwo Decades of IETF Affiliations: Evolution and Impact
- Open Access
- 4 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 107-113
A First Look at Related Website Sets
We present the first measurement of the user-effect and privacy impact of "Related Website Sets," a recent proposal to reduce browser privacy protections between two sites if those sites are related to each other. An assumption (both explicitly and implicitly) underpinning the Related Website Sets proposal is that users can accurately determine if two sites are related via the same entity. In this work, we probe this assumption via measurements and a user study of 30 participants, to assess the ability of Web users to determine if two sites are (according to the Related Website Sets feature) related to each other. We find that this is largely not the case. Our findings indicate that 42 (36.8%) of the user determinations in our study are incorrect in privacy-harming ways, where users think that sites are not related, but would be treated as related (and so due less privacy protections) by the Related Website Sets feature. Additionally, 22 (73.3%) of participants made at least one incorrect evaluation during the study. We also characterise the Related Website Sets list, its composition over time, and its governance.
- 4 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 107-113
Open AccessA First Look at Related Website Sets
We present the first measurement of the user-effect and privacy impact of "Related Website Sets," a recent proposal to reduce browser privacy protections between two sites if those sites are related to each other. An assumption (both explicitly and implicitly) underpinning the Related Website Sets proposal is that users can accurately determine if two sites are related via the same entity. In this work, we probe this assumption via measurements and a user study of 30 participants, to assess the ability of Web users to determine if two sites are (according to the Related Website Sets feature) related to each other. We find that this is largely not the case. Our findings indicate that 42 (36.8%) of the user determinations in our study are incorrect in privacy-harming ways, where users think that sites are not related, but would be treated as related (and so due less privacy protections) by the Related Website Sets feature. Additionally, 22 (73.3%) of participants made at least one incorrect evaluation during the study. We also characterise the Related Website Sets list, its composition over time, and its governance.
- Open Access
Measuring NAT64 Usage in the Wild
NAT64 is an IPv6 transition mechanism that enables IPv6-only hosts to access the IPv4 Internet. Understanding the deployment of NAT64, and its performance impact, is crucial to the success of the IPv6 transition, by encouraging IPv6-only deployments. We develop a set of tests for detecting NAT64 and apply them to the RIPE Atlas testbed, finding 224 probes, in 43 networks, that can use NAT64 to access the IPv4 Internet. Using 34 dual stack probes, that have both NAT64 and native IPv4 access, to compare performance, we find that NAT64 paths are, on average, 23.13% longer, with 17.47% higher round-trip times.
Open AccessMeasuring NAT64 Usage in the Wild
NAT64 is an IPv6 transition mechanism that enables IPv6-only hosts to access the IPv4 Internet. Understanding the deployment of NAT64, and its performance impact, is crucial to the success of the IPv6 transition, by encouraging IPv6-only deployments. We develop a set of tests for detecting NAT64 and apply them to the RIPE Atlas testbed, finding 224 probes, in 43 networks, that can use NAT64 to access the IPv4 Internet. Using 34 dual stack probes, that have both NAT64 and native IPv4 access, to compare performance, we find that NAT64 paths are, on average, 23.13% longer, with 17.47% higher round-trip times.
- Open Access
- 24 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 383-390
A First Look at the Privacy Harms of the Public Suffix List
The public suffix list is a community-maintained list of rules that can be applied to domain names to determine how they should be grouped into logical organizations or companies. We present the first large-scale measurement study of how the public suffix list is used by open-source software on the Web and the privacy harm resulting from projects using outdated versions of the list. We measure how often developers include out-of-date versions of the public suffix list in their projects, how old included lists are, and estimate the real-world privacy harm with a model based on a large-scale crawl of the Web. We find that incorrect use of the public suffix list is common in open-source software, and that at least 43 open-source projects use hard-coded, outdated versions of the public suffix list. These include popular, security-focused projects, such as password managers and digital forensics tools. We also estimate that, because of these out-of-date lists, these projects make incorrect privacy decisions for 1313 effective top-level domains (eTLDs), affecting 50,750 domains, by extrapolating from data gathered by the HTTP Archive project.
- 24 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 383-390
Open AccessA First Look at the Privacy Harms of the Public Suffix List
The public suffix list is a community-maintained list of rules that can be applied to domain names to determine how they should be grouped into logical organizations or companies. We present the first large-scale measurement study of how the public suffix list is used by open-source software on the Web and the privacy harm resulting from projects using outdated versions of the list. We measure how often developers include out-of-date versions of the public suffix list in their projects, how old included lists are, and estimate the real-world privacy harm with a model based on a large-scale crawl of the Web. We find that incorrect use of the public suffix list is common in open-source software, and that at least 43 open-source projects use hard-coded, outdated versions of the public suffix list. These include popular, security-focused projects, such as password managers and digital forensics tools. We also estimate that, because of these out-of-date lists, these projects make incorrect privacy decisions for 1313 effective top-level domains (eTLDs), affecting 50,750 domains, by extrapolating from data gathered by the HTTP Archive project.
- Open Access
- 1 January 2023
- Published by Association for Computational Linguistics (ACL)
- p. 6080-6089
LEDA: a Large-Organization Email-Based Decision-Dialogue-Act Analysis Dataset
Mladen Karan, Prashant Khare, Ravi Shekhar, Stephen McQuistin, Ignacio Castro, Gareth Tyson, Colin Perkins, Patrick Healey, Matthew Purver. Findings of the Association for Computational Linguistics: ACL 2023. 2023.
- 1 January 2023
- Published by Association for Computational Linguistics (ACL)
- p. 6080-6089
Open AccessLEDA: a Large-Organization Email-Based Decision-Dialogue-Act Analysis Dataset
Mladen Karan, Prashant Khare, Ravi Shekhar, Stephen McQuistin, Ignacio Castro, Gareth Tyson, Colin Perkins, Patrick Healey, Matthew Purver. Findings of the Association for Computational Linguistics: ACL 2023. 2023.
- Open Access
- 17 June 2022
- Published by Association for Computing Machinery (ACM)
- p. 29-35
Retracted on December 7, 2023 : Does TCP new congestion window validation improve HTTP adaptive streaming performance?
When using HTTP adaptive streaming, video traffic exhibits on-off behaviour with frequent idle periods that can interact poorly with TCP congestion control algorithms. New congestion window validation (New CWV) modifies TCP to allow senders to recover their sending rate more quickly after certain idle periods. While previous work has shown that New CWV can improve transport performance for streaming video, it has not been shown if this translates to improved application performance in terms of playback stability. In this paper, we show that New CWV can reduce video re-buffering events by up to 4%, and limit representation switches by 12%, without any changes to existing rate adaptation algorithms.
- 17 June 2022
- Published by Association for Computing Machinery (ACM)
- p. 29-35
Open AccessRetracted on December 7, 2023 : Does TCP new congestion window validation improve HTTP adaptive streaming performance?
When using HTTP adaptive streaming, video traffic exhibits on-off behaviour with frequent idle periods that can interact poorly with TCP congestion control algorithms. New congestion window validation (New CWV) modifies TCP to allow senders to recover their sending rate more quickly after certain idle periods. While previous work has shown that New CWV can improve transport performance for streaming video, it has not been shown if this translates to improved application performance in terms of playback stability. In this paper, we show that New CWV can reduce video re-buffering events by up to 4%, and limit representation switches by 12%, without any changes to existing rate adaptation algorithms.
- Open Access
- 27 July 2020
- Published by Association for Computing Machinery (ACM)
- p. 25-31
Parsing Protocol Standards to Parse Standard Protocols
Internet protocol standards have been slow to adopt formal protocol description languages and methodologies, and are still largely written as English prose. This makes it hard to check them for correctness, or to automatically derive implementations from standards. Reasons for this are both technical and social. Some methodologies effectively describe complex communication patterns, but cannot model protocol data. Others are unnecessarily tied to particular description formats, or use unfamiliar concepts and terminology, and don't address usability by standards developers. We assess the viability of existing approaches to modelling and parsing protocol data, and identify missing features needed to represent emerging protocols. We present a typed protocol representation that can describe: (i) the format of protocol data, including data-dependent formats; (ii) contextual information needed to maintain parser state, where correct parsing may depend on out-of-band information or prior packets; and (iii) transformations and helper functions needed for multi-stage parsing. We discuss social barriers to adoption, and describe a set of principles to encourage use of formal languages within the Internet standards process. We show how to integrate our approach with the existing standards process, using QUIC as an example.
- 27 July 2020
- Published by Association for Computing Machinery (ACM)
- p. 25-31
Open AccessParsing Protocol Standards to Parse Standard Protocols
Internet protocol standards have been slow to adopt formal protocol description languages and methodologies, and are still largely written as English prose. This makes it hard to check them for correctness, or to automatically derive implementations from standards. Reasons for this are both technical and social. Some methodologies effectively describe complex communication patterns, but cannot model protocol data. Others are unnecessarily tied to particular description formats, or use unfamiliar concepts and terminology, and don't address usability by standards developers. We assess the viability of existing approaches to modelling and parsing protocol data, and identify missing features needed to represent emerging protocols. We present a typed protocol representation that can describe: (i) the format of protocol data, including data-dependent formats; (ii) contextual information needed to maintain parser state, where correct parsing may depend on out-of-band information or prior packets; and (iii) transformations and helper functions needed for multi-stage parsing. We discuss social barriers to adoption, and describe a set of principles to encourage use of formal languages within the Internet standards process. We show how to integrate our approach with the existing standards process, using QUIC as an example.
- Open Access
- 9 January 2020
- Published by Association for Computing Machinery (ACM)
- p. 1-4
Analysis of Student Misconceptions using Python as an Introductory Programming Language
- 9 January 2020
- Published by Association for Computing Machinery (ACM)
- p. 1-4
Open AccessAnalysis of Student Misconceptions using Python as an Introductory Programming Language
- Open Access
- 21 October 2019
- Published by Association for Computing Machinery (ACM)
- p. 165-178
Taming Anycast in the Wild Internet
- 21 October 2019
- Published by Association for Computing Machinery (ACM)
- p. 165-178
Open AccessTaming Anycast in the Wild Internet