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

Lighter is Better: A Lighter Multi-client Verifiable Outsourced Computation with Hybrid Homomorphic Encryption

Xingkai Wang, Zhenfu Cao, Zhen Liu, Kaitai Liang

Published Jan 1, 2022• 1 citation
Publisher
DOI
10.1007/978-3-031-17146-8_6

Related papers

Multi-client Outsourced Computation

Peili Li, Haixia Xu, Yuanyuan Ji

Lecture notes in computer science•Jan 1, 2016•1 citation

Homomorphic encryption of linear optics quantum computation on almost arbitrary states of light with asymptotically perfect security

Ouyang, Y., Tan, S.-H., Fitzsimons, J. +1 more

Future quantum computers are likely to be expensive and affordable outright\nby few, motivating client/server models for outsourced computation. However,\nthe applications for quantum computing will often involve sensitive data, and\nthe client would like to keep her data secret, both from eavesdroppers and the\nserver itself. Homomorphic encryption is an approach for encrypted, outsourced\nquantum computation, where the client's data remains secret, even during\nexecution of the computation. We present a scheme for the homomorphic\nencryption of arbitrary quantum states of light with no more than a fixed\nnumber of photons, under the evolution of both passive and adaptive linear\noptics, the latter of which is universal for quantum computation. The scheme\nuses random coherent displacements in phase-space to obfuscate client data. In\nthe limit of large coherent displacements, the protocol exhibits asymptotically\nperfect information-theoretic secrecy. The experimental requirements are\nmodest, and easily implementable using present-day technology.

•Feb 28, 2019•15 citations

Multi-Client Verifiable Computation with Stronger Security Guarantees

Steven Gordon, Jonathan I. Katz, Feng-Hao Liu +2 more

Lecture notes in computer science•Jan 1, 2015•53 citations

Best of Both Worlds in Secure Computation, with Low Communication Overhead

Daniel Genkin, Steven Gordon, Samuel Ranellucci

Lecture notes in computer science•Jan 1, 2018•1 citation

Securely outsourcing linear algebra computations

Mikhail J. Atallah, Keith B. Frikken

We give improved protocols for the secure and private outsourcing of linear algebra computations, that enable a client to securely outsource expensive algebraic computations (like the multiplication of large matrices) to a remote server, such that the server learns nothing about the customer's private input or the result of the computation, and any attempted corruption of the answer by the server is detected with high probability. The computational work performed at the client is linear in the size of its input and does not require the client to locally carry out any expensive encryptions of such input. The computational burden on the server is proportional to the time complexity of the current practically used algorithms for solving the algebraic problem (e.g., proportional to n3 for multiplying two n x n matrices). The improvements we give are: (i) whereas the previous work required more than one remote server and assumed they do not collude, our solution works with a single server (but readily accommodates many, for improved performance); (ii) whereas the previous work required a server to carry out expensive cryptographic computations (e.g., homomorphic encryptions), our solution does not make use of any such expensive cryptographic primitives; and (iii) whereas in previous work collusion by the servers against the client revealed to them the client's inputs, our scheme is resistant to such collusion. As in previous work, we maintain the property that the scheme enables the client to detect any attempt by the server(s) at corruption of the answer, even when the attempt is collusive and coordinated among the servers.

ACM Asia Conference on Computer and Communications Security (ASIA CCS)•Apr 13, 2010•265 citations

Efficient Secure Multi-party Computation

Martin Hirt, Ueli M. Maurer, Bartosz Przydatek

Lecture notes in computer science•Jan 1, 2000•123 citations
Future quantum computers are likely to be expensive and affordable outright\nby few, motivating client/server models for outsourced computation. However,\nthe applications for quantum computing will often involve sensitive data, and\nthe client would like to keep her data secret, both from eavesdroppers and the\nserver itself. Homomorphic encryption is an approach for encrypted, outsourced\nquantum computation, where the client's data remains secret, even during\nexecution of the computation. We present a scheme for the homomorphic\nencryption of arbitrary quantum states of light with no more than a fixed\nnumber of photons, under the evolution of both passive and adaptive linear\noptics, the latter of which is universal for quantum computation. The scheme\nuses random coherent displacements in phase-space to obfuscate client data. In\nthe limit of large coherent displacements, the protocol exhibits asymptotically\nperfect information-theoretic secrecy. The experimental requirements are\nmodest, and easily implementable using present-day technology.
We give improved protocols for the secure and private outsourcing of linear algebra computations, that enable a client to securely outsource expensive algebraic computations (like the multiplication of large matrices) to a remote server, such that the server learns nothing about the customer's private input or the result of the computation, and any attempted corruption of the answer by the server is detected with high probability. The computational work performed at the client is linear in the size of its input and does not require the client to locally carry out any expensive encryptions of such input. The computational burden on the server is proportional to the time complexity of the current practically used algorithms for solving the algebraic problem (e.g., proportional to n3 for multiplying two n x n matrices). The improvements we give are: (i) whereas the previous work required more than one remote server and assumed they do not collude, our solution works with a single server (but readily accommodates many, for improved performance); (ii) whereas the previous work required a server to carry out expensive cryptographic computations (e.g., homomorphic encryptions), our solution does not make use of any such expensive cryptographic primitives; and (iii) whereas in previous work collusion by the servers against the client revealed to them the client's inputs, our scheme is resistant to such collusion. As in previous work, we maintain the property that the scheme enables the client to detect any attempt by the server(s) at corruption of the answer, even when the attempt is collusive and coordinated among the servers.