English
Related papers

Related papers: Dining Cryptographers with 0.924 Verifiable Collis…

200 papers

Untraceable communication is about hiding the identity of the sender or the recipient of a message. Currently most systems used in practice (e.g., TOR) rely on the principle that a message is routed via several relays to obfuscate its path…

Cryptography and Security · Computer Science 2016-10-21 Christian Franck , Uli Sorger

Biometric verification has been widely deployed in current authentication solutions as it proves the physical presence of individuals. To protect the sensitive biometric data in such systems, several solutions have been developed that…

Cryptography and Security · Computer Science 2021-01-27 Amina Bassit , Florian Hahn , Joep Peeters , Tom Kevenaar , Raymond N. J. Veldhuis , Andreas Peter

As Lightning network payments are neither broadcasted nor publicly stored. Thus LN has been seen not only as scalability but also as privacy solution for Bitcoin. The protocol guarantees that only the latest channel state can be confirmed…

Cryptography and Security · Computer Science 2020-04-02 Sergei Tikhomirov , Rene Pickhardt , Alex Biryukov , Mariusz Nowostawski

In this paper, we describe an attack against one of the Oblivious-Transfer-based blind signatures scheme, proposed in [1]. An attacker with a primitive capability of producing specific-range random numbers, while exhibiting a partial MITM…

Cryptography and Security · Computer Science 2009-11-10 Stylianos Basagiannis , Panagiotis Katsaros , Andrew Pombortsis

Learning from data owned by several parties, as in federated learning, raises challenges regarding the privacy guarantees provided to participants and the correctness of the computation in the presence of malicious parties. We tackle these…

Cryptography and Security · Computer Science 2022-10-31 César Sabater , Aurélien Bellet , Jan Ramon

A novel private communication framework is proposed where privacy is induced by transmitting over a channel instances of linear inverse problems that are identifiable to the legitimate receiver but unidentifiable to an eavesdropper. The gap…

Information Theory · Computer Science 2024-07-24 Maxime Ferreira Da Costa , Jianxiu Li , Urbashi Mitra

We investigate the security of generalized quantum multiple-access channels. We provide the formula for the achievable rate region of secure communication in the scenario of two senders and a single receiver. We explicitly specify a…

Quantum Physics · Physics 2021-06-28 Tamoghna Das , Karol Horodecki , Robert Pisarczyk

We address the problem of Reliable Broadcast in asynchronous message-passing systems with $n$ nodes, of which up to $t$ are malicious (faulty), in addition to a message adversary that can drop some of the messages sent by correct…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-10-15 Timothé Albouy , Davide Frey , Ran Gelles , Carmit Hazay , Michel Raynal , Elad Michael Schiller , François Taïani , Vassilis Zikas

Network coding is a new technique to transmit data through a network by letting the intermediate nodes combine the packets they receive. Given a network, the network coding solvability problem decides whether all the packets requested by…

Information Theory · Computer Science 2013-07-24 Maximilien Gadouleau

Quantum communication protocols can be designed to detect eavesdropping attacks, something that classical technologies are unable to do since classical information can be replicated in a non-destructive manner. Eavesdropping detection is,…

Quantum Physics · Physics 2025-12-19 Santanu Majhi , Debajyoti Bera

Assume that a graph $G$ models a detection system for a facility with a possible ``intruder," or a multiprocessor network with a possible malfunctioning processor. We consider the problem of placing detectors at a subset of vertices in $G$…

Combinatorics · Mathematics 2022-08-15 Devin Jean , Suk Seo

In random-access networks, such as the IEEE 802.11 network, different users may transmit their packets simultaneously, resulting in packet collisions. Traditionally, the collided packets are simply discarded. To improve performance,…

Information Theory · Computer Science 2010-09-22 Lu Lu , Soung Chang Liew , Shengli Zhang

Most existing secure neural network inference protocols based on secure multi-party computation (MPC) typically support at most four participants, demonstrating severely limited scalability. Liu et al. (USENIX Security'24) presented the…

Cryptography and Security · Computer Science 2026-04-23 Qinghui Zhang , Xiaojun Chen , Yansong Zhang , Xudong Chen

E-commerce, a type of trading that occurs at a high frequency on the Internet, requires guaranteeing the integrity, authentication and non-repudiation of messages through long distance. As current e-commerce schemes are vulnerable to…

Quantum Physics · Physics 2024-01-17 Xiao-Yu Cao , Bing-Hong Li , Yang Wang , Yao Fu , Hua-Lei Yin , Zeng-Bing Chen

Recently, Indesteege et al. [1] had described attacks against 23 and 24-step SHA-512 at SAC '08. Their attacks are based on the differential path by Nikolic and Biryukov [2]. The reported complexities are $2^{44.9}$ and $2^{53}$ calls to…

Cryptography and Security · Computer Science 2008-09-02 Somitra Kumar Sanadhya , Palash Sarkar

We demonstrate the feasibility of end-to-end communication in highly unreliable networks. Modeling a network as a graph with vertices representing nodes and edges representing the links between them, we consider two forms of unreliability:…

Networking and Internet Architecture · Computer Science 2013-10-29 Paul Bunn , Rafail Ostrovsky

Detection methods are available for several known covert channels. However, a type of covert channel that received little attention within the last decade is the "message ordering" channel. Such a covert channel changes the order of PDUs…

Cryptography and Security · Computer Science 2021-03-02 Steffen Wendzel

Paramount to vehicle safety, broadcasted Cooperative Awareness Messages (CAMs) and Decentralized Environmental Notification Messages (DENMs) are pseudonymously authenticated for security and privacy protection, with each node needing to…

Cryptography and Security · Computer Science 2025-05-29 Hongyu Jin , Panos Papadimitratos

We construct the first constant-round protocols for secure quantum computation in the two-party (2PQC) and multi-party (MPQC) settings with security against malicious adversaries. Our protocols are in the common random string (CRS) model. -…

Quantum Physics · Physics 2021-08-17 James Bartusek , Andrea Coladangelo , Dakshita Khurana , Fermi Ma

This paper investigates the problem of source-channel coding for secure transmission with arbitrarily correlated side informations at both receivers. This scenario consists of an encoder (referred to as Alice) that wishes to compress a…

Information Theory · Computer Science 2013-11-11 Joffrey Villard , Pablo Piantanida , Shlomo Shamai
‹ Prev 1 4 5 6 7 8 10 Next ›