hp home products & services support solutions how to buy
hp logo - invent
corner hp labs corner
search search
contact hp contact hp
hp labs home hp labs home
about hp labs about hp labs
research research
news and events news and events
careers @ labs careers @ labs
technical reports technical reports
talks and speeches talks and speeches
worldwide sites worldwide sites
corner corner
HP Labs Technical Reports

Click here for full text: Postscript PDF

Verifiable Partial Escrow of Integer Factors

Mao, Wenbo


Keyword(s): partial key escrow; RSA; zero-knowledge protocols

Abstract: Please Note. This abstract contains mathematical formulae which cannot be represented here. We construct an efficient interactive protocol for realizing verifiable partial escrow of the factors of an integer n with time-delayed and threshold key recovery features. The computational cost of the new scheme amounts to 10k log2P multiplications of numbers of size of P, where P is a protocol parameter which permits n of size up to (log2 P) -4 to be dealt with and k is a security parameter which controls the error probability for correct key escrow under 1/2 k. The new scheme realizes a practical method for fine tuning the time complexity for factoring an integer, where the complexity tuning has no respect to the size of integer.

19 Pages

Back to Index

printing icon
printing instructions printing instructions
Privacy Statement Legal Notices © 1994-2000 Hewlett-Packard Company