Veriml: Enabling integrity assurances and fair payments for machine learning as a service

L Zhao, Q Wang, C Wang, Q Li… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
Machine Learning as a Service (MLaaS) allows clients with limited resources to outsource
their expensive ML tasks to powerful servers. Despite the huge benefits, current MLaaS …

Efficient secure and verifiable outsourcing of matrix multiplications

Y Zhang, M Blanton - International Conference on Information Security, 2014 - Springer
With the emergence of cloud computing services, a resource-constrained client can
outsource its computationally-heavy tasks to cloud providers. Because such service …

Towards attack and defense views of rational delegation of computation

Y Tian, J Guo, Y Wu, H Lin - IEEE Access, 2019 - ieeexplore.ieee.org
Rational delegation of computation is an important technology of mobile Internet at present,
which is significant to the construction of intelligent urban computing. In order to close to …

Rational arguments: single round delegation with sublinear verification

S Guo, P Hubáček, A Rosen, M Vald - Proceedings of the 5th …, 2014 - dl.acm.org
Rational proofs, recently introduced by Azar and Micali (STOC 2012), are a variant of
interactive proofs in which the prover is neither honest nor malicious, but rather rational. The …

Rational sumchecks

S Guo, P Hubáček, A Rosen, M Vald - Theory of Cryptography Conference, 2015 - Springer
Rational proofs, introduced by Azar and Micali (STOC 2012) are a variant of interactive
proofs in which the prover is neither honest nor malicious, but rather rational. The advantage …

Fine-grained secure computation

M Campanelli, R Gennaro - Theory of Cryptography Conference, 2018 - Springer
This paper initiates a study of Fine Grained Secure Computation: ie the construction of
secure computation primitives against “moderately complex” adversaries. We present …

Rational proofs with multiple provers

J Chen, S McCauley, S Singh - … of the 2016 ACM Conference on …, 2016 - dl.acm.org
Interactive proofs model a world where a verifier delegates computation to an untrustworthy
prover, verifying the prover's claims before accepting them. These proofs have applications …

How to Make Rational Arguments Practical and Extractable

M Campanelli, C Ganesh, R Gennaro - Cryptology ePrint Archive, 2023 - eprint.iacr.org
We investigate proof systems where security holds against rational parties instead of
malicious ones. Our starting point is the notion of rational arguments, a variant of rational …

Sequentially composable rational proofs

M Campanelli, R Gennaro - Decision and Game Theory for Security: 6th …, 2015 - Springer
Abstract We show that Rational Proofs do not satisfy basic compositional properties in the
case where a large number of “computation problems” are outsourced. We show that a “fast” …

Efficient rational proofs for space bounded computations

M Campanelli, R Gennaro - Decision and Game Theory for Security: 8th …, 2017 - Springer
We present new protocols for the verification of space bounded polytime computations
against a rational adversary. For such computations requiring sublinear space our protocol …