Skip to main content
Book cover

International Conference on Mobile, Secure, and Programmable Networking

MSPN 2020: Mobile, Secure, and Programmable Networking pp 89–109Cite as

Fast and Flexible Elliptic Curve Cryptography for Dining Cryptographers Networks

Part of the Lecture Notes in Computer Science book series (LNCCN,volume 12605)

Abstract

A Dining Cryptographers network (DCnet for short) allows anonymous communication with sender and receiver untraceability even if an adversary has unlimited access to the connection metadata of the network. Originally introduced by David Chaum in the 1980s, DCnets were for a long time considered not practical for real-world applications because of the tremendous communication and computation overhead they introduce. However, technological innovations such as 5G networks and extremely powerful 64-bit processors make a good case to reassess the practicality of DCnets. In addition, recent advances in elliptic-curve based commitment schemes and Zero-Knowledge Proofs (ZKPs) provide a great opportunity to reduce the computational cost of modern DCnets that are able to detect malicious behavior of communicating parties. In this paper we introduce X64ECC, a self-contained library for Elliptic Curve Cryptography (ECC) developed from scratch to support all the public-key operations needed by modern DCnets: key exchange, digital signatures, Pedersen commitments, and ZKPs. X64ECC is written in C and uses compiler intrinsics to speed up performance-critical arithmetic operations. It is highly scalable and works with Montgomery curves and twisted Edwards curves of different cryptographic strength. Despite its high scalability and portability, X64ECC is able to compute a fixed-base scalar multiplication on a twisted Edwards curve over a 255-bit prime field in about 145,000 clock cycles on a modern Intel X64 processor. All cryptosystems can be adapted on-the-fly (i.e. without recompilation) to implement DCnets with arbitrary message sizes, and tradeoffs between the cryptographic strength and throughput of a DCnet are possible.

This research is part of the DCnets project, which is supported by the NLnet Foundation and the NGI Zero PET Fund, see https://nlnet.nl/project/DCnets.

This is a preview of subscription content, access via your institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-030-67550-9_7
  • Chapter length: 21 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   64.99
Price excludes VAT (USA)
  • ISBN: 978-3-030-67550-9
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   84.99
Price excludes VAT (USA)
Learn about institutional subscriptions
Fig. 1.
Fig. 2.

References

  1. Bernstein, D.J.: Curve25519: new Diffie-Hellman speed records. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol. 3958, pp. 207–228. Springer, Heidelberg (2006). https://doi.org/10.1007/11745853_14

    CrossRef  Google Scholar 

  2. Bernstein, D.J., Birkner, P., Joye, M., Lange, T., Peters, C.: Twisted Edwards curves. In: Vaudenay, S. (ed.) AFRICACRYPT 2008. LNCS, vol. 5023, pp. 389–405. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-68164-9_26

    CrossRef  Google Scholar 

  3. Bernstein, D.J., Duif, N., Lange, T., Schwabe, P., Yang, B.Y.: High-speed high-security signatures. J. Cryptogr. Eng. 2(2), 77–89 (2012)

    CrossRef  Google Scholar 

  4. Bernstein, D.J., Lange, T.: Montgomery curves and the montgomery ladder. Cryptology ePrint Archive, Report 2017/293 (2017). https://eprint.iacr.org/2017/293

  5. Bernstein, D.J., Lange, T., Schwabe, P.: The security impact of a new cryptographic library. In: Hevia, A., Neven, G. (eds.) LATINCRYPT 2012. LNCS, vol. 7533, pp. 159–176. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33481-8_9

    CrossRef  Google Scholar 

  6. Bos, J., den Boer, B.: Detection of disrupters in the DC protocol. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 320–327. Springer, Heidelberg (1990). https://doi.org/10.1007/3-540-46885-4_33

    CrossRef  Google Scholar 

  7. Camenisch, J., Stadler, M.: Proof systems for general statements about discrete logarithms. Technical report/ETH Zurich, Department of Computer Science 260 (1997)

    Google Scholar 

  8. Chaum, D.: The dining cryptographers problem: unconditional sender and recipient untraceability. J. Cryptol. 1(1), 65–75 (1988)

    CrossRef  MathSciNet  Google Scholar 

  9. Corrigan-Gibbs, H., Ford, B.: Dissent: accountable anonymous group messaging. In: Proceedings of the 17th ACM Conference on Computer and Communications Security, pp. 340–350 (2010)

    Google Scholar 

  10. Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644–654 (1976)

    CrossRef  MathSciNet  Google Scholar 

  11. Düll, M., Haase, B., Hinterwälder, G., Hutter, M., Paar, C., Sánchez, A.H., Schwabe, P.: High-speed Curve25519 on 8-bit, 16-bit and 32-bit microcontrollers. Des. Codes Crypt. 77(2–3), 493–514 (2015)

    CrossRef  MathSciNet  Google Scholar 

  12. Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186–194. Springer, Heidelberg (1987). https://doi.org/10.1007/3-540-47721-7_12

    CrossRef  Google Scholar 

  13. Franck, C.: New directions for dining cryptographers. Master’s thesis, University of Luxembourg, 2008 (2008)

    Google Scholar 

  14. Franck, C.: Dining cryptographers with 0.924 verifiable collision resolution. Ann. UMCS Informatica 14(1), 49–59 (2014). https://doi.org/10.2478/umcsinfo-2014-0007

  15. Franck, C., van de Graaf, J.: Dining cryptographers are practical (2014)

    Google Scholar 

  16. Franck, C., Großschädl, J.: Efficient implementation of Pedersen commitments using twisted Edwards curves. In: Bouzefrane, S., Banerjee, S., Sailhan, F., Boumerdassi, S., Renault, E. (eds.) MSPN 2017. LNCS, vol. 10566, pp. 1–17. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-67807-8_1

    CrossRef  Google Scholar 

  17. Ghatpande, S., Großschädl, J., Liu, Z.: A family of lightweight twisted Edwards curves for the internet of things. In: Blazy, O., Yeun, C.Y. (eds.) WISTP 2018. LNCS, vol. 11469, pp. 193–206. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-20074-9_14

    CrossRef  Google Scholar 

  18. Golle, P., Juels, A.: Dining cryptographers revisited. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 456–473. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24676-3_27

    CrossRef  Google Scholar 

  19. Hankerson, D.R., Menezes, A.J., Vanstone, S.A.: Guide to Elliptic Curve Cryptography. Springer, New York (2004). https://doi.org/10.1007/b97644

    CrossRef  MATH  Google Scholar 

  20. Hisil, H., Wong, K.K.-H., Carter, G., Dawson, E.: Twisted Edwards curves revisited. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 326–343. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-89255-7_20

    CrossRef  Google Scholar 

  21. Intel Corporation: Intel Core i7–9750H Processor (12M Cache, up to 4.50 GHz) Product Specifications. https://ark.intel.com/content/www/us/en/ark/products/191045/intel-core-i7-9750h-processor-12m-cache-up-to-4-50-ghz.html

  22. Josefsson, S., Liusvaara, I.: Edwards-Curve Digital Signature Algorithm (EdDSA). Internet Research Task Force, Crypto Forum Research Group, RFC 8032, January 2017

    Google Scholar 

  23. Krasnova, A., Neikes, M., Schwabe, P.: Footprint scheduling for dining-cryptographer networks. In: Grossklags, J., Preneel, B. (eds.) FC 2016. LNCS, vol. 9603, pp. 385–402. Springer, Heidelberg (2017). https://doi.org/10.1007/978-3-662-54970-4_23

    CrossRef  Google Scholar 

  24. Langley, A., Hamburg, M., Turner, S.: Elliptic Curves for Security. RFC 7748, January 2016. https://doi.org/10.17487/RFC7748. https://rfc-editor.org/rfc/rfc7748.txt

  25. Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417–426. Springer, Heidelberg (1986). https://doi.org/10.1007/3-540-39799-X_31

    CrossRef  Google Scholar 

  26. Montgomery, P.L.: Speeding the Pollard and elliptic curve methods of factorization. Math. Comput. 48(177), 243–264 (1987)

    CrossRef  MathSciNet  Google Scholar 

  27. Öztürk, E., Guilford, J., Gopal, V.: Large integer squaring on intel architecture processors (2013). Intel white paper, available for download at http://www.intel.com/content/dam/www/public/us/en/documents/white-papers/large-integer-squaring-ia-paper.pdf

  28. Öztürk, E., Guilford, J., Gopal, V., Feghali, W.: New instructions supporting large integer arithmetic on intel architecture processors (2012). Intel white paper, available for download at http://www.intel.com/content/dam/www/public/us/en/documents/white-papers/ia-large-integer-arithmetic-paper.pdf

  29. De la Cadena, W., Kaiser, D., Mitseva, A., Panchenko, A., Engel, T.: Analysis of multi-path onion routing-based anonymization networks. In: Foley, S.N. (ed.) DBSec 2019. LNCS, vol. 11559, pp. 240–258. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-22479-0_13

    CrossRef  Google Scholar 

  30. Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129–140. Springer, Heidelberg (1992). https://doi.org/10.1007/3-540-46766-1_9

    CrossRef  Google Scholar 

  31. Pfitzmann, A.: Diensteintegrierende Kommunikationsnetze mit teilnehmerüberprüfbarem Datenschutz. Springer, Heidelberg (1990)

    CrossRef  Google Scholar 

  32. Ruffing, T., Moreno-Sanchez, P., Kate, A.: CoinShuffle: practical decentralized coin mixing for bitcoin. In: Kutyłowski, M., Vaidya, J. (eds.) ESORICS 2014. LNCS, vol. 8713, pp. 345–364. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-11212-1_20

    CrossRef  Google Scholar 

  33. Samsung: 6G - the next hyper-connected experience for all. Technical report, Samsung Research (2020)

    Google Scholar 

  34. Schnorr, C.P.: Efficient identification and signatures for smart cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 239–252. Springer, New York (1990). https://doi.org/10.1007/0-387-34805-0_22

    CrossRef  Google Scholar 

  35. Vaillant, L.: Monocypher (2020). https://monocypher.org/manual/hash

  36. Waidner, M.: Unconditional sender and recipient untraceability in spite of active attacks. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 302–319. Springer, Heidelberg (1990). https://doi.org/10.1007/3-540-46885-4_32

    CrossRef  MATH  Google Scholar 

  37. Waidner, M., Pfitzmann, B.: The dining cryptographers in the disco: unconditional sender and recipient untraceability with computationally secure serviceability. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, p. 690. Springer, Heidelberg (1990). https://doi.org/10.1007/3-540-46885-4_69

    CrossRef  Google Scholar 

  38. Wu, H., Wang, F.: A survey of noninteractive zero knowledge proof system and its applications. Sci. World J. 2014 (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Luxembourg, 6, Avenue de la Fonte, 4364, Esch-sur-Alzette, Luxembourg

    Briag Dupont, Christian Franck & Johann Großschädl

Authors
  1. Briag Dupont
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christian Franck
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Johann Großschädl
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christian Franck .

Editor information

Editors and Affiliations

  1. Cedric Lab, Cnam, Paris, France

    Dr. Samia Bouzefrane

  2. Télécom SudParis, Evry, France

    Maryline Laurent

  3. Cedric Lab, Cnam, Paris, France

    Selma Boumerdassi

  4. LIGM, ESIEE, Noisy-le-Grand, France

    Eric Renault

Rights and permissions

Reprints and Permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Verify currency and authenticity via CrossMark

Cite this paper

Dupont, B., Franck, C., Großschädl, J. (2021). Fast and Flexible Elliptic Curve Cryptography for Dining Cryptographers Networks. In: Bouzefrane, S., Laurent, M., Boumerdassi, S., Renault, E. (eds) Mobile, Secure, and Programmable Networking. MSPN 2020. Lecture Notes in Computer Science(), vol 12605. Springer, Cham. https://doi.org/10.1007/978-3-030-67550-9_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-67550-9_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-67549-3

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

  • eBook Packages: Computer ScienceComputer Science (R0)