Alexander Russell

According to our database1, Alexander Russell authored at least 165 papers between 1991 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Consistency in Proof-of-Stake Blockchains with Concurrent Honest Slot Leaders.
IACR Cryptol. ePrint Arch., 2020

Tight Consistency Bounds for Bitcoin.
IACR Cryptol. ePrint Arch., 2020

Ledger Combiners for Fast Settlement.
IACR Cryptol. ePrint Arch., 2020

Proof-of-Stake Blockchain Protocols with Near-Optimal Throughput.
IACR Cryptol. ePrint Arch., 2020

Hydra: Fast Isomorphic State Channels.
IACR Cryptol. ePrint Arch., 2020

The Combinatorics of the Longest-Chain Rule: Linear Consistency for Proof-of-Stake Blockchains.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Quantum-Access-Secure Message Authentication via Blind-Unforgeability.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

2019
Ouroboros Chronos: Permissionless Clock Synchronization via Proof-of-Stake.
IACR Cryptol. ePrint Arch., 2019

Efficient simulation of random states and random unitaries.
IACR Cryptol. ePrint Arch., 2019

Linear Consistency for Proof-of-Stake Blockchains.
CoRR, 2019

Let a Non-barking Watchdog Bite: Cliptographic Signatures with an Offline Watchdog.
Proceedings of the Public-Key Cryptography - PKC 2019, 2019

Graph Realization on a Random Embedding.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018
Large-scale Automatic Depression Screening Using Meta-data from WiFi Infrastructure.
IMWUT, 2018

Joint Modeling of Heterogeneous Sensing Data for Depression Assessment via Multi-task Learning.
IMWUT, 2018

Ouroboros-BFT: A Simple Byzantine Fault Tolerant Consensus Protocol.
IACR Cryptol. ePrint Arch., 2018

Space Efficient Computational Multi-Secret Sharing and Its Applications.
IACR Cryptol. ePrint Arch., 2018

Stake-Bleeding Attacks on Proof-of-Stake Blockchains.
IACR Cryptol. ePrint Arch., 2018

Parallel Chains: Improving Throughput and Latency of Blockchain Protocols via Parallel Composition.
IACR Cryptol. ePrint Arch., 2018

Handling Correlated Errors: Hardness of LWE in the Exponent.
IACR Cryptol. ePrint Arch., 2018

Ouroboros Genesis: Composable Proof-of-Stake Blockchains with Dynamic Availability.
IACR Cryptol. ePrint Arch., 2018

Quantum-secure message authentication via blind-unforgeability.
IACR Cryptol. ePrint Arch., 2018

How to Realize a Graph on Random Points.
CoRR, 2018

Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

Correcting Subverted Random Oracles.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017
Special Section on the Fifty-Fifth Annual ACM Symposium on Foundations of Coomputer Science (FOCS 2014).
SIAM J. Comput., 2017

Forkable Strings are Rare.
IACR Cryptol. ePrint Arch., 2017

Ouroboros Praos: An adaptively-secure, semi-synchronous proof-of-stake protocol.
IACR Cryptol. ePrint Arch., 2017

Fusing location data for depression prediction.
Proceedings of the 2017 IEEE SmartWorld, 2017

High Availability for VM Placement and a Stochastic Model for Multiple Knapsack.
Proceedings of the 26th International Conference on Computer Communication and Networks, 2017

Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Generic Semantic Security against a Kleptographic Adversary.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, October 30, 2017

2016
Codes, lower bounds, and phase transitions in the symmetric rendezvous problem.
Random Struct. Algorithms, 2016

Destroying Steganography via Amalgamation: Kleptographically CPA Secure Public Key Encryption.
IACR Cryptol. ePrint Arch., 2016

A Provably Secure Proof-of-Stake Blockchain Protocol.
IACR Cryptol. ePrint Arch., 2016

Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts.
IACR Cryptol. ePrint Arch., 2016

Behavior vs. introspection: refining prediction of clinical depression via smartphone sensing data.
Proceedings of the 2016 IEEE Wireless Health, 2016

Markovian Hitters and the Complexity of Blind Rendezvous.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Efficient Encrypted Keyword Search for Multi-user Data Sharing.
Proceedings of the Computer Security - ESORICS 2016, 2016

Multi-view Bi-clustering to Identify Smartphone Sensing Features Indicative of Depression.
Proceedings of the First IEEE International Conference on Connected Health: Applications, 2016

2015
Neighbor Discovery in Wireless Networks with Multipacket Reception.
IEEE Trans. Parallel Distrib. Syst., 2015

Dealing with undependable workers in decentralized network supercomputing.
Theor. Comput. Sci., 2015

Optimal ε-Biased Sets with Just a Little Randomness.
SIAM J. Discret. Math., 2015

Approximate Representations, Approximate Homomorphisms, and Low-Dimensional Embeddings of Groups.
SIAM J. Discret. Math., 2015

Limitations of single coset states and quantum algorithms for code equivalence.
Quantum Inf. Comput., 2015

Work-Competitive Scheduling on Task Dependency Graphs.
Parallel Process. Lett., 2015

Cliptography: Clipping the Power of Kleptographic Attacks.
IACR Cryptol. ePrint Arch., 2015

Asynchronous Neighbor Discovery on Duty-cycled Mobile Devices: Integer and Non-Integer Schedules.
Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2015

Asynchronous Adaptive Task Allocation.
Proceedings of the 35th IEEE International Conference on Distributed Computing Systems, 2015

2014
An Entropic Proof of Chang's Inequality.
SIAM J. Discret. Math., 2014

A One-Time Stegosystem and Applications to Efficient Covert Communication.
J. Cryptology, 2014

Group representations that resist random sampling.
Electronic Colloquium on Computational Complexity (ECCC), 2014

Heat and Noise on Cubes and Spheres: The Sensitivity of Randomly Rotated Polynomial Threshold Functions.
CoRR, 2014

Technical Report: Dealing with Undependable Workers in Decentralized Network Supercomputing.
CoRR, 2014

Online Metric Tracking and Smoothing.
Algorithmica, 2014

Deterministic Blind Rendezvous in Cognitive Radio Networks.
Proceedings of the IEEE 34th International Conference on Distributed Computing Systems, 2014

2013
Special Section on the Forty-Second Annual ACM Symposium on Theory of Computing (STOC 2010).
SIAM J. Comput., 2013

Small-Bias Sets for Nonabelian Groups: Derandomizing the Alon-Roichman Theorem
CoRR, 2013

Malicious takeover of voting systems: arbitrary code execution on optical scan voting terminals.
Proceedings of the 28th Annual ACM Symposium on Applied Computing, 2013

Small-Bias Sets for Nonabelian Groups - Derandomizations of the Alon-Roichman Theorem.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012
Approximating the Permanent via Nonabelian Determinants.
SIAM J. Comput., 2012

The Time Complexity of A* with Approximate Heuristics on Multiple-Solution Search Spaces.
J. Artif. Intell. Res., 2012

Quantum Fourier Transforms and the Complexity of Link Invariants for Quantum Doubles of Finite Groups
CoRR, 2012

Optimal epsilon-biased sets with just a little randomness
CoRR, 2012

Integrity of electronic voting systems: fallacious use of cryptography.
Proceedings of the ACM Symposium on Applied Computing, 2012

Key-Efficient Steganography.
Proceedings of the Information Hiding - 14th International Conference, 2012

2011
A Graph Integral Formulation of the Circuit Partition Polynomial.
Comb. Probab. Comput., 2011

Quantum Fourier sampling, Code Equivalence, and the quantum security of the McEliece and Sidelnikov cryptosystems
CoRR, 2011

The One-Way Communication Complexity of Subgroup Membership.
Chicago J. Theor. Comput. Sci., 2011

Towards Feasible Implementations of Low-Latency Multi-writer Atomic Registers.
Proceedings of The Tenth IEEE International Symposium on Networking Computing and Applications, 2011

Data Migration in Heterogeneous Storage Systems.
Proceedings of the 2011 International Conference on Distributed Computing Systems, 2011

McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

Geometric Topology & Visualizing 1-Manifolds.
Proceedings of the Topological Methods in Data Analysis and Visualization, 2011

2010
On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism.
SIAM J. Comput., 2010

Quantum and randomized lower bounds for local search on vertex-transitive graphs.
Quantum Inf. Comput., 2010

Finding conjugate stabilizer subgroups in PSL and related groups.
Quantum Inf. Comput., 2010

Limitations of quantum coset states for graph isomorphism.
J. ACM, 2010

Approximate Representations and Approximate Homomorphisms
CoRR, 2010

Regarding a Representation-Theoretic Conjecture of Wigderson
CoRR, 2010

The McEliece Cryptosystem Resists Quantum Fourier Sampling Attacks
CoRR, 2010

How close can we come to a parity function when there isn't one?
CoRR, 2010

Circuit partitions and #P-complete products of inner products
CoRR, 2010

Bounds on the Quantum Satisfiability Threshold.
Proceedings of the Innovations in Computer Science, 2010

2009
State-wide elections, optical scan voting systems, and the pursuit of integrity.
IEEE Trans. Information Forensics and Security, 2009

Quantum algorithms for Simon's problem over nonabelian groups.
ACM Trans. Algorithms, 2009

Randomness-optimal Steganography
CoRR, 2009

Efficient Steganography with Provable Security Guarantees
CoRR, 2009

Bounds on the quantum satisfibility threshold
CoRR, 2009

The One-Way Communication Complexity of Group Membership
CoRR, 2009

Automating Voting Terminal Event Log Analysis.
Proceedings of the 2009 Electronic Voting Technology Workshop / Workshop on Trustworthy Elections, 2009

Taking total control of voting systems: firmware manipulations on an optical scan voting terminal.
Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), 2009

2008
Modeling time and topology for animation and visualization with examples on parametric geometry.
Theor. Comput. Sci., 2008

The Symmetric Group Defies Strong Fourier Sampling.
SIAM J. Comput., 2008

A simple constant-probability RP reduction from NP to Parity P.
Electronic Colloquium on Computational Complexity (ECCC), 2008

Pre-Election Testing and Post-Election Audit of Optical Scan Voting Terminal Memory Cards.
Proceedings of the 2008 USENIX/ACCURATE Electronic Voting Workshop, 2008

Randomized Work-Competitive Scheduling for Cooperative Computing on k-partite Task Graphs.
Proceedings of The Seventh IEEE International Symposium on Networking Computing and Applications, 2008

Topological Neighborhoods for Spline Curves: Practice & Theory.
Proceedings of the Reliable Implementation of Real Number Algorithms: Theory and Practice, 2008

2007
The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts.
SIAM J. Comput., 2007

For distinguishing conjugate hidden subgroups, the pretty good measurement is as good as it gets.
Quantum Inf. Comput., 2007

Failure-Sensitive Analysis of Parallel Algorithms with Controlled Memory Access Concurrency.
Parallel Process. Lett., 2007

Quantum Computing and the Hunt for Hidden Symmetry.
Bull. EATCS, 2007

An Authentication and Ballot Layout Attack Against an Optical Scan Voting Terminal.
Proceedings of the 2007 USENIX/ACCURATE Electronic Voting Technology Workshop, 2007

Quantum algorithms for Simon's problem over general groups.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Soft Edge Coloring.
Proceedings of the Approximation, 2007

Tampering with Special Purpose Trusted Computing Devices: A Case Study in Optical Scan E-Voting.
Proceedings of the 23rd Annual Computer Security Applications Conference (ACSAC 2007), 2007

On the Value of Good Advice: The Complexity of A* Search with Accurate Heuristics.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
How to fool an unbounded adversary with a short key.
IEEE Trans. Inf. Theory, 2006

Computational topology for isotopic surface reconstruction.
Theor. Comput. Sci., 2006

Generic quantum Fourier transforms.
ACM Trans. Algorithms, 2006

Distributed scheduling for disconnected cooperation.
Distributed Comput., 2006

On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism
CoRR, 2006

Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping.
Proceedings of the Computational Science, 2006

2005
The Do-All problem with Byzantine processor failures.
Theor. Comput. Sci., 2005

Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups.
SIAM J. Comput., 2005

The Symmetric Group Defies Strong Fourier Sampling: Part II
CoRR, 2005

The Symmetric Group Defies Strong Fourier Sampling: Part I
CoRR, 2005

Computational Topology for Reconstruction of Surfaces with Boundary: Integrating Experiments and Theory.
Proceedings of the 2005 International Conference on Shape Modeling and Applications (SMI 2005), 2005

Efficient Steganography with Provable Security Guarantees.
Proceedings of the Information Hiding, 7th International Workshop, 2005

Quantum Noisy Rational Function Reconstruction.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Improved algorithms for multiplex PCR primer set selection with amplification length constraints.
Proceedings of 3rd Asia-Pacific Bioinformatics Conference, 17-21 January 2005, Singapore, 2005

2004
The chilean highway problem.
Theor. Comput. Sci., 2004

Inapproximability results for equations over finite groups.
Theor. Comput. Sci., 2004

Analysis of memory access concurrency in robust parallel algorithms.
Stud. Inform. Univ., 2004

Classical and quantum function reconstruction via character evaluation.
J. Complex., 2004

The complexity of synchronous iterative Do-All with crashes.
Distributed Comput., 2004

Approximation Algorithms for Minimum PCR Primer Set Selection with Amplification Length and Uniqueness Constraints
CoRR, 2004

Random Cayley Graphs are Expanders: a Simple Proof of the Alon-Roichman Theorem.
Electr. J. Comb., 2004

The power of basis selection in fourier sampling: hidden subgroup problems in affine groups.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003
Computational topology: ambient isotopic approximation of 2-manifolds.
Theor. Comput. Sci., 2003

The Hidden Subgroup Problem and Quantum Computation Using Group Representations.
SIAM J. Comput., 2003

A note on the set systems used for broadcast encryption.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Distributed Cooperation and Adversity: Complexity Trade-Offs.
Proceedings of the PCK50, 2003

2002
Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model.
SIAM J. Comput., 2002

The Complexity of Solving Equations over Finite Groups.
Inf. Comput., 2002

Distributed Computation Meets Design Theory: Local Scheduling for Disconnected Cooperation.
Bull. EATCS, 2002

Quantum Walks on the Hypercube.
Proceedings of the Randomization and Approximation Techniques, 6th International Workshop, 2002

Optimally work-competitive scheduling for cooperative computing with merging groups.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Failure sensitive analysis for parallel algorithm with controlled memory access concurrency.
Proceedings of the Procedings of the 6th International Conference on Principles of Distributed Systems. OPODIS 2002, 2002

A Note on the Representational Incompatibility of Function Approximation and Factored Dynamics.
Proceedings of the Advances in Neural Information Processing Systems 15 [Neural Information Processing Systems, 2002

2001
Complexity Bounds on General Hard-Core Predicates.
J. Cryptology, 2001

Perfect Information Leader Election in log* n+O (1) Rounds.
J. Comput. Syst. Sci., 2001

Efficient Encryption for Rich Message Spaces Under General Assumptions.
IACR Cryptol. ePrint Arch., 2001

Optimal Scheduling for Distributed Cooperation Without Communication.
Proceedings of the SIROCCO 8, 2001

Optimal scheduling for disconnected cooperation.
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

Local Scheduling for Distributed Cooperation.
Proceedings of the IEEE International Symposium on Network Computing and Applications (NCA 2001), 2001

2000
Extraction of optimally unbiased bits from a biased source.
IEEE Trans. Inf. Theory, 2000

An Easy Reduction of an Isoperimetric Inequality on the Sphere to Extremal Set Theory.
Am. Math. Mon., 2000

An ergodic theorem for read-once non-uniform deterministic finite automata.
Inf. Process. Lett., 2000

Alternation in interaction.
Comput. Complex., 2000

Distributed Cooperation During the Absence of Communication.
Proceedings of the Distributed Computing, 14th International Conference, 2000

Normal subgroup reconstruction and quantum computation using group representations.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Spectral Bounds on General Hard Core Predicates.
Proceedings of the STACS 2000, 2000

Distributed cooperation in the absence of communication (brief announcement).
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

The Complexity of Distributed Cooperation in the Presence of Failures.
Proceedings of the Procedings of the 4th International Conference on Principles of Distributed Systems, 2000

1999
Approximating Latin Square Extensions.
Algorithmica, 1999

1998
On embedding complete graphs into hypercubes.
Discret. Math., 1998

A Note on the Asymptotics and Computational Complexity of Graph Distinguishability.
Electr. J. Comb., 1998

Symmetric Alternation Captures BPP.
Comput. Complex., 1998

Perfect Information Leader Election in log*n + O(1) Rounds.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997
A Note on Optical Routing on Trees.
Inf. Process. Lett., 1997

Faster Algorithms for Optical Switch Configuration.
Proceedings of the 1997 IEEE International Conference on Communications: Towards the Knowledge Millennium, 1997

1995
Necessary and Sufficient Condtions for Collision-Free Hashing.
J. Cryptology, 1995

The Relativized Relationship Between Probabilistically Chackable Debate Systems, IP and PSPACE.
Inf. Process. Lett., 1995

1994
Efficient probabilistic checkable proofs and applications to approximation.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

1992
Necessary and Sufficient Conditions For Collision-Free Hashing.
Proceedings of the Advances in Cryptology, 1992

1991
A Critical Look at Experimental Evaluations of EBL.
Mach. Learn., 1991


  Loading...