Steven Gordon

ORCID: 0000-0003-4090-1199
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Cryptography and Data Security
  • Complexity and Algorithms in Graphs
  • Privacy-Preserving Technologies in Data
  • Mobile Ad Hoc Networks
  • Internet Traffic Analysis and Secure E-voting
  • Wireless Networks and Protocols
  • IPv6, Mobility, Handover, Networks, Security
  • Cryptographic Implementations and Security
  • Blockchain Technology Applications and Security
  • Network Security and Intrusion Detection
  • Petri Nets in System Modeling
  • Distributed systems and fault tolerance
  • Advanced Authentication Protocols Security
  • Network Traffic and Congestion Control
  • Opportunistic and Delay-Tolerant Networks
  • Cooperative Communication and Network Coding
  • Chaos-based Image/Signal Encryption
  • Advanced MIMO Systems Optimization
  • Anomaly Detection Techniques and Applications
  • Vehicular Ad Hoc Networks (VANETs)
  • Energy Efficient Wireless Sensor Networks
  • Formal Methods in Verification
  • Security and Verification in Computing
  • Mobile Agent-Based Network Management
  • Advanced Wireless Network Optimization

Central Queensland University
2016-2025

George Mason University
2015-2022

Bridge University
2022

Visa (United Kingdom)
2022

Bar-Ilan University
2022

Thammasat University
2007-2016

Japan Advanced Institute of Science and Technology
2015

Trellis Bioscience (United States)
2014-2015

Columbia University
2011

University of Maryland, College Park
2006-2011

Traditional approaches to generic secure computation begin by representing the function f being computed as a circuit. If depends on each of its input bits, this implies protocol with complexity at least linear in size. In fact, running time is inherent for non-trivial functions since party must "touch" every bit their lest information about other party's be leaked. This seems rule out many applications (e.g., database search) scenarios where inputs are huge.

10.1145/2382196.2382251 article EN Proceedings of the ACM Conference on Computer and Communications Security 2012-10-15

In recent years, the widespread deployment of Internet Things (IoT) applications has contributed to development smart cities. A city utilizes IoT-enabled technologies, communications and maximize operational efficiency enhance both service providers' quality services people's wellbeing life. With growth networks, however, comes increased risk cybersecurity threats attacks. IoT devices within a network are connected sensors linked large cloud servers exposed malicious attacks threats. Thus,...

10.3390/ijerph17249347 article EN International Journal of Environmental Research and Public Health 2020-12-14

In the setting of secure two-party computation, two mutually distrusting parties wish to compute some function their inputs while preserving, extent possible, various security properties such as privacy, correctness, and more. One desirable property is fairness which guarantees, informally, that if one party receives its output, then other does too. Cleve [1986] showed complete cannot be achieved in general without an honest majority. Since then, accepted folklore has been nothing...

10.1145/2049697.2049698 article EN Journal of the ACM 2011-12-01

Introduction Carers support programmes are commonly delivered in person, limiting attendance opportunities for rural carers and others who have access barriers. Studies using technology typically use text-based forums rather than real-time such as videoconferencing (VC). Delivering home-based by VC may mitigate barriers accessing support. We report implementation findings delivering a telehealth peer-support programme isolated of people with dementia. Methods Participants were recruited...

10.1177/1357633x19873793 article EN Journal of Telemedicine and Telecare 2019-10-01

We explore a new security model for secure computation on large datasets. assume that two servers have been employed to compute private data was collected from many users, and, in order improve the efficiency of their computation, we establish tradeoff with privacy. Specifically, instead claiming learn nothing about input values, claim what they do preserves differential privacy input. Leveraging this relaxation allows us build protocol leaks some information form access patterns memory,...

10.1145/3243734.3243851 article EN Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security 2018-10-15

We construct new protocols for two parties to securely compute on the items in their intersection. Our make use of an untrusted third party that has no input. The this allows us highly efficient are secure against a single malicious corruption.

10.1145/3319535.3345661 article EN Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security 2019-11-06

10.1007/s00145-010-9079-5 article EN Journal of Cryptology 2010-09-14

In high-density road networks, with each vehicle broadcasting multiple messages per second, the arrival rate of safety can easily exceed at which digital signatures be verified. Since not all verified, algorithms for selecting to verify are required ensure that receives appropriate awareness about neighbouring vehicles. This paper presents a novel scheme select important verification in vehicular ad hoc networks (VANETs). The proposed uses location and direction sender, as well proximity...

10.3390/s18041195 article EN cc-by Sensors 2018-04-13
Coming Soon ...