Tempora-Fusion:具有高效可验证同态线性组合的时间锁谜题
Tempora-Fusion: Time-Lock Puzzle with Efficient Verifiable Homomorphic Linear Combination
AI总结:
Tempora-Fusion提出首个支持高效公开验证同态线性组合的时间锁谜题方案,通过有限域映射与多项式编码实现无需可信设置的验证,原型验证耗时低于3毫秒。
摘要:
我们提出了Tempora-Fusion,这是第一个同态TLP方案,能够对单个谜题解和同态线性组合进行高效的公开验证。Tempora-Fusion允许客户端独立生成谜题,随后授权具有自身释放时间的线性组合,并使得任何一方都能在无需可信设置或昂贵的非对称密钥证明系统的情况下验证已发布的结果。在技术上,我们的构造将独立生成的基于RSA的谜题映射到一个公共有限域,在评估过程中使用不经意线性评估来刷新盲化因子,并通过将消息编码为具有承诺秘密根的多项式来嵌入隐藏的验证结构。我们形式化了可验证的同态线性组合TLP,证明了该模型中的隐私性和解的有效性,并涵盖了评估结果可能在底层客户端谜题被打开之前发布的场景。我们的原型实现表明,验证一个评估结果所需时间不到3毫秒。
英文摘要:
We present Tempora-Fusion, the first homomorphic TLP scheme with efficient public verification of both individual puzzle solutions and homomorphic linear combinations. Tempora-Fusion lets clients generate puzzles independently, later authorize a linear combination with its own release time, and enables any party to verify the released result without trusted setup or costly asymmetric-key proof systems. Technically, our construction maps independently generated RSA-based puzzles into a common finite field, uses oblivious linear evaluation to refresh blinding factors during evaluation, and embeds a hidden verification structure by encoding messages as polynomials with committed secret roots. We formalize verifiable homomorphic linear-combination TLPs, prove privacy and solution validity in this model, and capture the setting in which the evaluation result may be released before the underlying client puzzles are opened. Our prototype implementation shows that verifying an evaluated result takes less than 3 ms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。