.png){kind=icon}
返回
Information-Theoretically Secure String Commitments Based on Packet Reordering Channels
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2021.3118959.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Protocols
Security
Noise measurement
Random variables
Cryptography
Entropy
Delays
Commitment schemes
packet reordering
unconditional security
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
分享收藏A green route to synthesize nitrogen-enriched graphene-like carbon nanosheets from bio-oil for supercapacitors从生物油中合成富氮类石墨烯碳纳米片的绿色途径
PREAI
分享收藏Theory of diffusion charging of arbitrarily shaped conductive aerosol particles by unipolar ions
PREAI
分享收藏Magnetic susceptibility study of KNiAsO4, HMnAsO4�H2O and their organic-intercalated derivatives
PREAI
分享收藏
查看更多内容