Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Veriml: Enabling integrity assurances and fair payments for machine learning as a service
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 …
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 …
outsource its computationally-heavy tasks to cloud providers. Because such service …
Towards attack and defense views of rational delegation of computation
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 …
which is significant to the construction of intelligent urban computing. In order to close to …
Rational arguments: single round delegation with sublinear verification
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 …
interactive proofs in which the prover is neither honest nor malicious, but rather rational. The …
Rational sumchecks
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 …
proofs in which the prover is neither honest nor malicious, but rather rational. The advantage …
Fine-grained secure computation
This paper initiates a study of Fine Grained Secure Computation: ie the construction of
secure computation primitives against “moderately complex” adversaries. We present …
secure computation primitives against “moderately complex” adversaries. We present …
Rational proofs with multiple provers
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 …
prover, verifying the prover's claims before accepting them. These proofs have applications …
How to Make Rational Arguments Practical and Extractable
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 …
malicious ones. Our starting point is the notion of rational arguments, a variant of rational …
Sequentially composable rational proofs
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” …
case where a large number of “computation problems” are outsourced. We show that a “fast” …
Efficient rational proofs for space bounded computations
We present new protocols for the verification of space bounded polytime computations
against a rational adversary. For such computations requiring sublinear space our protocol …
against a rational adversary. For such computations requiring sublinear space our protocol …