Modeling and Verification of Server Aided Verification Protocol Using NuSMV

  • Vikram Saralaya
  • Kishore J.K.
  • Sateesh Reddy
  • Sanjay Singh
Part of the Communications in Computer and Information Science book series (CCIS, volume 204)

Abstract

Cryptographic algorithms are useful for signing and verifying the authenticity of sender of the message. The verifier may not have the required computational ability and relies on a powerful server to aid the verification process. The server and the illegitimate prover/signer may collaborate and try to cheat the verifier. A legitimate prover can also repudiate the message sent by himself. In this paper we model the scenario where the legitimate, cheating or repudiating prover sign’s the message. The verifier then authenticates the message via an untrusted server. Specifications are written using CTL(Computational-Tree Logic). NuSMV(extension of Symbolic Model Verifier) is the tool used to verify the specifications.

Keywords

Smart Card Authentication Protocol Idle State Server Module Symbolic Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Girault, M., Lefranc, D.: Server-aided verification: Theory and practice. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 605–623. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  2. 2.
    Chow, S.S.M., Au, M.H., Susilo, W.: Server-aided signatures verification secure against collusion attack. In: Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security, ASIACCS 2011, pp. 401–405. ACM, New York (2011)Google Scholar
  3. 3.
    Wu, W., Mu, Y., Susilo, W., Huang, X.: Server-aided verification signatures: Definitions and new constructions. In: Baek, J., Bao, F., Chen, K., Lai, X. (eds.) ProvSec 2008. LNCS, vol. 5324, pp. 141–155. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  4. 4.
    Wu, W., Mu, Y., Susilo, W., Huang, X.: Provably secure server-aided verification signatures. Comput. Math. Appl. 61, 1705–1723 (2011)CrossRefMATHGoogle Scholar
  5. 5.
    Pfitzmann, B., Waidner, M.: Attacks on protocols for server-aided rsa computation. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 153–162. Springer, Heidelberg (1993)CrossRefGoogle Scholar
  6. 6.
    Begiun, P., Quisquater, J.J.: Fast server-aided rsa signatures secure against active attacks. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 57–69. Springer, Heidelberg (1995)Google Scholar
  7. 7.
    Cavada, R., Cimatti, A., Jochim, C.A., Keighren, G., Olivetti, E., Pistore, M., Roveri, M., Tchaltsev, A.: Nusmv 2.4 user manual (2005)Google Scholar
  8. 8.
    Cavada, R.: Nusmv: a new symbolic model checker (2010), http://nusmv.fbk.eu/
  9. 9.
    Stallings, W.: Cryptography and Network Security: Principles and Practice, 5th edn. Prentice Hall, Englewood Cliffs (2010)Google Scholar
  10. 10.
    Huth, M., Ryan, M.: Logic in Computer Science, Modelling and Reasoning about Systems, 2nd edn. Cambridge University Press, Edinburgh (2005)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Vikram Saralaya
    • 1
  • Kishore J.K.
    • 1
  • Sateesh Reddy
    • 1
  • Sanjay Singh
    • 1
  1. 1.Department of Information and Communication Technology, Manipal Institute of TechnologyManipal UniversityManipalIndia

Personalised recommendations