Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Chris Hall

dblp:96/6074 · DBLP profile ↗
← Back
15ranked-venue papers
5as first author
3since 2021 · last 2025
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 10 · 4 first-authorHuman-computer interaction and ubiquitous computing · 2 · 2 since 2021Systems, architecture and hardware · 1Theory of computation · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%
Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory
expander graphs
0.212016
Ramanujan coverings of graphs · STOC 2016
Graph algorithms and graph theory › graph theory
graph covering
0.212016
Ramanujan coverings of graphs · STOC 2016
Graph algorithms and graph theory › expander graphs
ramanujan graphs
0.212016
Ramanujan coverings of graphs · STOC 2016
Graph algorithms and graph theory
spectral graph theory
0.212016
Ramanujan coverings of graphs · STOC 2016
Cryptographic primitives and cryptanalysis
pseudorandom functions
0.011998
Building PRFs from PRPs · CRYPTO 1998

Methods — techniques the papers use, named apart from their topics

spectral radius bounds · 0.2interlacing families · 0.2
YearPublicationVenuePosition
2025 Santa Clara 3D: Digital Reconstruction and Storytelling of a Francoist Concentration Camp
Stinne Zacho, Chris Hall, Jakob Kusnick, Stefan Jänicke
CHIRA (3)2
2025 Out of the Day Job: Perspectives of Industry Practitioners in Co-Design and Delivery of Software Engineering Courses
abstract
Over more than two decades, The University of Glasgow has co-designed and delivered numerous software engineering focused courses with industry partners, covering both technical and discipline specific professional skills. Such collaborations are not unique and many of the benefits are well recognised in the literature. These include enhancing the real-world relevance of curricula, developing student professional networks ahead of graduation and easing recruitment opportunities for employers. However, there is relatively little scholarship on the perspectives of industry practitioners who participate in course design and delivery. This gap is significant, since the effort invested by practitioners is often substantial and may require ongoing support from both the industry partner and academic institution. Understanding the motivations, expectations and experiences of practitioners who engage in course delivery can guide the formation of future partnerships and ensure their long-term sustainability. We begin to address this gap by reporting on the outcomes of a retrospective conducted amongst the practitioner coauthors of this paper, with the academic coauthors acting as facilitators. All coauthors have participated in the recent co-design and delivery of software engineering courses, but we choose to focus explicitly on the perspectives of the practitioners. We report on the themes that emerged from the discussions and our resulting recommendations for future collaborations.
Gillian Daniel, Chris Hall, Per Hammer, Alec-Angus Macdonald, Hollie Marwick-Best, Emma McKenzie, George Popa, Derek Somerville, Tim Storer
ITiCSE (1)2
2022 Full Field X-Ray Scatter Tomography
abstract
In X-ray imaging, photons are transmitted through and absorbed by the target object, but are also scattered in significant quantities. Previous attempts to use scattered X-ray photons for imaging applications used pencil or fan beam illumination. Here we present 3D X-ray Scatter Tomography using full-field illumination for small-animal imaging. Synchrotron imaging experiments were performed on a phantom and the chest of a juvenile rat. Transmitted and scattered photons were simultaneously imaged with separate cameras; a scientific camera directly downstream of the sample stage, and a pixelated detector with a pinhole imaging system placed at$45{}^\circ $to the beam axis. We obtained scatter tomogram feature fidelity sufficient for segmentation of the lungs and major airways in the rat. The image contrast in the scatter tomogram slices approached that of transmission imaging, indicating robustness to the amount of multiple scattering present in our case. This opens the possibility of augmenting full-field 2D imaging systems with additional scatter detectors to obtain complementary modes or to improve the fidelity of existing images without additional dose, potentially leading to single-shot or reduced-angle tomography or overall dose reduction for live animal studies.
Gary Ruben, Isaac Pinar, Jeremy M. C. Brown, Florian Schaff, James A. Pollock, Kelly J. Crossley, Anton Maksimenko, Chris Hall, Daniel Hausermann, Kentaro Uesugi, Marcus J. Kitchen
IEEE Trans. Medical Imaging8
2016 Ramanujan coverings of graphs
abstract
Let G be a finite connected graph, and let ρ be the spectral radius of its universal cover. For example, if G is k-regular then ρ=2√k−1. We show that for every r, there is an r-covering (a.k.a. an r-lift) of G where all the new eigenvalues are bounded from above by ρ. It follows that a bipartite Ramanujan graph has a Ramanujan r-covering for every r. This generalizes the r=2 case due to Marcus, Spielman and Srivastava (2013).
Chris Hall, Doron Puder, William F. Sawin
STOC1
2000 Protecting secret keys with personal entropy
Carl M. Ellison, Chris Hall, Randy Milbert, Bruce Schneier
Future Gener. Comput. Syst.2
2000 Side Channel Cryptanalysis of Product Ciphers
abstract
Building on the work of Kocher (1996), Jaffe and Yun (1998), we discuss the notion of side-channel cryptanalysis: cryptanalysis using implementation data. We discuss the notion of side-channel attacks and the vulnerabilities they introduce, demonstra
John Kelsey, Bruce Schneier, David A. Wagner 0001, Chris Hall
J. Comput. Secur.4
1999 Reaction Attacks against several Public-Key Cryptosystems
Chris Hall, Ian Goldberg 0001, Bruce Schneier
ICICS1
1998 Building PRFs from PRPs
Chris Hall, David A. Wagner 0001, John Kelsey, Bruce Schneier
CRYPTO1
1998 Side Channel Cryptanalysis of Product Ciphers
John Kelsey, Bruce Schneier, David A. Wagner 0001, Chris Hall
ESORICS4
1998 Cryptanalytic Attacks on Pseudorandom Number Generators
John Kelsey, Bruce Schneier, David A. Wagner 0001, Chris Hall
FSE4
1998 Cryptanalysis of SPEED
Chris Hall, John Kelsey, Vincent Rijmen, Bruce Schneier, David A. Wagner 0001
Selected Areas in Cryptography1
1998 On the Twofish Key Schedule
Bruce Schneier, John Kelsey, Doug Whiting, David A. Wagner 0001, Chris Hall
Selected Areas in Cryptography5
1997 Remote Electronic Gambling
abstract
We examine the problem of putting a casino on the Internet. We discuss fairly generating random bits and permutations for use in casino games, protecting against player/player and player/dealer collusions, and ensuring a secure audit trail that both the player and dealer can use to ensure the payment of debts. We conclude with a series of open problems.
Chris Hall, Bruce Schneier
ACSAC1
1997 An Improved E-Mail Security Protocol
abstract
Current e-mail security systems base their security on the secrecy of the long-term private key. If this private key is ever compromised, an attacker can decrypt any messages-past, present or future-encrypted with the corresponding public key. The system described in this paper uses short-term private-key/public-key key pairs to reduce the magnitude of this vulnerability.
Bruce Schneier, Chris Hall
ACSAC2
1996 An Authenticated Camera
abstract
We develop protocols for an authenticated camera that allows people to verify that a given digital image was taken by a specific camera at a specific time and specific place. These protocols require interaction between the camera and base station both before and after a series of images are taken.
John Kelsey, Bruce Schneier, Chris Hall
ACSAC3