Skip to main content
SpringerLink
Log in

Multiparty Evaluation of Finite State Machine

  • Conference paper
  • First Online:
Security and Privacy (ISEA-ISAP 2019)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 939))

Included in the following conference series:

  • 648 Accesses

Abstract

Finite State Machine (FSM) is a mathematical model of computation. FSM is often used to model the systems as a sequence of states and actions. The state captures the behavior of the system, and transition represents the action in the system. This paper presents a mechanism of privately evaluating FSM in the presence of the semi-honest adversary. We consider a set of mutually distrustful parties who want to evaluate a string on a FSM. Both the FSM and the input string are shared among the parties using a threshold secret sharing mechanism. Party individually does not know the FSM nor the input. Multiparty computation allows the parties to process the string on the FSM, collaboratively. During the execution, parties learn nothing more than the acceptance of the string.

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

Access this chapter

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

Institutional subscriptions

Notes

  1. 1.

    A genetic marker is a gene or DNA sequence with a known location on a chromosome that can be used to identify individuals or species.

  2. 2.

    Shares by a threshold secret sharing scheme.

  3. 3.

    The sequence of states due to the transitions remain secret.

  4. 4.

    For every state \(q_i \in Q\) and \(a\in \varSigma \), there is a transition in the FSM. If the FSM is not complete, one can add a sink state \(q_s\) and define transitions towards the \(q_s\) state.

  5. 5.

    The basic operation includes either PSS, PBS, sharing secret, multiplication or revealing secret. Multiple basic operations are often performed in parallel and considered as one round.

References

  1. Abe, M., Suzuki, K.: Receipt-free sealed-bid auction. In: Chan, A.H., Gligor, V. (eds.) ISC 2002. LNCS, vol. 2433, pp. 191–199. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45811-5_14

    Chapter  Google Scholar 

  2. Al-Riyami, S.S.: Cryptographic schemes based on elliptic curve pairings. Ph.D. thesis, Royal Holloway, University of London, UK (2004)

    Google Scholar 

  3. Al-Riyami, S.S., Paterson, K.G.: Certificateless public key cryptography. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 452–473. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-40061-5_29

    Chapter  Google Scholar 

  4. Aliasgari, M., Blanton, M.: Secure computation of hidden Markov models. In: 10th International Conference on Security and Cryptography SECRYPT 2013, pp. 242–253. SciTePress (2013)

    Google Scholar 

  5. Aliasgari, M., Blanton, M., Bayatbabolghani, F.: Secure computation of hidden Markov models and secure floating-point arithmetic in the malicious model. Int. J. Inf. Secur. 16(6), 577–601 (2017)

    Article  Google Scholar 

  6. Asharov, G., Lindell, Y., Rabin, T.: Perfectly-secure multiplication for any \(t<n/3\). In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22792-9_14

    Chapter  Google Scholar 

  7. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: 20th Annual ACM Symposium on Theory of Computing, pp. 1–10. ACM (1988)

    Google Scholar 

  8. Blake, I.F., Gao, S., Lambert, R.: Constructive problems for irreducible polynomials over finite fields. In: Gulliver, T.A., Secord, N.P. (eds.) ITA 1993. LNCS, vol. 793, pp. 1–23. Springer, Heidelberg (1994). https://doi.org/10.1007/3-540-57936-2_27

    Chapter  Google Scholar 

  9. blockgeeks.com: A beginner’s guide to smart contacts. https://blockgeeks.com/guides/smart-contract/

  10. Bogetoft, P., et al.: Secure multiparty computation goes live. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol. 5628, pp. 325–343. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-03549-4_20

    Chapter  Google Scholar 

  11. Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd Annual Symposium on Foundations of Computer Science, FOCS 2001, pp. 136–145. IEEE Computer Society (2001)

    Google Scholar 

  12. Damgård, I., Keller, M.: Secure multiparty AES (full paper). IACR Cryptology ePrint Archive, 2009/614 (2009)

    Google Scholar 

  13. Frikken, K.B.: Practical private DNA string searching and matching through efficient oblivious automata evaluation. In: Gudes, E., Vaidya, J. (eds.) DBSec 2009. LNCS, vol. 5645, pp. 81–94. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-03007-9_6

    Chapter  Google Scholar 

  14. Gennaro, R., Rabin, M.O., Rabin, T.: Simplified VSS and fact-track multiparty computations with applications to threshold cryptography. In: 17th Annual ACM Symposium on Principles of Distributed Computing, PODC 1998, pp. 101–111. ACM (1998)

    Google Scholar 

  15. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: 19th Annual ACM Symposium on Theory of Computing, pp. 218–229. ACM (1987)

    Google Scholar 

  16. Graham, R.D., Johnson, P.C.: Finite state machine parsing for internet protocols: faster than you think. In: IEEE Security and Privacy Workshops, SPW 2014, pp. 185–190. IEEE Computer Society (2014)

    Google Scholar 

  17. Harkavy, M., Tygar, J.D., Kikuchi, H.: Electronic auctions with private bids. In: 3rd USENIX Workshop on Electronic Commerce. USENIX Association (1998)

    Google Scholar 

  18. Liaw, H.-T.: A secure electronic voting protocol for general elections. Comput. Secur. 23(2), 107–119 (2004)

    Article  Google Scholar 

  19. Mavridou, A., Laszka, A.: Designing secure ethereum smart contracts: a finite state machine based approach. CoRR, abs/1711.09327 (2017)

    Google Scholar 

  20. Mavridou, A., Laszka, A.: Tool demonstration: FSolidM for designing secure ethereum smart contracts. In: Bauer, L., Küsters, R. (eds.) POST 2018. LNCS, vol. 10804, pp. 270–277. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-89722-6_11

    Chapter  Google Scholar 

  21. Mitrou, L., Gritzalis, D., Katsikas, S.K.: Revisiting legal and regulatory requirements for secure E-Voting. In: International Conference on Information Security (SEC 2002), pp. 469–480. Kluwer (2002)

    Google Scholar 

  22. Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: 12th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2001, pp. 448–457. Society for Industrial and Applied Mathematics (2001)

    Google Scholar 

  23. Nargis, I., Mohassel, P., Eberly, W.: Efficient multiparty computation for arithmetic circuits against a covert majority. In: Youssef, A., Nitaj, A., Hassanien, A.E. (eds.) AFRICACRYPT 2013. LNCS, vol. 7918, pp. 260–278. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38553-7_15

    Chapter  Google Scholar 

  24. Nguyen, H.X., Roughan, M.: Multi-observer privacy-preserving hidden Markov models. IEEE Trans. Signal Process. 61(23), 6010–6019 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  25. Rabin, M.O.: How to exchange secrets with oblivious transfer (2005). http://eprint.iacr.org/2005/187

  26. Sasakawa, H., Harada, H., duVerle, D., Arimura, H., Tsuda, K., Sakuma, J.: Oblivious evaluation of non-deterministic finite automata with application to privacy-preserving virus genome detection. In: 13th Workshop on Privacy in the Electronic Society, WPES 2014, pp. 21–30. ACM, New York (2014)

    Google Scholar 

  27. Seroussi, G.: Table of low-weight binary irreducible polynomials. Computer Systems Laboratory, Hewlett-Packard Company, August 1998

    Google Scholar 

  28. Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  29. Shamir, A.: Identity-based cryptosystems and signature schemes. In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 47–53. Springer, Heidelberg (1985). https://doi.org/10.1007/3-540-39568-7_5

    Chapter  Google Scholar 

  30. Troncoso-Pastoriza, J.R., Katzenbeisser, S., Celik, M.: Privacy preserving error resilient DNA searching through oblivious automata. In: 14th ACM Conference on Computer and Communications Security, CCS 2007, pp. 519–528. ACM (2007)

    Google Scholar 

  31. Yao, A.C.C.: Protocols for secure computations (extended abstract). In: 23rd Annual Symposium on Foundations of Computer Science, pp. 160–164. IEEE Computer Society (1982)

    Google Scholar 

  32. Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: 27th Annual Symposium on Foundations of Computer Science, pp. 162–167. IEEE Computer Society (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, National Institute of Technology Durgapur, Durgapur, India

    Dhaneshwar Mardi & Jaydeep Howlader

Authors
  1. Dhaneshwar Mardi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jaydeep Howlader
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jaydeep Howlader .

Editor information

Editors and Affiliations

  1. Indian Institute of Technology Guwahati, Guwahati, India

    Sukumar Nandi

  2. Indian Institute of Technology Jammu, Jammu, India

    Devesh Jinwala

  3. Indian Institute of Technology Bombay, Mumbai, India

    Virendra Singh

  4. Malaviya National Institute of Technology, Jaipur, India

    Vijay Laxmi

  5. Indian Institute of Technology Jammu, Jammu, Jammu and Kashmir, India

    Manoj Singh Gaur

  6. Department of Technical Education, Government of Gujarat, Rajkot, India

    Parvez Faruki

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mardi, D., Howlader, J. (2019). Multiparty Evaluation of Finite State Machine. In: Nandi, S., Jinwala, D., Singh, V., Laxmi, V., Gaur, M., Faruki, P. (eds) Security and Privacy. ISEA-ISAP 2019. Communications in Computer and Information Science, vol 939. Springer, Singapore. https://doi.org/10.1007/978-981-13-7561-3_17

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-7561-3_17

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-7560-6

  • Online ISBN: 978-981-13-7561-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation