Effort-release public-key encryption from cryptographic puzzles

Authors:
Jothi Rangasamy;Douglas Stebila;Colin Boyd;Juan Manuel González-Nieto;Lakshmi Kuppusamy
Affiliations:
Information Security Institute, Queensland University of Technology, Brisbane, Queensland, Australia;Information Security Institute, Queensland University of Technology, Brisbane, Queensland, Australia;Information Security Institute, Queensland University of Technology, Brisbane, Queensland, Australia;Information Security Institute, Queensland University of Technology, Brisbane, Queensland, Australia;Information Security Institute, Queensland University of Technology, Brisbane, Queensland, Australia
Venue:
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Year:
2012

Citing 13
Cited 0

Verifiable partial key escrow

Proceedings of the 4th ACM conference on Computer and communications security
REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform

CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Pricing via Processing or Combatting Junk Mail

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Time-lock Puzzles and Timed-release Crypto

Time-lock Puzzles and Timed-release Crypto
Encapsulated Key Escrow

Encapsulated Key Escrow
Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack

SIAM Journal on Computing
Provably Secure Timed-Release Public Key Encryption

ACM Transactions on Information and System Security (TISSEC)
Timed-Release Encryption Revisited

ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
Security Notions and Generic Constructions for Client Puzzles

ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols

CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
An integrated approach to cryptographic mitigation of denial-of-service attacks

Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
The security of triple encryption and a framework for code-based game-playing proofs

EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Improved anonymous timed-release encryption

ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

Timed-release cryptography addresses the problem of "sending messages into the future": a message 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 PKE setting) can decrypt.