
Professor, School of Computing
alexander.russell@uconn.edu | |
Phone | (860) 486-4290 |
Mailing Address | University of Connecticut 371 Fairfield Way, Unit 4155 Storrs, CT 06269-4155 |
Campus | Storrs |
Link | Research Website |
Google Scholar Link |
Brief Bio
- Cryptography
- Blockchain Protocols
- Quantum Computing
- Algorithms
- Harmonic Analysis
- Security of Electronic Voting
- Statistical Election Auditing
Ouroboros: A provably secure proof-of-stake blockchain protocol
A Kiayias, A Russell, B David, R Oliynykov
Annual international cryptology conference, 357-388
|
Ouroboros praos: An adaptively-secure, semi-synchronous proof-of-stake blockchain
B David, P Gaži, A Kiayias, A Russell
Annual International Conference on the Theory and Applications of …
|
Efficient probabilistically checkable proofs and applications to approximations
M Bellare, S Goldwasser, C Lund, A Russell
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing …
|
Ouroboros genesis: Composable proof-of-stake blockchains with dynamic availability
C Badertscher, P Gaži, A Kiayias, A Russell, V Zikas
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications …
|
Quantum walks on the hypercube
C Moore, A Russell
International Workshop on Randomization and Approximation Techniques in …
|
Stake-bleeding attacks on proof-of-stake blockchains
P Gaži, A Kiayias, A Russell
2018 Crypto Valley conference on Blockchain technology (CVCBT), 85-92
|
Behavior vs. introspection: refining prediction of clinical depression via smartphone sensing data
AA Farhan, C Yue, R Morillo, S Ware, J Lu, J Bi, J Kamath, A Russell, ...
2016 IEEE wireless health (WH), 1-8
|
Limitations of quantum coset states for graph isomorphism
S Hallgren, C Moore, M Rötteler, A Russell, P Sen
Journal of the ACM (JACM) 57 (6), 1-33
|
The complexity of solving equations over finite groups
M Goldmann, A Russell
Information and Computation 178 (1), 253-262
|
Normal subgroup reconstruction and quantum computation using group representations
S Hallgren, A Russell, A Ta-Shma
Proceedings of the thirty-second annual ACM symposium on Theory of computing …
|
Cliptography: Clipping the power of kleptographic attacks
A Russell, Q Tang, M Yung, HS Zhou
International Conference on the Theory and Application of Cryptology and …
|
Quantum random walk with Rydberg atoms in an optical lattice
R Côté, A Russell, EE Eyler, PL Gould
New Journal of Physics 8 (8), 156
|
Tight consistency bounds for bitcoin
P Gaži, A Kiayias, A Russell
Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications …
|
The symmetric group defies strong Fourier sampling
C Moore, A Russell, LJ Schulman
SIAM Journal on Computing 37 (6), 1842-1864
|
Efficient encrypted keyword search for multi-user data sharing
A Kiayias, O Oksuz, A Russell, Q Tang, B Wang
European symposium on research in computer security, 173-195
|
The hidden subgroup problem and quantum computation using group representations
S Hallgren, A Russell, A Ta-Shma
SIAM Journal on Computing 32 (4), 916-934
|
Generic quantum Fourier transforms
C Moore, D Rockmore, A Russell
ACM Transactions on Algorithms (TALG) 2 (4), 707-723
|
McEliece and Niederreiter cryptosystems that resist quantum Fourier sampling attacks
H Dinh, C Moore, A Russell
Annual Cryptology Conference, 761-779
|
Joint modeling of heterogeneous sensing data for depression assessment via multi-task learning
J Lu, C Shang, C Yue, R Morillo, S Ware, J Kamath, A Bamis, A Russell, ...
Proceedings of the ACM on interactive, mobile, wearable and ubiquitous …
|
A note on the asymptotics and computational complexity of graph distinguishability
A Russell, R Sundaram
the electronic journal of combinatorics, R23-R23
|