Andrew D. Loveless

Orcid: 0000-0003-0627-5702

According to our database1, Andrew D. Loveless authored at least 7 papers between 2006 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
CrossTalk: Making Low-Latency Fault Tolerance Cheap by Exploiting Redundant Networks.
ACM Trans. Embed. Comput. Syst., October, 2023

PCSPOOF: Compromising the Safety of Time-Triggered Ethernet.
Proceedings of the 44th IEEE Symposium on Security and Privacy, 2023

Chex-Mix: Combining Homomorphic Encryption with Trusted Execution Environments for Oblivious Inference in the Cloud.
Proceedings of the 8th IEEE European Symposium on Security and Privacy, 2023

2021
IGOR: Accelerating Byzantine Fault Tolerance for Real-Time Systems with Eager Execution.
Proceedings of the 27th IEEE Real-Time and Embedded Technology and Applications Symposium, 2021

2020
Optimal and Error-Free Multi-Valued Byzantine Consensus Through Parallel Execution.
IACR Cryptol. ePrint Arch., 2020

2007
A compositeness test that never fails for Carmichael numbers.
Math. Comput., 2007

2006
Now, What Year Is It? 11125.
Am. Math. Mon., 2006


  Loading...