Skip to main content
SpringerLink
Log in

Unsatisfiability of Comparison-Based Non-malleability for Commitments

  • Conference paper
  • First Online:
Theoretical Aspects of Computing – ICTAC 2022 (ICTAC 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13572))

Included in the following conference series:

  • 299 Accesses

Abstract

There are two distinct formulations of non-malleability of commitments found in the literature: the comparison-based definition and the simulation-based definition. In this paper, we prove that the comparison-based definition is unsatisfiable by any realistic commitment scheme. Our proof is fully formalized in the EasyCrypt theorem prover.

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.

    An example of a non-trivial relation could be that the message \(m'\) is the same as m except all occurrences of “PAY TO: Alice” are replaced with “PAY TO: Mallory”.

  2. 2.

    We assume that in realistic schemes commitment values contain a sufficient amount of randomness.

References

  1. Di Crescenzo, G., Katz, J., Ostrovsky, R., Smith, A.: Efficient and non-interactive non-malleable commitment. Cryptology ePrint Archive, Report 2001/032 (2001). https://ia.cr/2001/032

  2. Firsov, D., Zhuchko, E., Laur, S.: Formal analysis of non-malleability for commitments in EasyCrypt (2022). https://github.com/dfirsov/comparison-based-non-malleabiltiy-unsat

  3. Khalfaoui, S., Leneutre, J., Villard, A., Ma, J., Urien, P.: Security analysis of out-of-band device pairing protocols: a survey. Wirel. Commun. Mob. Comput. 2021, 1–30 (2021)

    Article  Google Scholar 

  4. Koblitz, N., Menezes, A.: Critical perspectives on provable security: fifteen years of “another look’’ papers. Adv. Math. Commun. 13, 517–558 (2019)

    Article  MathSciNet  Google Scholar 

  5. Laur, S., Nyberg, K.: Efficient mutual data authentication using manually authenticated strings. In: Pointcheval, D., Mu, Y., Chen, K. (eds.) CANS 2006. LNCS, vol. 4301, pp. 90–107. Springer, Heidelberg (2006). https://doi.org/10.1007/11935070_6

    Chapter  Google Scholar 

  6. Li, M., et al.: Secure ad-hoc trust initialization and key management in wireless body area networks. ACM Trans. Sensor Netw. 9(2), 1–35 (2012)

    Article  Google Scholar 

  7. Mirzadeh, S., Cruickshank, H., Tafazolli, R.: Secure device pairing: a survey. IEEE Commun. Surv. Tutor. 16(1), 17–40 (2014)

    Article  Google Scholar 

Download references

Acknowledgments

This work was partially supported by the ESF-funded Estonian IT Academy research measure (project 2014-2020.4.05.19-0001), the ERDF-funded centre of excellence EXCITE (project 2014-2020.4.01.15-0018) and the Estonian Research Council grant no. PRG49.

Author information

Authors and Affiliations

  1. Guardtime, Tallinn, Estonia

    Denis Firsov

  2. Tallinn University of Technology, Tallinn, Estonia

    Denis Firsov & Ekaterina Zhuchko

  3. Tartu University, Tartu, Estonia

    Sven Laur & Ekaterina Zhuchko

Authors
  1. Denis Firsov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sven Laur
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ekaterina Zhuchko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Denis Firsov .

Editor information

Editors and Affiliations

  1. TU München, München, Germany

    Helmut Seidl

  2. Southwest University, Chongqing, China

    Zhiming Liu

  3. NASA Ames Research Center, Moffett Field, CA, USA

    Corina S. Pasareanu

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Firsov, D., Laur, S., Zhuchko, E. (2022). Unsatisfiability of Comparison-Based Non-malleability for Commitments. In: Seidl, H., Liu, Z., Pasareanu, C.S. (eds) Theoretical Aspects of Computing – ICTAC 2022. ICTAC 2022. Lecture Notes in Computer Science, vol 13572. Springer, Cham. https://doi.org/10.1007/978-3-031-17715-6_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-17715-6_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-17714-9

  • Online ISBN: 978-3-031-17715-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation