Unclonable Encryption, Revisited

Ananth, Prabhanjan; Kaleoglu, Fatih

doi:10.1007/978-3-030-90459-3_11

Cited by 18 publications

(13 citation statements)

References 56 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Unclonable encryption and quantum copy-protection have been studied actively and there are many constructions. Although we have constructions with onewayness-based unclonability from standard assumptions in the standard model [BL20,AK21], we have constructions with indistinguishability-based unclonability only in the oracle model, in both unclonable encryption and quantum copy-protection [AKL + 22]. Ananth, Kaleoglu, Li, Liu, and Zhandry [AKL + 22] proposed the only indistinguishabilitybased secure unclonable encryption and quantum copy-protection schemes.…”

Section: Definition Of Unclonability: One-wayness and Indistinguishab...mentioning

confidence: 99%

“…Ananth, Kaleoglu, and Liu [AKL23] introduce a new framework called cloning games to study unclonable cryptography. They obtain many implications to unclonable cryptography thanks to the framework.…”

Section: Concurrent and Independent Workmentioning

confidence: 99%

“…Moreover, we can use one-out-of-many secure unclonable cryptographic primitives as a drop-in-replacement of standard indistinguishability-based unclonable cryptographic primitives if our goal is constructing a one-out-of-many secure unclonable cryptographic primitive (and vice versa). For example, the transformation from unclonable encryption to unclonable public-key encryption proposed by Ananth and Kaleoglu [AK21] works also in the one-out-of-many setting. Moreover, all of the generic constructions from an unclonable primitive to another unclonable primitive that we propose work in both standard (three adversary style) setting and one-out-of-many setting.…”

Section: Technical Overviewmentioning

confidence: 99%

“…The security notion of unclonable encryption ensures that it is impossible to convert ct into possibly entangled bipartite states ct 1 and ct 2 , both of which can be used to recover m when the secret key is given. Ananth and Kaleoglu [AK21] later introduced unclonable public key encryption. Unclonable encryption has interesting applications, such as preventing cloud storage attacks where an adversary steals ciphertexts from cloud storage with the hope that they can be decrypted if the secret key is leaked later.…”

Section: Introduction 1backgroundmentioning

confidence: 99%

See 3 more Smart Citations

One-out-of-Many Unclonable Cryptography: Definitions, Constructions, and More

Kitagawa¹,

Nishimaki²

2023

Preprint

View full text Add to dashboard Cite

The no-cloning principle of quantum mechanics enables us to achieve amazing unclonable cryptographic primitives, which is impossible in classical cryptography. However, the security definitions for unclonable cryptography are tricky. Achieving desirable security notions for unclonability is a challenging task. In particular, there is no indistinguishablesecure unclonable encryption and quantum copy-protection for single-bit output point functions in the standard model. To tackle this problem, we introduce and study relaxed but meaningful security notions for unclonable cryptography in this work. We call the new security notion one-out-of-many unclonable security.We obtain the following results.• We show that one-time strong anti-piracy secure secret key single-decryptor encryption (SDE) implies one-outof-many indistinguishable-secure unclonable encryption.• We construct a one-time strong anti-piracy secure secret key SDE scheme in the standard model from the LWE assumption.• We construct one-out-of-many copy-protection for single-bit output point functions from one-out-of-many indistinguishable-secure unclonable encryption and the LWE assumption.• We construct one-out-of-many unclonable predicate encryption (PE) from one-out-of-many indistinguishablesecure unclonable encryption and the LWE assumption.Thus, we obtain one-out-of-many indistinguishable-secure unclonable encryption, one-out-of-many copy-protection for single-bit output point functions, and one-out-of-many unclonable PE in the standard model from the LWE assumption. In addition, our one-time SDE scheme is the first SDE scheme that does not rely on any oracle heuristics and strong assumptions such as indistinguishability obfuscation and witness encryption.

show abstract

Section: Definition Of Unclonability: One-wayness and Indistinguishab...mentioning

confidence: 99%

Section: Concurrent and Independent Workmentioning

confidence: 99%

Section: Technical Overviewmentioning

confidence: 99%

Section: Introduction 1backgroundmentioning

confidence: 99%

See 2 more Smart Citations

One-out-of-Many Unclonable Cryptography: Definitions, Constructions, and More

Kitagawa¹,

Nishimaki²

2023

Preprint

View full text Add to dashboard Cite

show abstract

“…Ananth and Kaleoglu concurrently and independently present essentially the same technique in the uncloneable encryption setting[AK21].…”

mentioning

confidence: 99%

Quantum Encryption with Certified Deletion, Revisited: Public Key, Attribute-Based, and Classical Communication

Hiroka,

Morimae,

Nishimaki

et al. 2021

Preprint

View full text Add to dashboard Cite

Broadbent and Islam (TCC '20) proposed a quantum cryptographic primitive called quantum encryption with certified deletion. In this primitive, a receiver in possession of a quantum ciphertext can generate a classical certificate that the encrypted message is deleted. Although their construction is information-theoretically secure, it is limited to the setting of one-time symmetric key encryption (SKE), where a sender and receiver have to share a common key in advance and the key can be used only once. Moreover, the sender has to generate a quantum state and send it to the receiver over a quantum channel in their construction. Although deletion certificates are privately verifiable, which means a verification key for a certificate has to be kept secret, in the definition by Broadbent and Islam, we can also consider public verifiability.In this work, we present various constructions of encryption with certified deletion. * This is a major update version of the paper by Nishimaki and Yamakawa [NY21] with many new results.one-shot signatures prevents decryption of witness encryption after issuing a valid deletion certificate. Georgiou and Zhandry [GZ20] used a similar combination of one-shot signatures and witness encryption to construct unclonable decryption keys. Related workBefore the work by Broadbent and Islam [BI20], Fu and Miller [FM18] and Coiteux-Roy and Wolf [CRW19] also studied the concept of certifying deletion of information in different settings. (See [BI20] for the comparison with these works.)The quantum encryption scheme with certified deletion by Broadbent and Islam [BI20] is based on Wiesner's conjugate coding, which is the backbone of quantum money [Wie83] and quantum key distribution [BB84]. A similar idea has been used in many constructions in quantum cryptography that include (but not limited to) revocable quantum timed-release encryption [Unr15], uncloneable quantum encryption [BL20], single-decryptor encryption [GZ20], and copy protection/secure software leasing [CMP20]. Among them, revocable quantum timed-release encryption is conceptually similar to quantum encryption with certified deletion. In this primitive, a receiver can decrypt a quantum ciphertext only after spending a certain amount of time T . The receiver can also choose to return the ciphertext before the time T is over, in which case it is ensured that the message can no longer be recovered. As observed by Broadbent and Islam [BI20], an essential difference from quantum encryption with certified deletion is that the revocable quantum timed-release encryption does not have a mechanism to generate a classical certificate of deletion. Moreover, the construction by Unruh [Unr15] heavily relies on the random oracle heuristic [BR97, BDF + 11], and there is no known construction without random oracles.Kundu and Tan [KT20] constructed (one-time symmetric key) quantum encryption with certified deletion with the device-independent security, i.e., the security holds even if quantum devices are untrusted. Moreover, they show that their cons...

show abstract

On the Feasibility of Unclonable Encryption, and More

Ananth

Kaleoglu

et al. 2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Unclonable Encryption, Revisited

Cited by 18 publications

References 56 publications

One-out-of-Many Unclonable Cryptography: Definitions, Constructions, and More

One-out-of-Many Unclonable Cryptography: Definitions, Constructions, and More

Quantum Encryption with Certified Deletion, Revisited: Public Key, Attribute-Based, and Classical Communication

On the Feasibility of Unclonable Encryption, and More

Contact Info

Product

Resources

About