Designing a Secure Device-to-Device File Transfer Mechanism

• URL: http://arxiv.org/abs/2411.13827v1
• Date: Thu, 21 Nov 2024 04:24:37 GMT
• Title: Designing a Secure Device-to-Device File Transfer Mechanism
• Authors: Chaitanya Rahalkar, Anushka Virgaonkar,
• Abstract summary: We propose a protocol that uses a relay server to relay files from client to the server. In this paper we study available file transfer approaches and their known flaws.
• Score: 0.6138671548064355
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Secure, reliable, and fast transfer of files across the Internet is a problem attempted to be solved through many application-layer protocols. In this paper, we aim to design a secure, reliable, opendesign, and performant file transfer protocol that is inspired by the WebRTC protocol stack. Traditionally, transferring files involves a publicly exposed (available on the public network) third-party server that serves the uploaded files to the receiver. Here, the third party server has to bear the storage and bandwidth cost to transfer the files between the two parties. We propose a protocol that uses a relay server to relay the files from the client to the server. A relay server has several advantages over a regular file-hosting server. Firstly, a relay server does not retain the uploaded files, it simply relays them. Secondly, a relay server has a full-duplex communication channel and therefore the receiver is not required to wait for the sender to upload the files completely. In this paper, we study available file transfer approaches and their known flaws. We propose our idea and compare our stack with the WebRTC stack. Finally, we perform empirical analysis and, benchmark our device-to-device transfer approach along with other available options including WebRTC.

Related papers

• RelayGR: Scaling Long-Sequence Generative Recommendation via Cross-Stage Relay-Race Inference [46.66085102313264]
  Real-time recommender systems execute cascades (retrieval, pre-processing, fine-grained ranking) under strict tail-latency SLOs.<n>We present RelayGR, a production system that enables in-HBM relay-race inference for GR.<n> RelayGR supports up to 1.5$times$ longer sequences and improves SLO-compliant throughput by up to 3.6$times$.
  arXiv  Detail & Related papers  (2026-01-05T01:34:06Z)
• TLoRa: Implementing TLS Over LoRa for Secure HTTP Communication in IoT [13.530498941051677]
  TLoRa is an end-to-end architecture for HTTPS communication over LoRa.<n>It enables a seamless and secure communication channel between WiFi-enabled end devices and the Internet over LoRa.
  arXiv  Detail & Related papers  (2025-10-02T19:47:03Z)
• SecEmb: Sparsity-Aware Secure Federated Learning of On-Device Recommender System with Large Embedding [3.2226173328807253]
  Federated recommender system (FedRec) has emerged as a solution to protect user data through collaborative training techniques.<n>A typical FedRec involves transmitting the full model and entire weight updates between edge devices and the server.<n>Existing sparsity-aware federated protocols generally sacrifice privacy for efficiency.
  arXiv  Detail & Related papers  (2025-05-18T15:05:11Z)
• Recipe: Hardware-Accelerated Replication Protocols [0.4900774081652471]
  This paper introduces Recipe, a novel approach to transforming CFT protocols to operate securely in Byzantine settings. Recipe rethinks CFT protocols in the context of modern cloud hardware, including many-core servers, RDMA-capable networks, and Trusted Execution Environments (TEEs) The results demonstrate up to 24x higher throughput compared to PBFT and 5.9x better performance than state-of-the-art BFT protocols.
  arXiv  Detail & Related papers  (2025-02-13T12:04:53Z)
• Robust and Actively Secure Serverless Collaborative Learning [48.01929996757643]
  Collaborative machine learning (ML) is widely used to enable institutions to learn better models from distributed data. While collaborative approaches to learning intuitively protect user data, they remain vulnerable to either the server, the clients, or both. We propose a peer-to-peer (P2P) learning scheme that is secure against malicious servers and robust to malicious clients.
  arXiv  Detail & Related papers  (2023-10-25T14:43:03Z)
• Federated Inference with Reliable Uncertainty Quantification over Wireless Channels via Conformal Prediction [43.36472219160387]
  We study a wireless federated inference scenario in which devices and a server share a pre-trained machine learning model. We introduce a novel protocol, termed wireless federated conformal prediction (WFCP) WFCP is proved to provide formal reliability guarantees in terms of coverage of the predicted set produced by the server.
  arXiv  Detail & Related papers  (2023-08-08T13:03:36Z)
• Zero-Shot Neural Architecture Search: Challenges, Solutions, and Opportunities [58.67514819895494]
  Key idea behind zero-shot NAS approaches is to design proxies that can predict the accuracy of some given networks without training the network parameters. This paper aims to comprehensively review and compare the state-of-the-art (SOTA) zero-shot NAS approaches.
  arXiv  Detail & Related papers  (2023-07-05T03:07:00Z)
• TurboTLS: TLS connection establishment with 1 less round trip [2.307447796778038]
  We show how to establish TLS connections using one less round trip. In our approach, which we call TurboTLS, the initial client-to-server and server-to-client flows of the TLS handshake are sent over UDP rather than TCP.
  arXiv  Detail & Related papers  (2023-02-10T15:16:16Z)
• Two-Server Oblivious Transfer for Quantum Messages [71.78056556634196]
  We propose two-server oblivious transfer protocols for quantum messages. Oblivious transfer is considered as a cryptographic primitive task for quantum information processing over quantum network.
  arXiv  Detail & Related papers  (2022-11-07T05:12:24Z)
• Multi-server Blind Quantum Computation Protocol With Limited Classical Communication Among Servers [0.0]
  We propose a protocol, by extend this two-server protocol to multiple servers, which remains secure even if some servers communicate with each other after the computation. Dummy gates and a circuit modeled after brickwork states play a crucial role in the new protocol.
  arXiv  Detail & Related papers  (2021-06-10T06:58:22Z)
• Quantum Private Information Retrieval for Quantum Messages [71.78056556634196]
  Quantum private information retrieval (QPIR) for quantum messages is the protocol in which a user retrieves one of the multiple quantum states from one or multiple servers without revealing which state is retrieved. We consider QPIR in two different settings: the blind setting, in which the servers contain one copy of the message states, and the visible setting, in which the servers contain the description of the message states.
  arXiv  Detail & Related papers  (2021-01-22T10:28:32Z)
• Serverless Electronic Mail [0.0]
  We describe a simple approach to peer-to-peer electronic mail that would allow users to exchange messages without relying upon third-party mail server operators. The system allows participants to establish and use multiple unlinked identities for communication with each other. The design offers a robust, unintrusive method to use self-certifying Tor onion service names to bootstrap a web of trust.
  arXiv  Detail & Related papers  (2020-07-09T07:35:29Z)
• Capacity of Quantum Private Information Retrieval with Colluding Servers [71.78056556634196]
  Quantum private information retrieval (QPIR) is a protocol in which a user retrieves one of multiple files from non-communicating servers. As variants of QPIR with stronger security requirements, symmetric QPIR is a protocol in which no other files than the target file are leaked to the user. We construct a capacity-achieving QPIR protocol by the stabilizer formalism and prove the optimality of our protocol.
  arXiv  Detail & Related papers  (2020-01-13T18:12:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.