Semi-Quantum Money

Radian, Roy; Sattath,

doi:10.1145/3318041.3355462

Cited by 30 publications

(15 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally one can explore usability of QEnclave for any quantum protocols that can be implemented through RSR. In particular, we think it can be relevant to use it to for a practical implementation of semi-quantum money schemes [45] that unlike standard quantum money protocol [55] considers that the bank mints the quantum states used as banknotes on the user's side and verifies their validity using only classical interactions. This matches our definition of remote state preparation, once the problem of verifiability is also addressed.…”

Section: Conclusion and Discussionmentioning

confidence: 99%

QEnclave -- A practical solution for secure quantum cloud computing

Ma,

Kashefi,

Arapinis

et al. 2021

Preprint

View full text Add to dashboard Cite

We introduce a secure hardware device named a QEnclave that can secure the remote execution of quantum operations while only using classical controls. This device extends to quantum computing the classical concept of a secure enclave which isolates a computation from its environment to provide privacy and tamperresistance. Remarkably, our QEnclave only performs single-qubit rotations, but can nevertheless be used to secure an arbitrary quantum computation even if the qubit source is controlled by an adversary. More precisely, attaching a QEnclave to a quantum computer, a remote client controlling the QEnclave can securely delegate its computation to the server solely using classical communication. We investigate the security of our QEnclave by modeling it as an ideal functionality named Remote State Rotation. We show that this resource, similar to previously introduced functionality of remote state preparation, allows blind delegated quantum computing with perfect security. Our proof relies on standard tools from delegated quantum computing. Working in the Abstract Cryptography framework, we show a construction of remote state preparation from remote state rotation preserving the security. An immediate consequence is the weakening of the requirements for blind delegated computation. While previous delegated protocols were relying on a client that can either generate or measure quantum states, we show that this same functionality can be achieved with a client that only transforms quantum states without generating or measuring them. It is known that blind quantum computing with information security cannot be implemented using only classical communication. Computational assumptions that circumvent this impossibility induce large overheads on the server side that prevent their practical use. Whereas our approach based on QEnclave does not increase the complexity of the problem on the server side while relying on hardware assumptions that are already used in practice for classical computations. It hence provides for the first time a feasible path towards achieving secure delegated quantum computing for various hardware platforms that are already providing their services over the cloud.

show abstract

Section: Conclusion and Discussionmentioning

confidence: 99%

QEnclave -- A practical solution for secure quantum cloud computing

Ma,

Kashefi,

Arapinis

et al. 2021

Preprint

View full text Add to dashboard Cite

show abstract

“…In addition to this line of work focused on rigidity statements, application-specific dequantisations were already considered for private-key quantum money [RS19], certifiable deletion of quantum encryption [HMNY21] and secure software leasing [KNY21]. In all these cases the authors derived the desired security statement from properties of trapdoor claw-free functions, a cryptographic primitive which is also the basis of our RSP protocol.…”

Section: Related Workmentioning

confidence: 99%

Quantum cryptography with classical communication: parallel remote state preparation for copy-protection, verification, and more

Gheorghiu¹,

Metger²,

Poremba³

2022

Preprint

View full text Add to dashboard Cite

Quantum mechanical effects have enabled the construction of cryptographic primitives that are impossible classically. For example, quantum copy-protection allows for a program to be encoded in a quantum state in such a way that the program can be evaluated, but not copied. Many of these cryptographic primitives are two-party protocols, where one party, Bob, has full quantum computational capabilities, and the other party, Alice, is only required to send random BB84 states to Bob. In this work, we show how such protocols can generically be converted to ones where Alice is fully classical, assuming that Bob cannot efficiently solve the LWE problem. In particular, this means that all communication between (classical) Alice and (quantum) Bob is classical, yet they can still make use of cryptographic primitives that would be impossible if both parties were classical. We apply this conversion procedure to obtain quantum cryptographic protocols with classical communication for unclonable encryption, copyprotection, computing on encrypted data, and verifiable blind delegated computation.The key technical ingredient for our result is a protocol for classically-instructed parallel remote state preparation of BB84 states. This is a multi-round protocol between (classical) Alice and (quantum polynomial-time) Bob that allows Alice to certify that Bob must have prepared n uniformly random BB84 states (up to a change of basis on his space). Furthermore, Alice knows which specific BB84 states Bob has prepared, while Bob himself does not. Hence, the situation at the end of this protocol is (almost) equivalent to one where Alice sent n random BB84 states to Bob. This allows us to replace the step of preparing and sending BB84 states in existing protocols by our remote-state preparation protocol in a generic and modular way.

show abstract

“…According to Radian (2019), the banking sector produces more income from their assets as compared to non -banking sectors. He further recognized two types of income; Interest & Non interest Income.…”

Section: Incomementioning

confidence: 99%

Determinants of Bank Profitability

Sultan¹

2021

JBR

View full text Add to dashboard Cite

Banks are the most vital financial intermediaries in economy, which has a profitable banking industry; in order to survive undesirable shock as well as subsidize the constancy under the whole economy. However, the main purpose of this research is in the direction of analyzing factors affecting banks’ effectiveness all over Pakistan by means of sets of targeted facts and figures of twenty panels from 2005 to 2015. This study is developed with the help of AOLS technique which is used to examine the effect of different factors such as resources, debts, justice, securities, economic growth, price increases, price decreases, and market capitalization on major profitability signs such as (ROA), (ROE), (ROCE) and (NIM). The experimental consequences analyzed solid facts which stated the following conclusion, i.e., internal factors and external factors create an adverse impact on the level of profitability. An outcome by this research is important to different researchers. This research study proposed that by the concentration & reengineering the internal drivers the banks can improve its profitability and performance.

show abstract

Semi-Quantum Money

Cited by 30 publications

References 33 publications

QEnclave -- A practical solution for secure quantum cloud computing

QEnclave -- A practical solution for secure quantum cloud computing

Quantum cryptography with classical communication: parallel remote state preparation for copy-protection, verification, and more

Determinants of Bank Profitability

Contact Info

Product

Resources

About