Skip to main content

Modeling Distributed Private Key Generation by Composing Petri Nets

  • Chapter
  • First Online:
Transactions on Petri Nets and Other Models of Concurrency IX

Part of the book series: Lecture Notes in Computer Science ((TOPNOC,volume 8910))

  • 486 Accesses

Abstract

We present a Petri net model of a protocol for the distributed generation of id-based private keys. Those keys can then be used for secure communications. The components of the system are built as refinements of a common interface, by applying a formal operation based on a class of morphisms between Elementary Net Systems. It is then shown that we can derive behavioural properties of the composed system without building it explicitly, by exploiting properties of the given morphisms.

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

Access this chapter

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

Institutional subscriptions

References

  1. Bernardinello, L., Mangioni, E., Pomello, L.: Local state refinement and composition of elementary net systems: an approach based on morphisms. In: Koutny, M., van der Aalst, W.M.P., Yakovlev, A. (eds.) ToPNoC VIII. LNCS, vol. 8100, pp. 48–70. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  2. Bernardinello, L., Monticelli, E., Pomello, L.: On preserving structural and behavioural properties by composing net systems on interfaces. Fundam. Inform. 80(1–3), 31–47 (2007)

    MATH  MathSciNet  Google Scholar 

  3. Boneh, D., Franklin, M.K.: Identity-based encryption from the weil pairing. SIAM J. Comput. 32, 586–615 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Kate, A., Goldberg, I.: Asynchronous distributed private-key generators for identity-based cryptography. IACR Cryptology ePrint Archive 2009, 355 (2009)

    Google Scholar 

  5. Kilinc, G., Fovino, I.N., Ferigato, C., Koltuksuz, A.: A model of distributed key generation for industrial control systems. In: 11th Workshop on Discrete Event Systems, Guadalajara, Mexico, vol. 11, pp. 356–363 (2012)

    Google Scholar 

  6. Mangioni, E.: Modularity for system modelling and analysis. Ph.D. thesis, Universitá degli Studi di Milano-Bicocca, Dottorato di ricerca in Informatica, ciclo 24 (2013)

    Google Scholar 

  7. Milner, R.: Communication and Concurrency. Prentice-Hall Inc., Upper Saddle River (1989)

    MATH  Google Scholar 

  8. Nielsen, M., Plotkin, G.D., Winskel, G.: Petri nets, event structures and domains, part i. Theor. Comput. Sci. 13, 85–108 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  9. Nielsen, M., Rozenberg, G., Thiagarajan, P.S.: Elementary transition systems. Theor. Comput. Sci. 96(1), 3–33 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  10. Pomello, L., Rozenberg, G., Simone, C.: A survey of equivalence notions for net based systems. In: Rozenberg, G. (ed.) APN 1992. LNCS, vol. 609, pp. 410–472. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  11. Rozenberg, G., Engelfriet, J.: Elementary net systems. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 12–121. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  12. Shamir, A.: Identity-based cryptosystems and signature schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 47–53. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

Download references

Acknowledgements

This work was partially supported by MIUR and by MIUR - PRIN 2010/2011 grant ‘Automi e Linguaggi Formali: Aspetti Matematici e Applicativi’, code H41J12000190001.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Luca Bernardinello .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bernardinello, L., Kılınç, G., Mangioni, E., Pomello, L. (2014). Modeling Distributed Private Key Generation by Composing Petri Nets. In: Koutny, M., Haddad, S., Yakovlev, A. (eds) Transactions on Petri Nets and Other Models of Concurrency IX. Lecture Notes in Computer Science(), vol 8910. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45730-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-45730-6_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-45729-0

  • Online ISBN: 978-3-662-45730-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics