{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T11:03:48Z","timestamp":1772103828765,"version":"3.50.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319678061","type":"print"},{"value":"9783319678078","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-67807-8_1","type":"book-chapter","created":{"date-parts":[[2017,9,26]],"date-time":"2017-09-26T08:22:18Z","timestamp":1506414138000},"page":"1-17","source":"Crossref","is-referenced-by-count":6,"title":["Efficient Implementation of Pedersen Commitments Using Twisted Edwards Curves"],"prefix":"10.1007","author":[{"given":"Christian","family":"Franck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johann","family":"Gro\u00dfsch\u00e4dl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,27]]},"reference":[{"key":"1_CR1","unstructured":"Atkin, A.O.: Probabilistic primality testing (summary by F. Morain). In: INRIA Research Report 1779, pp. 159\u2013163 (1992.) http:\/\/algo.inria.fr\/seminars\/sem91-92\/atkin.pdf"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/11745853_14","volume-title":"Public Key Cryptography - PKC 2006","author":"DJ Bernstein","year":"2006","unstructured":"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\u2013228. Springer, Heidelberg (2006). doi: 10.1007\/11745853_14"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-540-68164-9_26","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2008","author":"DJ Bernstein","year":"2008","unstructured":"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\u2013405. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-68164-9_26"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Duif, N., Lange, T., Schwabe, P., Yang, B.-Y.: High-speed high-security signatures. J. Cryptographic Eng. 1\u201313 (2012)","DOI":"10.1007\/s13389-012-0027-1"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/3-540-69053-0_22","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1997","author":"S Brands","year":"1997","unstructured":"Brands, S.: Rapid demonstration of linear relations connected by boolean operators. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 318\u2013333. Springer, Heidelberg (1997). doi: 10.1007\/3-540-69053-0_22"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-47555-9_18","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1992","author":"EF Brickell","year":"1993","unstructured":"Brickell, E.F., Gordon, D.M., McCurley, K.S., Wilson, D.B.: Fast exponentiation with precomputation. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 200\u2013207. Springer, Heidelberg (1993). doi: 10.1007\/3-540-47555-9_18"},{"issue":"1","key":"1_CR7","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D Chaum","year":"1988","unstructured":"Chaum, D.: The dining cryptographers problem: unconditional sender and recipient untraceability. J. Cryptol. 1(1), 65\u201375 (1988)","journal-title":"J. Cryptol."},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Chu, D., Gro\u00dfsch\u00e4dl, J., Liu, Z., M\u00fcller, V., Zhang, Y.: Twisted Edwards-form elliptic curve cryptography for 8-bit AVR-based sensor nodes. In: Xu, S., Zhao, Y. (eds.) Proceedings of the 1st ACM Workshop on Asia Public-Key Cryptography (AsiaPKC 2013), pp. 39\u201344. ACM Press (2013)","DOI":"10.1145\/2484389.2484398"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/3-540-48969-X_3","volume-title":"Lectures on Data Security","author":"I Damg\u00e5rd","year":"1999","unstructured":"Damg\u00e5rd, I.: Commitment schemes and zero-knowledge protocols. In: Damg\u00e5rd, I.B. (ed.) EEF School 1998. LNCS, vol. 1561, pp. 63\u201386. Springer, Heidelberg (1999). doi: 10.1007\/3-540-48969-X_3"},{"key":"1_CR10","unstructured":"Demirel, D., Lancrenon, J.: How to securely prolong the computational bindingness of pedersen commitments. IACR Cryptology ePrint Archive 2015:584 (2015)"},{"issue":"3","key":"1_CR11","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1090\/S0273-0979-07-01153-6","volume":"44","author":"HM Edwards","year":"2007","unstructured":"Edwards, H.M.: A normal form for elliptic curves. Bull. Am. Math. Soc. 44(3), 393\u2013422 (2007)","journal-title":"Bull. Am. Math. Soc."},{"key":"1_CR12","unstructured":"Franck, C., Sorger, U.K.: Untraceable voip communication based on dc-nets. CoRR, abs\/1610.06549 (2016)"},{"key":"1_CR13","unstructured":"Franck, C., van de Graaf, J.: Dining cryptographers are practical (preliminary version). CoRR, abs\/1402.2269 (2014)"},{"key":"1_CR14","unstructured":"Ghatpande, S., Gro\u00dfsch\u00e4dl, J., Liu, Z.: A family of lightweight twisted Edwards curves for the Internet of things. Preprint, submitted for publication (2017)"},{"key":"1_CR15","volume-title":"Guide to Elliptic Curve Cryptography","author":"DR Hankerson","year":"2004","unstructured":"Hankerson, D.R., Menezes, A.J., Vanstone, S.A.: Guide to Elliptic Curve Cryptography. Springer, New York (2004)"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-540-89255-7_20","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"H Hisil","year":"2008","unstructured":"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\u2013343. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-89255-7_20"},{"key":"1_CR17","unstructured":"Intel Corporation: How to Benchmark Code Execution Times on Intel\u00ae IA-32 and IA-64 Instruction Set Architectures (2010). White paper http:\/\/www.intel.com\/content\/dam\/www\/public\/us\/en\/documents\/white-papers\/ia-32-ia-64-benchmark-code-execution-paper.pdf"},{"key":"1_CR18","unstructured":"Intel Corporation: Intel\u00ae Quark\u2122 SoC X1000 (2015). Product specification http:\/\/ark.intel.com\/products\/79084\/Intel-Quark-SoC-X1000-16K-Cache-400-MHz"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/3-540-48658-5_11","volume-title":"Advances in Cryptology \u2014 CRYPTO 1994","author":"CH Lim","year":"1994","unstructured":"Lim, C.H., Lee, P.J.: More flexible exponentiation with precomputation. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 95\u2013107. Springer, Heidelberg (1994). doi: 10.1007\/3-540-48658-5_11"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-319-40253-6_6","volume-title":"Information Security and Privacy","author":"Z Liu","year":"2016","unstructured":"Liu, Z., Gro\u00dfsch\u00e4dl, J., Li, L., Xu, Q.: Energy-efficient elliptic curve cryptography for msp430-based wireless sensor nodes. In: Liu, J.K.K., Steinfeld, R. (eds.) ACISP 2016. LNCS, vol. 9722, pp. 94\u2013112. Springer, Cham (2016). doi: 10.1007\/978-3-319-40253-6_6"},{"key":"1_CR21","unstructured":"National Institute of Standards and Technology (NIST): Digital Signature Standard (DSS), July 2013. FIPS Publication 186\u20134, http:\/\/nvlpubs.nist.gov\/nistpubs\/FIPS\/NIST.FIPS.186-4.pdf"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology \u2014 CRYPTO 1991","author":"TP Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129\u2013140. Springer, Heidelberg (1992). doi: 10.1007\/3-540-46766-1_9"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Pippenger, N.: On the evaluation of powers and related problems. In: Proceedings of the 17th Annual Symposium on Foundations of Computer Science, pp. 258\u2013263. IEEE Computer Society (1976)","DOI":"10.1109\/SFCS.1976.21"}],"container-title":["Lecture Notes in Computer Science","Mobile, Secure, and Programmable Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67807-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T19:55:50Z","timestamp":1570132550000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67807-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319678061","9783319678078"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67807-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}