Advertisement

Efficient and Secure Delegation to a Single Malicious Server: Exponentiation over Non-abelian Groups

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10931)

Abstract

Group exponentiation is an important and expensive operation used in many public-key cryptosystems and, more generally, cryptographic protocols. To expand the applicability of these solutions to computationally weaker devices, it has been advocated that this operation is delegated from a computationally weaker client to a computationally stronger server. Solving this problem in the case of a single, possibly malicious, server, has remained open since a formal model was introduced in [8]. Recently, in [10] we proposed practical and secure solutions applicable to a class of cyclic groups. In this paper, we propose efficient and secure solutions applicable to a large class of multiplicative groups, possibly beyond groups currently subject to quantum cryptanalysis attacks.

References

  1. 1.
    Anshel, I., Atkins, D., Goldfeld, D., Gunnels, P.E.: Post Quantum Group Theoretic Cryptography, November 2016. https://bit.ly/2svnv8z
  2. 2.
    Arbit, A., Livne, Y., Oren, Y., Wool, A.: Implementing public-key cryptography on passive RFID tags is practical. Int. J. Inf. Sec. 14(1), 85–99 (2015)CrossRefGoogle Scholar
  3. 3.
    Cavallo, B., Di Crescenzo, G., Kahrobaei, D., Shpilrain, V.: Efficient and secure delegation of group exponentiation to a single server. In: Mangard, S., Schaumont, P. (eds.) RFIDSec 2015. LNCS, vol. 9440, pp. 156–173. Springer, Cham (2015).  https://doi.org/10.1007/978-3-319-24837-0_10CrossRefGoogle Scholar
  4. 4.
    Dijk, M., Clarke, D., Gassend, B., Suh, G., Devadas, S.: Speeding up exponentiation using an untrusted computational resource. Des. Codes Crypt. 39(2), 253–273 (2006)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: outsourcing computation to untrusted workers. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 465–482. Springer, Heidelberg (2010).  https://doi.org/10.1007/978-3-642-14623-7_25CrossRefGoogle Scholar
  6. 6.
    Gryak, J., Kahrobaei, D.: The status of polycyclic group-based cryptography: a survey and open problems. Groups Complexity Cryptology 8(2), 171–186 (2016)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Hart, D., Kim, D.H., Micheli, G., Pascual-Perez, G., Petit, C., Quek, Y.: A practical cryptanalysis of WalnutDSA\(^{\text{ TM }}\). In: Abdalla, M., Dahab, R. (eds.) PKC 2018. LNCS, vol. 10769, pp. 381–406. Springer, Cham (2018).  https://doi.org/10.1007/978-3-319-76578-5_13CrossRefGoogle Scholar
  8. 8.
    Hohenberger, S., Lysyanskaya, A.: How to securely outsource cryptographic computations. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 264–282. Springer, Heidelberg (2005).  https://doi.org/10.1007/978-3-540-30576-7_15CrossRefGoogle Scholar
  9. 9.
    Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of 35th IEEE Symposium on Foundations of Computer Science (FOCS 1994), pp. 124–134 (1994)Google Scholar
  10. 10.
    Di Crescenzo, G., Khodjaeva, M., Kahrobaei, D., Shpilrain, V.: Practical and secure outsourcing of discrete log group exponentiation to a single malicious server. In: Proceedings of 9th ACM Cloud Computing Security Workshop (CCSW), pp. 17–28 (2017)Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Perspecta LabsBasking RidgeUSA
  2. 2.City University of New YorkNew YorkUSA
  3. 3.John Jay College, City University of New YorkNew YorkUSA
  4. 4.City University of New YorkNew YorkUSA

Personalised recommendations