Verifiable Computation over Large Database with Incremental Updates

gennaro, 0, Non-interactive verifiable computing: Outsourcing computation to untrusted workers, Proc 30th Annu Conf Adv Cryptol, 465

gentry, 0, Implementing Gentry’s fully-homomorphic encryption scheme, Proc 30th Annu Int Conf Theory Appl Cryptol Tech, 129

10.1007/978-3-642-38980-1_22

10.1007/3-540-48071-4_7

10.1007/978-3-319-11203-9_9

10.1007/978-3-642-33167-1_31

10.1145/1536414.1536440

10.1007/3-540-45353-9_31

10.1137/0218012

10.1145/1374376.1374396

10.1109/SECON.2010.5508202

10.1007/978-3-540-89641-8_23

10.1109/TIFS.2012.2210880

adj, 0, Computing discrete logarithms in $F_{3^{6*137}}$ and $F_{3^{6*163}}$ using magma, Proceedings of International Workshop on the Arithmetic of Finite Fields, 3

10.1145/1755688.1755695

10.1145/2043556.2043566

10.1007/978-3-642-36362-7_5

10.1007/978-3-642-12510-2_3

10.1007/978-3-642-00468-1_27

10.1007/978-3-540-72540-4_14

10.1145/2046707.2046759

10.1007/3-540-45708-9_5

10.1007/978-3-642-28914-9_24

10.1007/978-3-540-77048-0_1

10.1109/TPDS.2012.206

10.1109/INFCOM.2011.5935305

0, Proc Alberto Mendelzon Workshop Found Data Manage

10.1007/3-540-48658-5_22

10.1145/225058.225080

0, Proc 20th USENIX Conf Security

10.1007/3-540-45473-X_9

blum, 0, Program result checking against adaptive programs and in cryptographic settings, Proceedings of DIMACS Workshop on Distributed Computing and Cryptography, 107

10.1016/0022-0000(93)90044-W

10.1007/3-540-69053-0_13

10.1007/978-3-642-33167-1_29

10.1007/3-540-45682-1_30

10.1007/3-540-44448-3_41

benabbas, 0, Verifiable delegation of computation over large datasets, Proc 31st Annu Conf Adv Crypt, 111

10.1007/s10207-005-0070-3

atallah, 2001, Secure outsourcing of scientific computations, Adv Comput, 54, 216

10.1109/PST.2008.12

10.1007/978-3-540-68914-0_12

10.1145/2508859.2516681

10.1007/978-3-540-39927-8_28

10.1007/978-3-540-30574-3_19

10.1145/62212.62223

10.1007/978-3-642-29011-4_37

10.1109/SFCS.1994.365746

10.1109/49.839932

u, 2004, A general model for authenticated data structures, Algorithmica, 39, 21, 10.1007/s00453-003-1076-8

kilian, 0, A note on efficient zero-knowledge proofs and arguments, Proc ACM Symp Theory Comput, 723

10.1007/978-3-540-30576-7_15

0

kilian, 0, Improved efficient arguments (preliminary version), Proc 15th Annu Int Cryptol Conf, 311