Alexander Russell
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
Research Subjects
Alexander Russell has a total of 203 co-authors. Here are the top co-authors by number of shared publications:
- Cristopher Moore
Santa Fe Institute
29 shared publications Cristopher Moore
14 shared publicationsAggelos Kiayias
IOHK
9 shared publicationsAlexander A. Shvartsman
7 shared publications- Bing Wang
University of Connecticut
7 shared publications Narasimha Shashidhar
Computer Science Department, Sam Houston State University, 1900 Avenue I, Huntsville, TX 77341, USA
7 shared publications
Latest Publications
- 27 September 2026
- Published by Springer Nature
- p. 662-680
Adaptively Secure Fast Settlement with Dynamic Participation and Self-healing
- 27 September 2026
- Published by Springer Nature
- p. 662-680
Adaptively Secure Fast Settlement with Dynamic Participation and Self-healing
- Open Access
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 3605-3619
Fuzzy Extractors are Practical: Cryptographic Strength Key Derivation from the Iris
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 3605-3619
Open AccessFuzzy Extractors are Practical: Cryptographic Strength Key Derivation from the Iris
- Open Access
- 19 November 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computing for Healthcare
Predicting Depression Treatment Outcome Using Daily Step Count Sensory Data
Personalized depression treatment, despite decades of research, is still elusive. The current best practice is closely monitoring patients and adjusting the treatment as needed. Close monitoring of patients is, however, challenging in clinical settings due to high cost, limited resources, and patient burden. In this paper, we explore using daily step counts automatically collected by a fitness wristband for depression treatment status monitoring. We focus on deep learning models that can effectively learn feature representation from a sequence of raw daily step count data, without relying on handcrafted features. One significant challenge is that our dataset is small, while deep learning models typically need large amounts of data to achieve strong generalization. To address this challenge, we investigate self-supervised contrastive pretraining to learn feature representation, followed by utilizing these representations for binary classification. Our results show that this contrastive pretraining approach significantly outperforms several state-of-the-art deep learning models. When using step count data together with a one-shot self-reported baseline questionnaire score, it leads to validation \(F_{1}\) score up to 0.74, comparable to the best \(F_{1}\) score (0.72) when using baseline and burdensome periodic self-reported scores. Last, when further including daily sleep data, the best \(F_{1}\) score is improved to 0.77.- 19 November 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computing for Healthcare
Open AccessPredicting Depression Treatment Outcome Using Daily Step Count Sensory Data
Personalized depression treatment, despite decades of research, is still elusive. The current best practice is closely monitoring patients and adjusting the treatment as needed. Close monitoring of patients is, however, challenging in clinical settings due to high cost, limited resources, and patient burden. In this paper, we explore using daily step counts automatically collected by a fitness wristband for depression treatment status monitoring. We focus on deep learning models that can effectively learn feature representation from a sequence of raw daily step count data, without relying on handcrafted features. One significant challenge is that our dataset is small, while deep learning models typically need large amounts of data to achieve strong generalization. To address this challenge, we investigate self-supervised contrastive pretraining to learn feature representation, followed by utilizing these representations for binary classification. Our results show that this contrastive pretraining approach significantly outperforms several state-of-the-art deep learning models. When using step count data together with a one-shot self-reported baseline questionnaire score, it leads to validation \(F_{1}\) score up to 0.74, comparable to the best \(F_{1}\) score (0.72) when using baseline and burdensome periodic self-reported scores. Last, when further including daily sleep data, the best \(F_{1}\) score is improved to 0.77. - Open Access
- 28 October 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
- Vol. 17 (6) , 1-24
Cross-platform Prediction of Depression Treatment Outcome Using Location Sensory Data on Smartphones
Currently, depression treatment relies on closely monitoring patients’ response to treatment and adjusting the treatment as needed. Using self-reported or physician-administrated questionnaires to monitor treatment response is, however, subjective, costly and suffers from recall bias. In this paper, we explore using location sensory data collected passively on smartphones to predict treatment outcome. To address heterogeneous data collection on Android and iOS phones, the two predominant smartphone platforms, we explore using domain adaptation techniques to map their data to a common feature space, and then use the data jointly to train machine learning models. We further explore integrating contrastive learning with domain adaptation to augment data and learn feature embeddings. These learned embeddings are then used to train machine learning models to predict depression treatment outcomes. Our evaluation shows that using the embeddings learned by jointly integrating contrastive learning and domain adaptation leads to the best prediction accuracy. In addition, our results show that using location features and baseline self-reported questionnaire score can lead to F1 score up to 0.76. This accuracy is comparable to that obtained using periodic self-reported questionnaires, indicating that using location data is a promising direction for predicting depression treatment outcome. Last, when all location and questionnaire data are used together, the F1 score further increases to 0.79.
- 28 October 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
- Vol. 17 (6) , 1-24
Open AccessCross-platform Prediction of Depression Treatment Outcome Using Location Sensory Data on Smartphones
Currently, depression treatment relies on closely monitoring patients’ response to treatment and adjusting the treatment as needed. Using self-reported or physician-administrated questionnaires to monitor treatment response is, however, subjective, costly and suffers from recall bias. In this paper, we explore using location sensory data collected passively on smartphones to predict treatment outcome. To address heterogeneous data collection on Android and iOS phones, the two predominant smartphone platforms, we explore using domain adaptation techniques to map their data to a common feature space, and then use the data jointly to train machine learning models. We further explore integrating contrastive learning with domain adaptation to augment data and learn feature embeddings. These learned embeddings are then used to train machine learning models to predict depression treatment outcomes. Our evaluation shows that using the embeddings learned by jointly integrating contrastive learning and domain adaptation leads to the best prediction accuracy. In addition, our results show that using location features and baseline self-reported questionnaire score can lead to F1 score up to 0.76. This accuracy is comparable to that obtained using periodic self-reported questionnaires, indicating that using location data is a promising direction for predicting depression treatment outcome. Last, when all location and questionnaire data are used together, the F1 score further increases to 0.79.
- Open Access
- 17 August 2025
- Published by Springer Nature
- p. 69-100
High-Throughput Permissionless Blockchain Consensus Under Realistic Network Assumptions
- 17 August 2025
- Published by Springer Nature
- p. 69-100
Open AccessHigh-Throughput Permissionless Blockchain Consensus Under Realistic Network Assumptions
- Open Access
- 24 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 93-104
Smartphone Data Gathered Early in Depression Treatment Predicts Treatment Outcome
- 24 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 93-104
Open AccessSmartphone Data Gathered Early in Depression Treatment Predicts Treatment Outcome
- 21 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Network
- Vol. 39 (3) , 158-164
Blockwise Post-Processing in Satellite-Based Quantum Key Distribution
Free-space satellite communication has significantly lower photon loss than terrestrial communication via optical fibers. Satellite-based quantum key distribution (QKD) leverages this advantage and provides a promising direction in achieving long-distance QKD. While the technological feasibility of satellite-based QKD has been demonstrated experimentally, optimizing the key rate remains a significant challenge. In this paper, we argue that improving classical post-processing is an important direction in increasing key rate in satellite-based QKD, while can also be easily incorporated in existing satellite systems. In particular, we explore one direction, blockwise post-processing, to address highly dynamic satellite channel conditions due to various environmental factors. This blockwise strategy divides the raw key bits into individual blocks that have similar noise characteristics, and processes them independently, in contrast to traditional non-blockwise strategy that treats all the raw key bits as a whole. Using a case study, we discuss the choice of blocks in blockwise strategy, and show that blockwise strategy can significantly outperform non-blockwise strategy. Our study demonstrates the importance of post-processing in satellite QKD systems, and presents several open problems in this direction.
- 21 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Network
- Vol. 39 (3) , 158-164
Blockwise Post-Processing in Satellite-Based Quantum Key Distribution
Free-space satellite communication has significantly lower photon loss than terrestrial communication via optical fibers. Satellite-based quantum key distribution (QKD) leverages this advantage and provides a promising direction in achieving long-distance QKD. While the technological feasibility of satellite-based QKD has been demonstrated experimentally, optimizing the key rate remains a significant challenge. In this paper, we argue that improving classical post-processing is an important direction in increasing key rate in satellite-based QKD, while can also be easily incorporated in existing satellite systems. In particular, we explore one direction, blockwise post-processing, to address highly dynamic satellite channel conditions due to various environmental factors. This blockwise strategy divides the raw key bits into individual blocks that have similar noise characteristics, and processes them independently, in contrast to traditional non-blockwise strategy that treats all the raw key bits as a whole. Using a case study, we discuss the choice of blocks in blockwise strategy, and show that blockwise strategy can significantly outperform non-blockwise strategy. Our study demonstrates the importance of post-processing in satellite QKD systems, and presents several open problems in this direction.
- 12 December 2024
- Published by Springer Nature
- p. 427-460
Crooked Indifferentiability of the Feistel Construction
- 12 December 2024
- Published by Springer Nature
- p. 427-460
Crooked Indifferentiability of the Feistel Construction
- Open Access
Crooked indifferentiability of the Feistel Construction
The Feistel construction is a fundamental technique for building pseudorandom permutations and block ciphers. This paper shows that a simple adaptation of the construction is resistant, even to algorithm substitution attacks -- that is, adversarial subversion -- of the component round functions. Specifically, we establish that a Feistel-based construction with more than $2000n/\log(1/ε)$ rounds can transform a subverted random function -- which disagrees with the original one at a small fraction (denoted by $ε$) of inputs -- into an object that is \emph{crooked-indifferentiable} from a random permutation, even if the adversary is aware of all the randomness used in the transformation. We also provide a lower bound showing that the construction cannot use fewer than $2n/\log(1/ε)$ rounds to achieve crooked-indifferentiable security.Open AccessCrooked indifferentiability of the Feistel Construction
The Feistel construction is a fundamental technique for building pseudorandom permutations and block ciphers. This paper shows that a simple adaptation of the construction is resistant, even to algorithm substitution attacks -- that is, adversarial subversion -- of the component round functions. Specifically, we establish that a Feistel-based construction with more than $2000n/\log(1/ε)$ rounds can transform a subverted random function -- which disagrees with the original one at a small fraction (denoted by $ε$) of inputs -- into an object that is \emph{crooked-indifferentiable} from a random permutation, even if the adversary is aware of all the randomness used in the transformation. We also provide a lower bound showing that the construction cannot use fewer than $2n/\log(1/ε)$ rounds to achieve crooked-indifferentiable security. - Open Access
Correcting Subverted Random Oracles
The random oracle methodology has proven to be a powerful tool for designing and reasoning about cryptographic schemes. In this paper, we focus on the basic problem of correcting faulty or adversarially corrupted random oracles, so that they can be confidently applied for such cryptographic purposes. We prove that a simple construction can transform a "subverted" random oracle which disagrees with the original one at a small fraction of inputs into an object that is indifferentiable from a random function, even if the adversary is made aware of all randomness used in the transformation. Our results permit future designers of cryptographic primitives in typical kleptographic settings (i.e., those permitting adversaries that subvert or replace basic cryptographic algorithms) to use random oracles as a trusted black box.
Open AccessCorrecting Subverted Random Oracles
The random oracle methodology has proven to be a powerful tool for designing and reasoning about cryptographic schemes. In this paper, we focus on the basic problem of correcting faulty or adversarially corrupted random oracles, so that they can be confidently applied for such cryptographic purposes. We prove that a simple construction can transform a "subverted" random oracle which disagrees with the original one at a small fraction of inputs into an object that is indifferentiable from a random function, even if the adversary is made aware of all randomness used in the transformation. Our results permit future designers of cryptographic primitives in typical kleptographic settings (i.e., those permitting adversaries that subvert or replace basic cryptographic algorithms) to use random oracles as a trusted black box.