Information-Theoretically Secure String Commitments Based on Packet Reordering Channels

doi:10.1109/ACCESS.2021.3118959

Information-Theoretically Secure String Commitments Based on Packet Reordering Channels

2021-01-01

0

OA

AI

V

Vinícius de Morais Alves *

Anderson C. A. Nascimento

DOI：10.1109/ACCESS.2021.3118959

Original

Original request for help

Save

Abstract

En 中文

Realizing fundamental cryptographic primitives with unconditional security is a central topic in information-theoretic cryptography. These primitives can be realized based on physical assumptions, such as the existence of noisy channels, an upper bound on the storage capacity, or the laws of quantum mechanics. Palmieri and Pereira [1] demonstrated that delays in communication channels can be used as a reasonable and effective assumption to obtain an unconditionally secure oblivious transfer protocol against honest-but-curious adversaries. While any oblivious transfer protocol secure against malicious adversaries can be used to implement commitment, the reduction does not work if the oblivious transfer protocol is only secure against honest-but-curious adversaries. Thus, the question of obtaining a secure commitment protocol based on channel delays is still open. In this paper, we provide a concrete protocol for implementing string commitments based on packet reordering - a consequence of channel delays in packet networks.

Keywords:

Protocols

Security

Noise measurement

Random variables

Cryptography

Entropy

Delays

Commitment schemes

packet reordering

unconditional security

Information-Theoretically Secure String Commitments Based on Packet Reordering Channels

Abstract

Journal

Organization