Abstract
This paper presents multi-user protocol-extensions for Schnorr/Nyberg-Ruepple (NR) signatures and Zheng signcryption, both of which are elliptic curve (EC)/discrete logarithmic (DL) formulations. Our extension methodology is based on k-of-n threshold cryptography—with Shamir polynomial parameterisation and Feldman-Pedersen verification–resulting in multi-sender Schnorr-NR (SNR) and multi-sender/receiver Zheng-NR (ZNR) protocols, all of which are interoperable with their single-user base formulations. The ZNR protocol-extensions are compared with the earlier Takaragi et al multi-user sign-encryption, which is extended from a base-protocol with two random key-pairs following the usual specification of one each of signing and encryption. Both single and double-pair formulations are analysed from the viewpoint of EC equivalence (EQ) establishment, which is required for rigorous multi-sender functionality. We outline a rectification to the original Takaragi et al formulation; thereby enabling parameter-share verification, but at significantly increased overheads. This enables comprehensive equivalent-functionality comparisons with the various multi-user ZNR protocol-extensions. The single-pair ZNR approach is shown to be significantly more efficient, in some cases demonstrating a two/three-fold advantage.
Chapter PDF
References
Shamir, A.: How to Share a Secret. Assoc. Comp. Machinery (ACM) Comms. 22(11), 612–613 (1979)
Feldman, P.: A Practical Scheme for Non-Interactive Verifiable Secret-Sharing. In: 28th IEEE Symp. on the Foundations of Comp. Sc., pp. 427–437 (1987)
Pedersen, T.P.: Distributed Provers with Applications to Undeniable Signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 221–238. Springer, Heidelberg (1991)
Pedersen, T.P.: A Threshold Cryptosystem without a Trusted Party. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 522–526. Springer, Heidelberg (1991)
Menezes, A.J.: Elliptic Curve Public-Key Cryptosystems. Kluwer Acad. Press, Dordrecht (1993)
Blake, I.F., Seroussi, G., Smart, N.P.: Elliptic Curves in Cryptography. Cambridge Univ. Press, Cambridge (1999)
Park, C., Kurosawa, K.: New ElGamal-Type Threshold Digital Signature Scheme. Inst. Electrical, Info. & Comms. Engineers (IEICE) Trans. E79-A(1), 86–93 (1996)
Takaragi, K., Miyazaki, K., Takahashi, M.: A Threshold Digital Signature Issuing Scheme without Secret Communication. Presentation IEEE P1363 Study Group for Public- key Crypto Stds (1998)
ElGamal, T.: A Public-Key Cryptosystem and Signature Scheme Based on Discrete Logarithms. IEEE Trans. Info Theory (1985)
Nyberg, K., Ruepple, R.: A New Signature Scheme Based on DSA Giving Message Recovery. In: 1st ACM Conf. on Comp. & Comms. Security, pp. 58–61. ACM Press, New York (1993)
Schnorr, C.P.: Efficient Identification and Signatures for Smartcards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 239–252. Springer, Heidelberg (1989)
Zheng, Y.: Digital Signcryption or how to Achieve Cost(Signature & Encryption) < < Cost(Signature) + Cost(Encryption). In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 291–312. Springer, Heidelberg (1997)
Chaum, D.L., Pedersen, T.P.: Wallet Databases with Observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 89–105. Springer, Heidelberg (1993)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 IFIP International Federation for Information Processing
About this paper
Cite this paper
Goh, A., Ngo, D.C.L. (2003). Multipoint-to-Multipoint Secure-Messaging with Threshold-Regulated Authorisation and Sabotage Detection. In: Lioy, A., Mazzocchi, D. (eds) Communications and Multimedia Security. Advanced Techniques for Network and Data Protection. CMS 2003. Lecture Notes in Computer Science, vol 2828. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45184-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-45184-6_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20185-4
Online ISBN: 978-3-540-45184-6
eBook Packages: Springer Book Archive