TRUESET: Faster verifiable set computations

Proceedings of the 23rd USENIX Security Symposium

Volumn , Issue , 2014, Pages 765-780

  Kosba, Ahmed E ^a   Papadopoulos, Dimitrios ^b   Papamanthou, Charalampos ^a   Sayed, Mahmoud F ^a   Shi, Elaine ^a   Triandopoulos, Nikos ^b,c  

^a UNIVERSITY OF MARYLAND   (United States)

^b BOSTON UNIVERSITY   (United States)

^c RSA Laboratories

Author keywords

[No Author keywords available]

Indexed keywords

OPEN SYSTEMS; POLYNOMIAL APPROXIMATION;

ARITHMETIC GATES; COMPUTATIONAL RESULTS; DESIGN AND IMPLEMENTATIONS; OPEN SOURCE IMPLEMENTATION; ORDERS OF MAGNITUDE; POLYNOMIAL TIME FUNCTIONS; PROTOTYPE IMPLEMENTATIONS; QUADRATIC POLYNOMIAL;

FUNCTION EVALUATION;

EID: 85076320533     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. M. Backes, D. Fiore, and R. M. Reischuk. Verifiable delegation of computation on outsourced data. In CCS, pages 863-874, 2013.
2. E. Ben-Sasson, A. Chiesa, D. Genkin, E. Tromer, and M. Virza. SNARKs for C: Verifying program executions succinctly and in zero knowledge. In CRYPTO (2), pages 90-108, 2013.
3. E. Ben-Sasson, A. Chiesa, E. Tromer and M. Virza. Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture. Cryptology ePrint Archive, Report 2013/879, 2013. http://eprint.iacr.org/.
4. J.-L. Beuchat, J. E. González-Díaz, S. Mitsunari, E. Okamoto, F. Rodríguez-Henríquez, and T. Teruya. High-speed software implementation of the optimal ate pairing over Barreto-Naehrig curves. In Pairing, pages 21-39. Springer, 2010.
5. N. Bitansky, R. Canetti, A. Chiesa, and E. Tromer. From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In ITCS, pages 326-349, 2012.
6. N. Bitansky, R. Canetti, A. Chiesa, and E. Tromer. Recursive composition and bootstrapping for SNARKS and proof-carrying data. In STOC, pages 111-120, 2013.
7. N. Bitansky, A. Chiesa, Y. Ishai, R. Ostrovsky, and O. Paneth. Succinct non-interactive arguments via linear interactive proofs. In TCC, pages 315-333, 2013.
8. D. Boneh and X. Boyen. Short signatures without random oracles and the SDH assumption in bilinear groups. J. Cryptology, 21(2), pages 149-177, 2008.
9. B. Braun, A. J. Feldman, Z. Ren, S. T. V. Setty, A. J. Blumberg, and M. Walfish. Verifying computations with state. In SOSP, pages 341-357, 2013.
10. R. Canetti, O. Paneth, D. Papadopoulos, and N. Triandopoulos. Verifiable set operations over outsourced databases. In PKC, pages 113-130, 2014.
11. K.-M. Chung, Y. T. Kalai, F.-H. Liu, and R. Raz. Memory delegation. In CRYPTO, pages 151-168, 2011.
12. K.-M. Chung, Y. T. Kalai, and S. P. Vadhan. Improved delegation of computation using fully homo-morphic encryption. In CRYPTO, pages 483-501, 2010.
13. R. Gennaro, C. Gentry, and B. Parno. Non-interactive verifiable computing: Outsourcing computation to untrusted workers. In CRYPTO, pages 465-482, 2010.
14. R. Gennaro, C. Gentry, B. Parno, and M. Raykova. Quadratic span programs and succinct NIZKs without PCPs. In EUROCRYPT, pages 626-645, 2013.
15. T. Granlund and the GMP development team. GMP: The GNU Multiple Precision Arithmetic Library, 2006. Available at http://gmplib.org/.
16. J. Groth. Short pairing-based non-interactive zero-knowledge arguments. In ASIACRYPT, pages 321-340, 2010.
17. P. Jaccard. Etude comparative de la distribution florale dans une portion des Alpes et du Jura. Impr. Corbaz, 1901.
18. L. Kissner and D. X. Song. Privacy-preserving set operations. In CRYPTO, pages 241-257, 2005.
19. D. E. Knuth. The art of computer programming. Pearson Education, 2005.
20. A. E. Kosba, D. Papadopoulos, C. Papamanthou, M. F. Sayed, E. Shi, and N. Triandopoulos. TRUE-SET: Nearly practical verifiable set computations. Cryptology ePrint Archive, Report 2014/160, 2014. http://eprint.iacr.org/2014/160.
21. S. Micali. Computationally sound proofs. SIAM J. Comput., 30(4):1253-1298, 2000.
22. C. Papamanthou, R. Tamassia, and N. Triandopoulos. Optimal verification of operations on dynamic sets. In CRYPTO, pages 91-110, 2011.
23. B. Parno, J. Howell, C. Gentry, and M. Raykova. Pinocchio: Nearly practical verifiable computation. In IEEE Symposium on Security and Privacy, pages 238-252, 2013.
24. B. Parno, M. Raykova, and V. Vaikuntanathan. How to delegate and verify in public: Verifiable computation from attribute-based encryption. In TCC, pages 422-439, 2012.
25. S. T. V. Setty, B. Braun, V. Vu, A. J. Blumberg, B. Parno, and M. Walfish. Resolving the conflict between generality and plausibility in verified computation. In EuroSys, pages 71-84, 2013.
26. S. T. V. Setty, R. McPherson, A. J. Blumberg, and M. Walfish. Making argument systems for outsourced computation practical (sometimes). In NDSS, 2012.
27. V. Shoup. NTL: Number theory library. Available at http://www.shoup.net/ntl/.
28. V. Shoup. A new polynomial factorization algorithm and its implementation. Journal of Symbolic Computation, 20(4), pages 363-397, 1995.
29. V. Vu, S. T. V. Setty, A. J. Blumberg, and M. Walfish. A hybrid architecture for interactive verifiable computation. In IEEE Symposium on Security and Privacy, pages 223-237, 2013.