Publications

Disclaimer:

IEEE Copyright Notice

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

ACM Copyright Notice

These are the authors' versions of the work. The copyright is with ACM. They are posted here by permission of ACM for your personal use. Not for redistribution. See individual publication details for information on the publication of the definitive versions.

Springer-Verlag LNCS Copyright Notice

The copyright of these contributions has been transferred to Springer-Verlag Berlin Heidelberg New York. The copyright transfer covers the exclusive right to reproduce and distribute the contribution, including reprints, translations, photographic reproductions, microform, electronic form (offline, online), or any other reproductions of similar nature. Online available from Springer-Verlag LNCS series.

Work that appeared before the 1st of September 2003 was published while the authors were with the Lehrstuhl Praktische Informatik IV at the University of Mannheim.

Offline Submission with RSA Time-Lock Puzzles

Author(s): Yves Igor Jerschow, Martin Mauve.
Title: Offline Submission with RSA Time-Lock Puzzles
Published: TSP 2010: Proceedings of the Third IEEE International Symposium on Trust, Security and Privacy for Emerging Applications, Bradford, UK, June 2010
Keyword(s):
Abstract: We introduce a non-interactive RSA time-lock puzzle scheme whose level of difficulty can be arbitrarily chosen by artificially enlarging the public exponent. Solving a puzzle for a message m means for Bob to encrypt m withAlice's public puzzle key by repeated modular squaring. The number of squarings to perform determines the puzzle complexity. This puzzle is non-parallelizable. Thus, the solution time cannot be shortened significantlyby employing many machines and it varies only slightly across modern CPUs.Alice can quickly verify the puzzle solution by decrypting the ciphertextwith a regular private key operation. Our main contribution is an offlinesubmission protocol which enables an author being currently offline to committo his document before the deadline by continuously solving an RSA puzzlebased on that document. When regaining Internet connectivity, he submits hisdocument along with the puzzle solution which is a proof for the timelycompletion of the document. We have implemented a platform-independent toolperforming all parts of our offline submission protocol: puzzle benchmark,issuing a time-lock RSA certificate, solving a puzzle and finally verifying thesolution for a submitted document. Two other applications we propose for RSAtime-lock puzzles are trial certificates from a well-known CA and a CEOdisclosing the signing private key to his deputy.
Note: This material is presented to ensure timely dissemination of scholarly and technicalwork. Copyright and all rights therein are retained by authors or by other copyrightholders. All persons copying this information are expected to adhere to the terms andconstraints invoked by each author's copyright. In most cases, these works may not bereposted without the explicit permission of the copyright holder.
Bib entry: [XML] [BibTeX]
Download: [PDF]
Responsible for the content: E-MailWE Informatik