[1] |
GOLDWASSER S , KALAI Y T , ROTHBLUM G N . Delegating computation:interactive proofs for muggles[C]// ACM Symposium on Theory of Computing. ACM, 2008: 113-122.
|
[2] |
GOLDWASSER S , MICALI S , RACKOFF C . The knowledge complexity of interactive proof systems[J]. SIAM Journal on Computing, 1989,18(1): 186-208.
|
[3] |
ARORA S , SAFRA S . Probabilistic checking of proofs:a new characterization of NP[J]. Journal of the ACM, 1998,45(1): 70-122.
|
[4] |
CHUNG K M , KALAI Y , VADHAN S . Advances in cryptology -CRYPTO 2010:improved delegation of computation using fully homomorphic encryption[M]. Berlin: SpringerPress, 2010: 483-501.
|
[5] |
GENTRY C . A fully homomorphic encryption scheme[M]. Palo Alto: Stanford University PressPress, 2009.
|
[6] |
GREEN M , HOHENBERGER S , WATERS B . Outsourcing the decryption of ABE ciphertexts[C]// USENIX Conference on Security. USENIX Association, 2011: 34-34.
|
[7] |
YAO A C , . Protocols for secure computations[C]// The Annual Symposium on Foundations of Computer Science. IEEE Computer Society, 1982: 160-164
|
[8] |
GENNARO R , GENTRY C , PARNO B . Advances in cryptology -CRYPTO 2010:non-interactive verifiable computing:outsourcing computation to untrusted workers[M]. Berlin: SpringerPress, 2010: 465-482.
|
[9] |
AZAR P D , MICALI S . Rational proofs[C]// The Annual ACM Symposium on Theory of Computing. ACM, 2012: 1017-1028.
|
[10] |
AZAR P D , MICALI S . Super-efficient rational proofs[C]// Fourteenth ACM Conference on Electronic Commerce. ACM, 2013: 29-30.
|
[11] |
GUO S , HUBá?EK P ROSEN A ,et al. Rational arguments:single round delegation with sublinear verification[C]// Conference on Innovations in Theoretical Computer Science. ACM, 2014: 523-540.
|
[12] |
TIAN Y L , PENG C G , LIN D D . Bayesian mechanism for rational secret sharing scheme[J]. Science China Information Sciences, 2015,58(5): 1-13.
|
[13] |
CHEN J , MCCAULEY S , SINGH S . Rational proofs with multiple provers[J]. Information Processing Letters, 2015,114(11): 237-248.
|
[14] |
KILIAN J , . A note on efficient zero-knowledge proofs and arguments[C]// ACM Symposium on Theory of Computing. ACM, 1992: 723-732.
|
[15] |
Quang Duy L? , CHEW Y H , SOONG B H . An Introduction to Game Theory[M]. Oxford: Oxford University PressPress, 2005.
|
[16] |
GENTRY C , . Fully homomorphic encryption using ideal lattices[C]// The ACM Symposium on the Theory of Computing. ACM, 2009: 169-178.
|
[17] |
GENTRY C , HALEVI S , VAIKUNTANATHAN V . I-hop homomorphic encryption and rerandomizable Yao circuits[C]// The Annual Conference on Advances in Cryptology. IEEE Press, 2010: 155-172.
|
[18] |
KUPCU , ALPTEKIN . Incentivized outsourced computation resistant to malicious contractors[J]. IEEE Transactions on Dependable and Secure Computing, 2017,14(6): 633-649.
|
[19] |
CHEN X F , LI J , SUSILO W . Efficient fair conditional payments for outsourcing computations[J]. IEEE Transactions on Information Forensics & Security, 2012,7(6): 1687-1694.
|
[20] |
GENNARO R , GENTRY C , PARNO B . Non-interactive verifiable computing:outsourcing computation to untrusted workers[C]// Conference on Advances in Cryptology. Springer-Verlag, 2010: 465-482.
|