Skip to main content
SpringerLink
Log in

Turn-Based Communication Channels

  • Conference paper
  • First Online:
Provable and Practical Security (ProvSec 2021)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 13059))

Included in the following conference series:

Abstract

We introduce the concept of turn-based communication channel between two mutually distrustful parties with communication consistency, i.e. both parties have the same message history, and happens in sets of exchanged messages across a limited number of turns. Our construction leverages on timed primitives. Namely, we consider a \(\mathsf{\Delta }\)-delay hash function definition and use it to establish turns in the channel. Concretely, we introduce the one-way turn-based communication scheme and the two-way turn-based communication protocol and provide a concrete instantiation that achieves communication consistency.

A full version of this paper can be found at https://eprint.iacr.org/2021/1126.

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 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.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. Alwen, J., Tackmann, B.: Moderately hard functions: definition, instantiations, and applications. In: TCC (2017). https://doi.org/10.1007/978-3-319-70500-2_17

  2. Azar, P.D., Goldwasser, S., Park, S.: How to incentivize data-driven collaboration among competing parties. In: ITCS (2016). https://doi.org/10.1145/2840728.2840758

  3. Baum, C., David, B., Dowsley, R., Nielsen, J.B., Oechsner, S.: TARDIS: time and relative delays in simulation. Technical Report 537 (2020)

    Google Scholar 

  4. Bentov, I., Gabizon, A., Mizrahi, A.: Cryptocurrencies without proof of work. In: FC (2016). https://doi.org/10.1007/978-3-662-53357-4_10

  5. Bitansky, N., Goldwasser, S., Jain, A., Paneth, O., Vaikuntanathan, V., Waters, B.: Time-lock puzzles from randomized encodings. In: ITCS (2016). https://doi.org/10.1145/2840728.2840745

  6. Boneh, D., Bonneau, J., Bünz, B., Fisch, B.: Verifiable delay functions. In: CRYPTO, vol. 10991 (2018). https://doi.org/10.1007/978-3-319-96884-1_25

  7. Boneh, D., Bünz, B., Fisch, B.: Batching techniques for accumulators with applications to IOPs and stateless blockchains. In: CRYPTO (2019). https://doi.org/10.1007/978-3-030-26948-7_20

  8. Boneh, D., Naor, M.: Timed commitments. In: CRYPTO (2000)

    Google Scholar 

  9. Dwork, C., Naor, M., Sahai, A.: Concurrent zero-knowledge. J. ACM 51(6) (2004). https://doi.org/10.1145/1039488.1039489

  10. Garay, J., Kiayias, A., Leonardos, N.: The bitcoin backbone protocol: analysis and applications. https://doi.org/10.1007/978-3-662-46803-6_10

  11. Kalai, Y.T., Lindell, Y., Prabhakaran, M.: Concurrent composition of secure protocols in the timing model. J. Cryptol. 20(4), 431–492 (2007). https://doi.org/10.1007/s00145-007-0567-1

    Article  MathSciNet  MATH  Google Scholar 

  12. Katz, J., Lindell, Y.: Introduction to modern cryptography (2014)

    Google Scholar 

  13. Katz, J., Maurer, U., Tackmann, B., Zikas, V.: Universally composable synchronous computation. In: TCC. https://doi.org/10.1007/978-3-642-36594-2_27

  14. Katz, J., Miller, A., Shi, E.: Pseudonymous broadcast and secure computation from cryptographic puzzles. Cryptology ePrint Archive, Report 2014/857 (2014). https://eprint.iacr.org/2014/857

  15. Kiayias, A., Russell, A., David, B., Oliynykov, R.: Ouroboros: a provably secure proof-of-stake blockchain protocol. In: CRYPTO, vol. 10401 (2017). https://doi.org/10.1007/978-3-319-63688-7_12

  16. Lenstra, A.K., Wesolowski, B.: A random zoo: sloth, unicorn, and trx. Cryptology ePrint Archive, Report 2015/366 (2015). https://eprint.iacr.org/2015/366

  17. Mahmoody, M., Moran, T., Vadhan, S.: Time-lock puzzles in the random oracle model. In: CRYPTO (2011). https://doi.org/10.1007/978-3-642-22792-9_3

  18. Malavolta, G., Thyagarajan, S.A.K.: Homomorphic time-lock puzzles and applications. In: CRYPTO (2019). https://doi.org/10.1007/978-3-030-26948-7_22

  19. Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and timed-release crypto. Technical report, Massachusetts Institute of Technology (1996)

    Google Scholar 

  20. Scafuro, A., Siniscalchi, L., Visconti, I.: Publicly verifiable proofs from blockchains. In: PKC (2019). https://doi.org/10.1007/978-3-030-17253-4_13

  21. Wesolowski, B.: Efficient verifiable delay functions. In: EUROCRYPT (2019). https://doi.org/10.1007/978-3-030-17659-4_13

Download references

Acknowledgements

This work was partially supported by the Swedish Research Council (Vetenskapsrådet) through the grant PRECIS (621-2014-4845), National Nature Science Foundation of China (No. 61972124), Zhejiang Provincial Natural Science Foundation of China (No. LY19F020019) and STINT grant (2017-7444).

Author information

Authors and Affiliations

  1. Chalmers University of Technology, Gothenburg, Sweden

    Carlo Brunetta & Aikaterini Mitrokotsa

  2. Department of Mathematical and Computing Science, School of Computing, Tokyo Institute of Technology, Tokyo, Japan

    Mario Larangeira & Keisuke Tanaka

  3. IOHK, Tokyo, Japan

    Mario Larangeira

  4. Yanqi Lake Beijing Institute of Mathematical Sciences and Applications, Beijing, China

    Bei Liang

  5. School of Computer Science, University of St. Gallen, St. Gallen, Switzerland

    Aikaterini Mitrokotsa

Authors
  1. Carlo Brunetta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mario Larangeira
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bei Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Aikaterini Mitrokotsa
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Keisuke Tanaka
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Carlo Brunetta .

Editor information

Editors and Affiliations

  1. South China Agricultural University, Guangzhou, China

    Qiong Huang

  2. Shanghai Jiao Tong University, Shanghai, China

    Yu Yu

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Brunetta, C., Larangeira, M., Liang, B., Mitrokotsa, A., Tanaka, K. (2021). Turn-Based Communication Channels. In: Huang, Q., Yu, Y. (eds) Provable and Practical Security. ProvSec 2021. Lecture Notes in Computer Science(), vol 13059. Springer, Cham. https://doi.org/10.1007/978-3-030-90402-9_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-90402-9_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-90401-2

  • Online ISBN: 978-3-030-90402-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation