Skip to main content
Top
Published in: Cluster Computing 1/2019

10-03-2018

An augmented approach for pseudo-free groups in smart cyber-physical system

Authors: M. V. Ranjith Kumar, N. Bhalaji, Swathi Singh

Published in: Cluster Computing | Special Issue 1/2019

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

The contemporary advancement in smart technology has led to a greater business prospective. Smart system like cyber-physical system (CPS) has become prevalent in many area of applications. Challenges in integration of CPS with group of network has physical components to sense the state of changes in the real world is paving way towards the introduction of enhanced security mechanism. In this paper, we propose a security framework for group of network is a pseudo-free to communicate with the cyber physical system to assure high security. Pseudo-freeness is a very strong assumption of security used in cryptography. Group is said to be pseudo-free group, if an adversary who is allowed to see group description, is unable to solve non-trivial equations. Non-trivial equations are the equations that have no solution in a free group. The notion of pseudo-freeness was introduced with few open problems whether such groups exists in cryptosystem or not. The conjecture that the RSA group is pseudo-free has been settled for case of static adversary who is given only the group description and its goal is to come up with an equation and solution. Later on the notion of pseudo-freeness has been extended to adaptive adversary for case of univariate equations. In case of adaptive pseudo-free groups, the adversary learns solutions of some non-trivial equations before producing a new equation. Here we make extension to the notion of pseudo-free groups from univariate to multivariate equations and system of equations in face of adaptive adversary. We define and prove the security of adaptive pseudo-free groups for case of multivariate equations and system of equations. According to the results, this framework can be used as a system design for a group to have strong security with cyber physical system.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Babai, L.: Randomization in group algorithms: conceptual questions. L. Finkelstein and W.M. Kantor, editors, Groups and Computation2. Proc1995 DIMACS Workshop, volume28 of DIAMS Ser.in Discr. Math and Theor. Comp.Sci., pages 1-16. AMS (1997) https://doi.org/10.1090/dimacs/028/01 Babai, L.: Randomization in group algorithms: conceptual questions. L. Finkelstein and W.M. Kantor, editors, Groups and Computation2. Proc1995 DIMACS Workshop, volume28 of DIAMS Ser.in Discr. Math and Theor. Comp.Sci., pages 1-16. AMS (1997) https://​doi.​org/​10.​1090/​dimacs/​028/​01
2.
go back to reference Bellare, M., Rogway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: First ACM Conference on Computer and Communications Security, pp. 62–73, Fairfax, Virginia, USA, November 3–5, (1993). ACM Press, https://doi.org/10.1145/168588.168596 Bellare, M., Rogway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: First ACM Conference on Computer and Communications Security, pp. 62–73, Fairfax, Virginia, USA, November 3–5, (1993). ACM Press, https://​doi.​org/​10.​1145/​168588.​168596
3.
go back to reference Catalano, D., Fiore, D., Warinschi, B.: Adaptive pseudo-free groups and applications. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 207–223. Springer, Berlin, Heidelberg (2011) Catalano, D., Fiore, D., Warinschi, B.: Adaptive pseudo-free groups and applications. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 207–223. Springer, Berlin, Heidelberg (2011)
7.
go back to reference Rivest, L., Hohenberger, S.R.: The Cryptographic impact of groups with infeasible inversion. Susan, New York (2003) Rivest, L., Hohenberger, S.R.: The Cryptographic impact of groups with infeasible inversion. Susan, New York (2003)
8.
go back to reference Hirano, T., Tanaka, K.: Variations on pseudo-free groups. In: Research Reports, Series C: Computer Science, C-239, Tokyo Institute of Technology (2007) Hirano, T., Tanaka, K.: Variations on pseudo-free groups. In: Research Reports, Series C: Computer Science, C-239, Tokyo Institute of Technology (2007)
Metadata
Title
An augmented approach for pseudo-free groups in smart cyber-physical system
Authors
M. V. Ranjith Kumar
N. Bhalaji
Swathi Singh
Publication date
10-03-2018
Publisher
Springer US
Published in
Cluster Computing / Issue Special Issue 1/2019
Print ISSN: 1386-7857
Electronic ISSN: 1573-7543
DOI
https://doi.org/10.1007/s10586-018-2353-2

Other articles of this Special Issue 1/2019

Cluster Computing 1/2019 Go to the issue

Premium Partner