Revocable Quantum Timed-Release Encryption

Unruh, Dominique

doi:10.1007/978-3-642-55220-5_8

Cited by 51 publications

(18 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Very recently, Azar et al [3] construct "timed-delay" multi-party computation (MPC) protocols, where participating parties obtain the result of the computation only after a certain time, possibly some parties earlier than others. This is similar to the timedrelease schemes of [17,66,69], in particular it inherits the drawback of inefficient decryption and the assumption that all parties are able to solve the puzzles in about the same time.…”

Section: Related Work and Further Applications Of Time-lock Encryptionmentioning

confidence: 77%

“…In particular, it must not use its ability to allow decryption of ciphertexts earlier than desired by the sender in any malicious way, for instance by revealing a decryption key before the deadline. The other line of research [17,66,69] considers constructions that require the receiver of a ciphertext to perform a feasible, but computationally expensive search for a decryption key. This puts a considerable computational overhead on the receiver.…”

Section: Efficient Decryption Without Trusted Third Partiesmentioning

confidence: 99%

“…Timed-release encryption was introduced by Rivest et al [66] and considered in many followup works, including [15,23,27,69]. Our approach is fundamentally different from theirs.…”

Section: Related Work and Further Applications Of Time-lock Encryptionmentioning

confidence: 99%

See 2 more Smart Citations

How to build time-lock encryption

Liu

Jager

Kakvi

et al. 2018

Des. Codes Cryptogr.

View full text Add to dashboard Cite

Time-lock encryption is a method to encrypt a message such that it can only be decrypted after a certain deadline has passed. We propose a novel time-lock encryption scheme, whose main advantage over prior constructions is that even receivers with relatively weak computational resources should immediately be able to decrypt after the deadline, without any interaction with the sender, other receivers, or a trusted third party. We build our time-lock encryption on top of the new concept of computational reference clocks and an extractable witness encryption scheme. We explain how to construct a computational reference clock based on Bitcoin. We show how to achieve constant level of multilinearity for witness encryption by using SNARKs. We propose a new construction of a witness encryption scheme which is of independent interest: our scheme, based on Subset-Sum, achieves extractable security without relying on obfuscation. The scheme employs multilinear maps of arbitrary order and is independent of the implementations of multilinear maps.

show abstract

Section: Related Work and Further Applications Of Time-lock Encryptionmentioning

confidence: 77%

Section: Efficient Decryption Without Trusted Third Partiesmentioning

confidence: 99%

See 1 more Smart Citation

How to build time-lock encryption

Liu

Jager

Kakvi

et al. 2018

Des. Codes Cryptogr.

View full text Add to dashboard Cite

show abstract

“…To the best of our knowledge, the first use of a quantum encoding to certify that a ciphertext is completely "returned" was developed by Unruh [Unr14] in the context of revocable timed-release encryption.…”

Section: Related Workmentioning

confidence: 99%

Quantum Encryption with Certified Deletion

Broadbent

Islam

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

“…Our work contributes to the growing list of functionalities achievable with quantum information, yet unachievable classically. This includes: unconditionally secure key expansion [BB84], physically uncloneable money [Wie83; MVW13; Pas+12], a reduction from oblivious transfer to bit commitment [Ben+92;Dam+09] and to other primitives such as "cut-and choose" functionality [Feh+13], and revocable time-release quantum encryption [Unr14]. Importantly, these protocols all make use of the technique of conjugate coding [Wie83], which is also an important technique used in protocols for OT in the bounded quantum storage and noisy quantum storage models [Dam+05; WST08] (see [BS16] for a survey).…”

Section: Main Theorem (Informal)mentioning

confidence: 99%

Towards Quantum One-Time Memories from Stateless Hardware

Broadbent

Gharibian

Zhou

2021

Quantum

View full text Add to dashboard Cite

A central tenet of theoretical cryptography is the study of the minimal assumptions required to implement a given cryptographic primitive. One such primitive is the one-time memory (OTM), introduced by Goldwasser, Kalai, and Rothblum [CRYPTO 2008], which is a classical functionality modeled after a non-interactive 1-out-of-2 oblivious transfer, and which is complete for one-time classical and quantum programs. It is known that secure OTMs do not exist in the standard model in both the classical and quantum settings. Here, we propose a scheme for using quantum information, together with the assumption of stateless (i.e., reusable) hardware tokens, to build statistically secure OTMs. Via the semidefinite programming-based quantum games framework of Gutoski and Watrous [STOC 2007], we prove security for a malicious receiver making at most 0.114n adaptive queries to the token (for n the key size), in the quantum universal composability framework, but leave open the question of security against a polynomial amount of queries. Compared to alternative schemes derived from the literature on quantum money, our scheme is technologically simple since it is of the "prepare-and-measure" type. We also give two impossibility results showing certain assumptions in our scheme cannot be relaxed.

show abstract

Revocable Quantum Timed-Release Encryption

Cited by 51 publications

References 16 publications

How to build time-lock encryption

How to build time-lock encryption

Quantum Encryption with Certified Deletion

Towards Quantum One-Time Memories from Stateless Hardware

Contact Info

Product

Resources

About