Skip to main content
SpringerLink
Log in
Book cover

International Conference on Cryptology and Network Security

CANS 2016: Cryptology and Network Security pp 626–636Cite as

Implementation of Verified Set Operation Protocols Based on Bilinear Accumulators

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 10052))

Abstract

This paper proposes an efficient protocol for verifiable delegation of computation over outsourced set collections. It improves state of the art protocols by using asymmetric bilinear pairing settings for improved performance with respect to previous proposals based on symmetric settings. Moreover, it extends update operations by supporting efficient modifications over multiple sets. With respect to previous work the proposed protocol has a modular design, that clearly identifies its main building blocks and well-defined interfaces among them. This novel conceptualization allows easier auditing of the protocol security properties and serves as the blueprint of a novel implementation that is released publicly (https://weblab.ing.unimore.it/people/ferretti/versop/). To the best of our knowledge, this is the first public implementation of a protocol for verifiable sets operations.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Akinyele, J.A., Garman, C., Miers, I., Pagano, M.W., Rushanan, M., Green, M., Rubin, A.D.: Charm: a framework for rapidly prototyping cryptosystems. J. Crypt. Eng. 3(2), 111–128 (2016). http://charm-crypto.com/

    Google Scholar 

  2. Andreolini, M., Colajanni, M., Marchetti, M.: A collaborative framework for intrusion detection in mobile networks. Inf. Sci. 321(C), 179–192 (2015)

    Article  Google Scholar 

  3. Andreolini, M., Colajanni, M., Pietri, M., Tosi, S.: Adaptive, scalable and reliable monitoring of big data on clouds. J. Parallel Distrib. Comput. 79(C), 67–79 May 2015

    Google Scholar 

  4. Benaloh, J., De Mare, M.: One-way accumulators: a decentralized alternative to digital signatures. In: Proceedings of IACR CRYPTO (1993)

    Google Scholar 

  5. Beuchat, J.-L., González-Díaz, J.E., Mitsunari, S., Okamoto, E., Rodríguez-Henríquez, F., Teruya, T.: High-speed software implementation of the optimal ate pairing over barreto–naehrig curves. In: International Conference on Pairing-Based Cryptography, 20 July 2016. https://github.com/herumi/ate-pairing

  6. Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In: Proceedings of 2012 ACM Third International Conference on Innovations in Theoretical Computer Science (2012)

    Google Scholar 

  7. Canetti, R., Paneth, O., Papadopoulos, D., Triandopoulos, N.: Verifiable set operations over outsourced databases. In: Proceedings of 2014 IACR International Conference on Public-Key Cryptography (2014)

    Google Scholar 

  8. Chatterjee, S., Hankerson, D., Menezes, A.: On the efficiency and security of pairing-based protocols in the type 1 and type 4 settings. In: Hasan, M.A., Helleseth, T. (eds.) WAIFI 2010. LNCS, vol. 6087, pp. 114–134. Springer, Heidelberg (2010). doi:10.1007/978-3-642-13797-6_9

    Chapter  Google Scholar 

  9. Colajanni, M., Gozzi, D., Marchetti, M.: Enhancing interoperability and stateful analysis of cooperative network intrusion detection systems. In: Proceedings of ACM Symposium on Architecture for Networking and Communications (2007)

    Google Scholar 

  10. Damgård, I.B.: Towards practical public key systems secure against chosen ciphertext attacks. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 445–456. Springer, Heidelberg (1992). doi:10.1007/3-540-46766-1_36

    Google Scholar 

  11. Ferretti, L., Colajanni, M., Marchetti, M.: Distributed, concurrent, and independent access to encrypted cloud databases. IEEE Trans. Parallel Distrib. Syst. 25(2), 437–446 (2014)

    Article  Google Scholar 

  12. Ferretti, L., Pierazzi, F., Colajanni, M., Marchetti, M.: Scalable architecture for multi-user encrypted sql operations on cloud database services. IEEE Trans. Cloud Comput. 2(4), 448–458 (2014)

    Article  Google Scholar 

  13. Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Proceedings of IACR CRYPTO (2004)

    Google Scholar 

  14. Galbraith, S.D., Paterson, K.G., Smart, N.P.: Pairings for cryptographers. Discrete Appl. Math. 156(16), 3113–3121 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  15. Lodi, G., Querzoni, L., Baldoni, R., Marchetti, M., Colajanni, M., Bortnikov, V., Chockler, G., Dekel, E., Laventman, G., Roytman, A.: Defending financial infrastructures through early warning systems: the intelligence cloud approach. In: Proceedings of 5th ACM Workshop CSIIRW (2009)

    Google Scholar 

  16. Lynn, B.: On the implementation of pairing-based cryptosystems. Ph.D. thesis, Stanford University, 20 July 2016. https://crypto.stanford.edu/pbc/

  17. Naehrig, M., Niederhagen, R., Schwabe, P.: New software speed records for cryptographic pairings. In: Abdalla, M., Barreto, P.S.L.M. (eds.) LATINCRYPT 2010. LNCS, vol. 6212, pp. 109–123. Springer, Heidelberg (2010). doi:10.1007/978-3-642-14712-8_7

    Chapter  Google Scholar 

  18. Nguyen, L.: Accumulators from bilinear pairings and applications. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 275–292. Springer, Heidelberg (2005). doi:10.1007/978-3-540-30574-3_19

    Chapter  Google Scholar 

  19. Papamanthou, C., Tamassia, R., Triandopoulos, N.: Optimal verification of operations on dynamic sets. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 91–110. Springer, Heidelberg (2011). doi:10.1007/978-3-642-22792-9_6

    Chapter  Google Scholar 

  20. Papamanthou, C., Tamassia, R., Triandopoulos, N.: Authenticated hash tables. In: Proceedings of 15th ACM Conference on Computer and Communications Security (2008)

    Google Scholar 

  21. Preparata, F.P., Sarwate, D.V.: Computational complexity of fourier transforms over finite fields. Math. Comput. 31(139), 740–751 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  22. Shoup, V.: NTL: a library for doing number theory, 20 July 2016. http://www.shoup.net/ntl/

Download references

Acknowledgments

This work was supported by MAECI-CyberLab-2015/2016.

Author information

Authors and Affiliations

  1. Department of Engineering “Enzo Ferrari”, University of Modena and Reggio Emilia, Modena, Italy

    Luca Ferretti, Michele Colajanni & Mirco Marchetti

Authors
  1. Luca Ferretti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michele Colajanni
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mirco Marchetti
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Luca Ferretti .

Editor information

Editors and Affiliations

  1. Università degli Studi di Milano, Crema, Italy

    Sara Foresti

  2. Università degli Studi di Salerno, Fisciano, Italy

    Giuseppe Persiano

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Ferretti, L., Colajanni, M., Marchetti, M. (2016). Implementation of Verified Set Operation Protocols Based on Bilinear Accumulators. In: Foresti, S., Persiano, G. (eds) Cryptology and Network Security. CANS 2016. Lecture Notes in Computer Science(), vol 10052. Springer, Cham. https://doi.org/10.1007/978-3-319-48965-0_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-48965-0_41

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-48964-3

  • Online ISBN: 978-3-319-48965-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation