{"title":"Chained time lock puzzle with small puzzle size","authors":"Ramakant Kumar, Sahadeo Padhye","doi":"10.1016/j.ic.2025.105301","DOIUrl":null,"url":null,"abstract":"<div><div>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.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"304 ","pages":"Article 105301"},"PeriodicalIF":1.0000,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information and Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0890540125000379","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/4/17 0:00:00","PubModel":"Epub","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 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中的大小。
期刊介绍：
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
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
