Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Reusable Secure Computation in the Plain Model

Vipul Goyal, Akshayaram Srinivasan, Mingyuan Wang

Published Jan 1, 2023• 0 citations
Publisher
DOI
10.1007/978-3-031-38557-5_14

Related papers

Reusable Non-Interactive Secure Computation

Melissa Chase, Yevgeniy Dodis, Yuval Ishai +4 more

Lecture notes in computer science•Jan 1, 2019•38 citations

Multiparty Reusable Non-Interactive Secure Computation.

Fabrice Benhamouda, Huijia Lin

•Jan 1, 2020•1 citation

Decisional Monogamy-of-Entanglement for Coset States and Applications to Unclonable Cryptography with Correlated Challenges

Amit Behera, Alper Cakan, Vipul Goyal

A main application of quantum information in cryptography is copy-protection, where we encode a functionality (such as a decryption key or software) into a reusable quantum state so that it cannot be split into two adversaries (called freeloaders) that both remain useful. Previous works have only shown security for independently sampled challenges for the two adversaries. A competing natural security notion is identical-challenge security where the adversaries receive the same challenge. This notion has many real-life applications and connections to other fundamental primitives such as unclonable bits (i.e. unclonable encryption) and unclonable lockboxes (i.e. copy-protection of point functions). Despite its importance and numerous attempts, achieving identical-challenge security in the plain model has remained open. We first make progress on the definitional foundations of copy-protection by introducing natural copy-protection security definitions that imply the previous ones (including identical-challenge security) and better capture the security intuitions and real-life use cases; and we also characterize the relationship between the previous definitions. Then, we show how to achieve in the plain model our new stronger definitions for copy-protection of general classes of functionalities. In particular, we resolve the long-standing open questions of copy-protection of point functions, copy-protection of compute-and-compare programs, and identical-challenge secure copy-protection of decryption keys and all puncturable functionalities. Our technical core is a new decisional monogamy-of-entanglement result for coset states, which both allows us to achieve our new results, and also significantly simplifies and unifies unclonable cryptography proofs. We believe this will have further applications and may be of independent interest.

quant-pharXiv:2608.18841•Aug 20, 2026•0 citations

Simultaneous-Message and Succinct Secure Computation: Reusable and Multiparty Protocols

Siddharth Agarwal, Abhishek Jain, Akshayaram Srinivasan +1 more

Lecture notes in computer science•Jan 1, 2026•0 citations

On Reusable Projective Garbling Schemes

Tommi Meskanen, Valtteri Niemi, Noora Nieminen

The popularity of network-based computation has increased during the past years. Storing data and performing computations using for example cloud services is commonplace nowadays. However, the information security in network-based computation rarely is satisfactory. One technique to improve information security for networked computations is based on secure multiparty computations. The idea of multiparty computation originates from Yao, who considered the secure computation with two parties by introducing the technique called garbled circuits. The technique was then generalized, but still the exact definitions for different security measures were not established until Bellare, Hoang and Rogaway proposed a definition of a garbling scheme and several security notions for garbling schemes. This gave inspiration to study the security properties of garbling schemes from different perspectives, including adaptivity and reusability. In this paper, we study the adaptive security for a certain type of reusable garbling schemes. First, we consider general constraints to achieve security for this specific type of garbling schemes. Then we analyze the adaptive security classes of reusable garbling schemes. More specifically, we prove a relation between security classes that has been left open in earlier research.

IEEE International Conference on Computer and Information Technology (CIT)•Sep 1, 2014•2 citations

Almost-Everywhere Secure Computation

Juan A. Garay, Rafail Ostrovsky

Springer eBooks•Apr 4, 2008•58 citations
A main application of quantum information in cryptography is copy-protection, where we encode a functionality (such as a decryption key or software) into a reusable quantum state so that it cannot be split into two adversaries (called freeloaders) that both remain useful. Previous works have only shown security for independently sampled challenges for the two adversaries. A competing natural security notion is identical-challenge security where the adversaries receive the same challenge. This notion has many real-life applications and connections to other fundamental primitives such as unclonable bits (i.e. unclonable encryption) and unclonable lockboxes (i.e. copy-protection of point functions). Despite its importance and numerous attempts, achieving identical-challenge security in the plain model has remained open. We first make progress on the definitional foundations of copy-protection by introducing natural copy-protection security definitions that imply the previous ones (including identical-challenge security) and better capture the security intuitions and real-life use cases; and we also characterize the relationship between the previous definitions. Then, we show how to achieve in the plain model our new stronger definitions for copy-protection of general classes of functionalities. In particular, we resolve the long-standing open questions of copy-protection of point functions, copy-protection of compute-and-compare programs, and identical-challenge secure copy-protection of decryption keys and all puncturable functionalities. Our technical core is a new decisional monogamy-of-entanglement result for coset states, which both allows us to achieve our new results, and also significantly simplifies and unifies unclonable cryptography proofs. We believe this will have further applications and may be of independent interest.
The popularity of network-based computation has increased during the past years. Storing data and performing computations using for example cloud services is commonplace nowadays. However, the information security in network-based computation rarely is satisfactory. One technique to improve information security for networked computations is based on secure multiparty computations. The idea of multiparty computation originates from Yao, who considered the secure computation with two parties by introducing the technique called garbled circuits. The technique was then generalized, but still the exact definitions for different security measures were not established until Bellare, Hoang and Rogaway proposed a definition of a garbling scheme and several security notions for garbling schemes. This gave inspiration to study the security properties of garbling schemes from different perspectives, including adaptivity and reusability. In this paper, we study the adaptive security for a certain type of reusable garbling schemes. First, we consider general constraints to achieve security for this specific type of garbling schemes. Then we analyze the adaptive security classes of reusable garbling schemes. More specifically, we prove a relation between security classes that has been left open in earlier research.