Chained time lock puzzle with small puzzle size

IF 0.8 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Information and Computation Pub Date : 2025-04-17 DOI:10.1016/j.ic.2025.105301

Ramakant Kumar, Sahadeo Padhye

引用次数: 0

Abstract

A time lock puzzle (TLP) is an interesting cryptographic primitive used to lock messages for a limited time period. After the desired time interval, the puzzle solver can know the message. Chained time lock puzzle (C-TLP) is multi instance time lock puzzle where the solution of any instance depends on the previous instance. In this paper, we design a C-TLP with security relying on the integer factorization problem (IFP). The size of the output puzzle is smaller than the size in the existing C-TLPs.

查看原文本刊更多论文

锁链时间锁拼图小拼图大小

时间锁谜题（TLP）是一种有趣的加密原语，用于在有限的时间段内锁定消息。在期望的时间间隔之后，解谜者可以知道消息。链式时间锁难题（chain time lock puzzle, C-TLP）是一种多实例时间锁难题，任何实例的解都依赖于前一个实例。本文设计了一个基于整数分解问题（IFP）的具有安全性的C-TLP。输出谜题的大小小于现有C-TLPs中的大小。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Information and Computation 工程技术-计算机：理论方法

CiteScore

2.30

自引率

0.00%

发文量

119

审稿时长

140 days

期刊介绍： Information and Computation welcomes original papers in all areas of theoretical computer science and computational applications of information theory. Survey articles of exceptional quality will also be considered. Particularly welcome are papers contributing new results in active theoretical areas such as -Biological computation and computational biology- Computational complexity- Computer theorem-proving- Concurrency and distributed process theory- Cryptographic theory- Data base theory- Decision problems in logic- Design and analysis of algorithms- Discrete optimization and mathematical programming- Inductive inference and learning theory- Logic & constraint programming- Program verification & model checking- Probabilistic & Quantum computation- Semantics of programming languages- Symbolic computation, lambda calculus, and rewriting systems- Types and typechecking