Verifiable computation over large database with incremental updates

IEEE Transactions on Computers

Volumn 65, Issue 10, 2016, Pages 3184-3195

  Chen, Xiaofeng ^a,b   Li, Jin ^c   Weng, Jian ^d   Ma, Jianfeng ^a   Lou, Wenjing ^e  

^a XIDIAN UNIVERSITY   (China)

^b STATE KEY LABORATORY OF CRYPTOLOGY   (China)

^c GUANGZHOU UNIVERSITY   (China)

^d JINAN UNIVERSITY   (China)

^e VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

Author keywords

incremental cryptography; outsourcing computations; vector commitment; Verifiable database

Indexed keywords

CRYPTOGRAPHY;

DATABASE RECORDS; DIFFIE HELLMAN; INCREMENTAL UPDATES; LARGE DATABASE; SECURITY PROPERTIES; UNTRUSTED SERVER; VERY LARGE DATABASE; VERY LARGE DATUM;

DATABASE SYSTEMS;

EID: 84987657487     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2015.2512870     Document Type: Article

References (54)

1. M. J. Atallah and K. B. Frikken, Securely outsourcing linear algebra computations, in Proc. 5th ACM Symp. Inf., Comput. Commun. Security, pp. 48-59, 2010.
2. G. Adj, A. Menezes, T. Oliveira and F. Rodriguez-Henriquez, Computing discrete logarithms in F36-137 and F36-163 using magma, in Proc. 5th Int. Workshop Arithmetic Finite Fields, 2015, pp. 3-22.
3. M. J. Atallah, K. N. Pantazopoulos, J. R. Rice, and E. H. Spafford, Secure outsourcing of scientific computations, Adv. Comput., vol. 54, pp. 216-272, 2001.
4. M. J. Atallah and J. Li, Secure outsourcing of sequence comparisons, Int. J. Inf. Security, vol. 4, pp. 277-287, 2005.
5. M. Blanton, Improved conditional e-payments, in Proc. 6th Int. Conf. Appl. Cryptograph. Netw. Security, 2008, pp. 188-206.
6. D. Benjamin and M. J. Atallah, Private and cheating-free outsourcing of algebraic computations, in Proc. 6th Annu. Conf. Privacy, Security Trust, 2008, pp. 240-245.
7. F. Bao, R. Deng, and H. Zhu, Variations of Diffie-Hellman problem, in Proc. 5th Int. Conf. Inf. Commun. Security, 2003, pp. 301-312.
8. M. Backes, D. Fiore, and R. M. Reischuk, Verifiable delegation of computation on outsourced data, in Proc. ACM SIGSAC Conf. Comput. Commun. Security, 2013, pp. 863-874.
9. M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson, Multiprover interactive proofs: How to remove intractability assumptions, in Proc. ACM Symp. Theory Comput., 1988, pp. 113-131.
10. M. Bellare, O. Goldreich, and S. Goldwasser, Incremental cryptography: The case of hashing and signing, in Proc. 14th Annu. Int. Cryptol. Conf. Adv. Cryptol., 1994, pp. 216-233.
11. M. Bellare, O. Goldreich, and S. Goldwasser, Incremental cryptography and application to virus protection, in Proc. 27th ACM Symp. Theory Comput., 1995, pp. 45-56.
12. E. Buonanno, J. Katz, and M. Yung, Incremental unforgeable encryption, in Proc. 8th Int. Workshop Fast Softw. Encryption, 2002, pp. 109-124.
13. M. Blum, M. Luby, and R. Rubinfeld, Program result checking against adaptive programs and in cryptographic settings, in Proc. DIMACS Workshop Distrib. Comput. Crypthography, 1991, pp. 107-118.
14. M. Blum, M. Luby, and R. Rubinfeld, Self-testing/correcting with applications to numerical problems, J. Comput. Syst. Sci., pp. 549-595, 1993.
15. M. Bellare and D. Micciancioy, A new paradigm for collision-free hashing: Incrementality at reduced cost, in Proc. Int. Conf. Theory Appl. Cryptographic Techn., 1997, pp. 163-192.
16. M. Blanton, M. J. Atallah, K. B. Frikken, and Q. Malluhi, Secure and efficient outsourcing of sequence comparisons, in Proc. 17th Eur. Symp. Res. Comput. Security, 2012, pp. 505-522.
17. D. Boneh, B. Lynn, and H. Shacham, Short signatures from the Weil pairings, in Proc. 7th Int. Conf. Theory Appl. Cryptol. Inf. Security: Adv. Cryptol., 2001, pp. 514-532.
18. M. Bellare and C. Namprempre, Authenticated encryption: Relations among notions and analysis of the generic composition paradigm, in Proc. 6th Int. Conf. Theory Appl. Cryptol. Inf. Security, 2000, pp. 531-545.
19. S. Benabbas, R. Gennaro, and Y. Vahlis, Verifiable delegation of computation over large datasets, in Proc. 31st Annu. Conf. Adv. Cryptol., 2011, pp. 111-131.
20. R. A. Popa, N. Zeldovich, and H. Balakrishnan, CryptDB: A practical encrypted relational DBMS, MIT Comput. Sci. Artif. Intell. Laboratory, Cambridge, MA, USA, Tech. Rep. MIT-CSAIL-TR- 2011-005, Jan. 2011.
21. B. Chevallier-Mames, J. Coron, N. McCullagh, D. Naccache, and M. Scott, Secure delegation of elliptic-curve pairing, in Proc. 9th IFIP WG8.8/11.2 Int. Conf. Smart Card Re. Adv. Appl., 2010, pp. 24-35.
22. D. Catalano and D. Fiore, Vector commitments and their applications, in Proc. 16th Int. Conf. Practice Theory Public-Key Cryptography, 2013, pp. 55-72.
23. J. Camenisch, S. Hohenberger, and M. Pedersen, Batch verification of short signatures, in Proc. 26th Annu. Int. Conf. Theory Appl. Cryptographic Techn., 2007, pp. 246-263.
24. J. Camenisch, M. Kohlweiss, and C. Soriente, An accumulator based on bilinear maps and efficient revocation for anonymous credentials, in Proc. 12th Int. Conf. Practice Theory Public Key Cryptography, 2009, pp. 481-500.
25. J. Camenisch and A. Lysyanskaya, Dynamic accumulators and application to efficient revocation of anonymous credentials, in Proc. 22nd Annu. Int. Cryptol. Conf. Adv. Cryptol., 2002, pp. 61-76.
26. R. Canetti, B. Riva, G. Rothblum, Practical delegation of computation using multiple servers, in Proc. 18th ACM Conf. Comput. Commun. Security, 2011, pp. 445-454.
27. B. Carbunar, M. Tripunitara, Conditional payments for computing markets, in Proc. 7th Int. Conf. Cryptol. Netw.. Security, 2008, pp. 317-331.
28. B. Carbunar, M. Tripunitara, Fair payments for outsourced computations, in Proc. Annu. Conf. Sensor, Mesh Ad Hoc Commun. Netw., 2010, pp. 529-537.
29. X. Chen, J. Li, and W. Susilo, Efficient fair conditional payments for outsourcing computations, IEEE Trans. Inf. Forensics Security, vol. 7, no. 6, pp. 1687-1694, Dec. 2012.
30. X. Chen, J. Li, J. Ma, Q. Tang, and W. Lou, New algorithms for secure outsourcing of modular exponentiations, in Proc. Eur. Conf. Res. Comput. Security, 2012, pp. 541-556.
31. X. Chen, J. Li, J. Weng, J. Ma, and W. Lou, Verifiable computation over large database with incremental updates, in Proc. 19th Eur. Symp. Res. Comput. Security, 2012, pp. 148-162.
32. D. Chaum and T. Pedersen, Wallet databases with observers, in Proc. 12th Annu. Adv. Int. Cryptol. Conf. Adv. Cryptol., 1993, pp. 89-105.
33. A. Guillevic, Comparing the pairing efficiency over compositeorder and prime-order elliptic curves, in Proc. 11th Int. Conf. Appl. Cryptography Netw. Security, 2013, pp. 357-372.
34. S. Goldwasser, Y. T. Kalai, and G. N. Rothblum, Delegating computation: Interactive proofs for muggles, in Proc. ACM Symp. Theory Comput., 2008, pp. 113-122.
35. S. Goldwasser, S. Micali, and C. Rackoff, The knowledge complexity of interactive proof-systems, SIAM J. Comput., vol. 18, no. 1, pp. 186-208, 1989.
36. P. Golle, I. Mironov, Uncheatable distributed computations, in Proc. Conf. Topics Cryptol.: Cryptographers Track RSA, 2001, pp. 425-440.
37. C. Gentry, Fully homomorphic encryption using ideal lattices, Proc. 41st Annu. ACM Symp. Theory Comput., 2009, pp. 169-178.
38. C. Gentry and S. Halevi, Implementing Gentrys fully-homomorphic encryption scheme, in Proc. 30th Annu. Int. Conf. Theory Appl. Cryptographic Techn., 2011, pp. 129-148.
39. R. Gennaro, C. Gentry, and B. Parno, Non-interactive verifiable computing: Outsourcing computation to untrusted workers, in Proc. 30th Annu. Conf. Adv. Cryptol., 2010, pp. 465-482.
40. M. Green, S. Hohenberger, B. Waters. (2011). Outsourcing the decryption of ABE ciphertexts. Proc. 20th USENIX Conf. Security. The full version can be found at [Online]. Available: http://static. usenix.org/events/sec11/tech/full-papers/Green.pdf
41. S. Hohenberger and A. Lysyanskaya, How to securely outsource cryptographic computations, in Proc. 2nd Theory Cryptography Conf., 2005, pp. 264-282.
42. J. Kilian, A note on efficient zero-knowledge proofs and arguments, in Proc.ACMSymp. Theory Comput., 1992, pp. 723-732.
43. J. Kilian, Improved efficient arguments (preliminary version), in Proc. 15th Annu. Int. Cryptol. Conf., 1995, pp. 311-324. 1995.
44. B. Lynn. (2014). PBC library [Online]. Available: http://crypto.stanford.edu/pbc
45. S. Micali, CS proofs, in Proc. 35th Annu. Symp. Found. Comput. Sci., 1994, pp. 436-453.
46. I. Mironov, O. Pandey, O. Reingold, and G. Segev, Incremental deterministic public-key encryption, in Proc. 31st Annu. Int. Conf. Theory Appl. Cryptographic Techn., 2012, pp. 628-644.
47. C. U. Martel, G. Nuckolls, P. T. Devanbu, M. Gertz, A. Kwong, and S. G. Stubblebine, A general model for authenticated data structures, Algorithmica, vol. 39, no. 1, pp. 21-41, 2004.
48. M. Naor and K. Nissim, Certificate revocation and certificate update, in Proc. 7th Conf. USENIX Security Symp., 1998, vol. 7, pp. 17-17.
49. L. Nguyen, Accumulators frombilinear pairings and applications, in Proc. Cryptographers Track RSA Conf., 2005, pp. 75-292.
50. B. Parno, M. Raykova and V. Vaikuntanathan, How to delegate and verify in public: Verifiable computation from attribute-based encryption, in Proc. 9th Theory of Cryptography Conf., 2012, pp. 422-439.
51. C. Papamanthou and R. Tamassia, Time and space efficient algorithms for two-party authenticated data structures, in Proc. 9th Int. Conf. Inf. Commun. Security, 2007, pp. 1-15.
52. R. Tamassia and N. Triandopoulos. (2010). Certification and authentication of data structures. Proc. Alberto Mendelzon Workshop Found. Data Manage. [Online]. Available: http://www.cs.bu.edu/nikos/papers/cads.pdf
53. C. Wang, K. Ren, and J. Wang, Secure and practical outsourcing of linear programming in cloud computing, in Proc. 30th IEEE Int. Conf. Comput. Commun., 2011, pp. 820-828.
54. C. Wang, K. Ren, J. Wang, and Q. Wang, Harnessing the cloud for securely outsourcing large-scale systems of linear equations, IEEE Trans. Parallel Distrib. Syst., vol. 24, no. 6, pp. 1172-1181, Jun. 2013.