Sending Message into a Definite Future: Non- Parallelizable Case

Mao, Wenbo

HP Development Company

关键词: time-lock puzzle;    zero-knowledge proof;   

RP-ID  :  HPL-2000-86

学科分类：计算机科学（综合）

美国|英语

来源: HP Labs

【 摘 要 】

Please Note. This abstract contains mathematical formulae which cannot be represented here. We construct a proof of membership protocol that uses log2 t steps to prove an element to have the structure a2t (mod n) given public values n, a, t where n is the product of two large secret primes. Such a proof serves a concrete basis of trust for a time-lock puzzle scheme and its applications in timed-release cryptography. The achieved efficiency expressed in log2 t (number of modulo exponentiation) manifests plainly that the proposed proof technique is practical in the applications of timed-release crypto problems. 11 Pages