Effort-release public-key encryption from cryptographic puzzles

Rangasamy, Jothi, Stebila, Douglas, Boyd, Colin, Gonzalez Nieto, Juan M., & Kuppusamy, Lakshmi (2012) Effort-release public-key encryption from cryptographic puzzles. Lecture Notes in Computer Science, 7372, pp. 194-207.

View at publisher


Timed-release cryptography addresses the problem of “sending messages into the future”: information is encrypted so that it can only be decrypted after a certain amount of time, either (a) with the help of a trusted third party time server, or (b) after a party performs the required number of sequential operations. We generalise the latter case to what we call effort-release public key encryption (ER-PKE), where only the party holding the private key corresponding to the public key can decrypt, and only after performing a certain amount of computation which may or may not be parallelisable. Effort-release PKE generalises both the sequential-operation-based timed-release encryption of Rivest, Shamir, and Wagner, and also the encapsulated key escrow techniques of Bellare and Goldwasser.

We give a generic construction for ER-PKE based on the use of moderately hard computational problems called puzzles. Our approach extends the KEM/DEM framework for public key encryption by introducing a difficulty notion for KEMs which results in effort-release PKE. When the puzzle used in our generic construction is non-parallelisable, we recover timed-release cryptography, with the addition that only the designated receiver (in the public key setting) can decrypt.

Impact and interest:

1 citations in Scopus
Search Google Scholar™

Citation counts are sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

ID Code: 51573
Item Type: Journal Article
Refereed: Yes
Additional Information: Information Security and Privacy : 17th Australasian Conference, ACISP 2012, Wollongong, NSW, Australia, July 9-11, 2012. Proceedings
Keywords: Cryptographic puzzles, Difficulty, Timed release encryption, Key escrow
DOI: 10.1007/978-3-642-31448-3_15
ISSN: 0302-9743
Subjects: Australian and New Zealand Standard Research Classification > ENGINEERING (090000) > ELECTRICAL AND ELECTRONIC ENGINEERING (090600)
Divisions: Current > QUT Faculties and Divisions > Chancellery
Current > Schools > School of Electrical Engineering & Computer Science
Current > QUT Faculties and Divisions > Science & Engineering Faculty
Copyright Owner: Copyright 2012 Springer
Deposited On: 11 Jul 2012 22:27
Last Modified: 24 Oct 2013 05:34

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page