New Publicly Verifiable Databases with Efficient Updates

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

hohenberger, 0, How to securely outsource cryptographic computations, Proc 2nd Theory Cryptography Conf, 264

golle, 0, Uncheatable distributed computations, Proc Cryptographers' Track RSA Conf Topics Cryptology, 425

10.1137/0218012

10.1007/11593447_33

10.1145/1374376.1374396

0

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 Cryptographic Techn Adv Cryptol, 129

10.1145/1536414.1536440

10.1007/3-540-48071-4_7

chen, 0, Verifiable computation over large database with incremental updates, Proc Euro Symp Res Computer Security, 148

10.1007/3-540-44598-6_26

atallah, 0, Securely outsourcing linear algebra computations, Proc 5th ACM Symp Inf Comput Commun Security, 48

10.1145/28395.28417

camenisch, 0, Dynamic accumulators and application to efficient revocation of anony- mous credentials, Proc 22nd Annu Int Cryptol Conf Adv Cryptol, 61

carbunar, 0, Conditional payments for computing markets, Proc Int Conf Cryptology Netw Security, 317

10.1145/2046707.2046759

10.1016/j.tcs.2011.05.031

10.1109/SECON.2010.5508202

chen, 0, New algorithms for secure outsourcing of modular exponentiations, Proc Eur Symp Res Comput Security, 541

10.1109/TIFS.2012.2210880

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

10.1007/BF00196725

zhang, 0, Verifiable delegation of computations with storage-verification trade-off, Proc Euro Symp Res Computer Security, 112

10.1109/TPDS.2012.206

10.1109/INFCOM.2011.5935305

10.1109/SP.2013.48

tamassia, 0, Proc Alberto Mendelzon Workshop Found Data Manage

10.1016/0022-0000(93)90044-W

blanton, 0, Secure and efficient outsourcing of sequence comparisons, Proc Euro Symp Res Computer Security, 505

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

10.1007/s001459900017

boyko, 0, Speeding up discrete log and factoring based schemes via precomputations, Proc Int Conf Theory Appl Cryptographic Techn, 221

10.1007/978-3-540-24660-2_12

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

chevallier-mames, 0, Secure delegation of elliptic-curve pairing, Proc 9th IFIP WG 8 8/11 2 Int Conf Smart Card Res Adv Appl, 24

catalano, 0, Vector commitments and their applications, Proc PKC, 55

10.1007/978-3-540-78967-3_25

camenisch, 0, An accumulator based on bilinear maps and efficient revocation for anonymous credentials, Proc 12th Int Conf Practice Theory Public Key Cryptography, 481

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/62212.62223

bao, 0, Variations of Diffie-Hellman problem, Proc Int Conf Commun Syst, 301

parno, 0, How to delegate and verify in public: verifiable computation from attribute-based encryption, Proc 9th Int Conf Theory Cryptography, 422

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

10.1109/49.839932

10.1109/SFCS.2003.1238183

nguyen, 0, Accumulators from bilinear pairings and applications, Proc Int Conf Topics Cryptol, 275

10.1007/978-3-0348-8295-8_24

10.1007/978-3-642-11799-2_30

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

10.1007/s00453-003-1076-8

10.1109/SFCS.1994.365746