HP Labs Technical Reports
Click here for full text:
Sending Message into a Definite Future: Non Parallelizable Case
Mao, Wenbo
HPL200086
Keyword(s): timelock puzzle; zeroknowledge proof
Abstract: 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 timelock puzzle scheme and its applications in timedrelease 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 timedrelease crypto problems.
11 Pages
Back to Index
