Article

Provably Secure Code-Based Threshold Ring Signatures

Authors:

Léonard Dallot,

Damien VergnaudAuthors Info & Claims

Cryptography and Coding '09: Proceedings of the 12th IMA International Conference on Cryptography and Coding

Pages 222 - 235

https://doi.org/10.1007/978-3-642-10868-6_13

Published: 03 December 2009 Publication History

Abstract

A threshold ring signature scheme enables a set of users to sign a message such that a finite set of possible signers (the ring) is identified, without revealing which subset of ring members actually produced the signature. A recent proposal of Aguillar <em>et al.</em> introduced the first code-based threshold ring signature scheme which large signatures (about 20KBytes per member of the ring for 80-bit security).

We propose a new code-based threshold ring signature scheme that achieves small signature size of 675<em>N</em> *** 228*** bits, where <em>N</em> is the number of members in the ring and *** is the number of signers, for a security level of 80 bits. We give a security proof of our scheme whose security relies -- in both random oracle and ideal cipher models -- on two coding theory problems, making our scheme the first provably secure code-based threshold ring signature scheme. Unfortunately, as often in code-based cryptography, the presented scheme leads to very large public keys.

References

[1]

Augot, D., Finiasz, M., Gaborit, P., Manuel, S., Sendrier, N.: Fast syndrome-based hash function. SHA-3 Proposal: FSB (2008), http://www-roc.inria.fr/secret/CBCrypto/index.php?pg=fsb

[2]

Adida, B., Hohenberger, S., Rives, R.L.: Ad-hoc-group signatures from hijacked keypairs. In: DIMACS Workshop on Theft in e-commerce (2005), http://theory.lcs.mit.edu/~rivest/publications.html

[3]

Aguilar Melchor, C., Cayrel, P.L., Gaborit, P.: A new efficient threshold ring signature scheme based on coding theory. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol. 5299, pp. 31-46. Springer, Heidelberg (2008).

[4]

Berger, T., Cayrel, P.L., Gaborit, P., Otmani, A.: Reducing key length of the McEliece cryptosystem. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS, vol. 5580, pp. 60-76. Springer, Heidelberg (2009).

[5]

Bender, A., Katz, J., Morselli, R.: Ring signatures: Stronger definitions, and constructions without random oracles. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 60-79. Springer, Heidelberg (2006).

[6]

Bernstein, J., Lange, T., Peters, C.: Attacking and defending the McEliece cryptosystem. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol. 5299, pp. 31-46. Springer, Heidelberg (2008).

[7]

Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.: On the inherent intractability of certain coding problems. IEEE Trans. Inform. Th. 24 (1978).

[8]

Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: ACM Conference on Computer and Communications Security, pp. 62-73 (1993).

[9]

Bresson, E., Stern, J., Szydlo, M.: Threshold ring signatures and applications to ad-hoc groups. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 465-480. Springer, Heidelberg (2002).

[10]

Courtois, N., Finiasz, M., Sendrier, N.: How to achieve a McEliece-based digital signature scheme. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 157-174. Springer, Heidelberg (2001).

[11]

Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. Journal of the ACM 51(4), 557-594 (2004).

[12]

Chandran, N., Groth, J., Sahai, A.: Ring signatures of sub-linear size without random oracles. In: Arge, L., Cachin, C., Jurdzinski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 423-434. Springer, Heidelberg (2007).

[13]

Cayrel, P.L., Otmani, A., Vergnaud, D.: On Kabatianskii-Krouk-Smeets signatures. In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol. 4547, pp. 237-251. Springer, Heidelberg (2007).

[14]

Coron, J.-S., Patarin, J., Seurin, Y.: The random oracle model and the ideal cipher model are equivalent. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 1-20. Springer, Heidelberg (2008).

[15]

Chaum, D., van Heyst, E.: Group signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 257-265. Springer, Heidelberg (1991).

[16]

Dallot, L.: Towards a concrete security proof of Courtois, Finiasz and Sendrier signature scheme. In: Lucks, S., Sadeghi, A.-R., Wolf, C. (eds.) WEWoRC 2007. LNCS, vol. 4945, pp. 65-77. Springer, Heidelberg (2008).

[17]

Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. Inform. Th. 22(6), 644-654 (1976).

[18]

Dodis, Y., Kiayias, A., Nicolosi, A., Shoup, V.: Anonymous identification in ad-hoc groups. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 609-626. Springer, Heidelberg (2004).

[19]

Finiasz, M., Sendrier, N.: Security bounds for the design of code-based cryptosystems. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 88-105. Springer, Heidelberg (2009), http://eprint.iacr.org/2009/414

[20]

Jakobson, M., Sako, K., Implagliazzo, R.: Desingated verifier proofs and their applications. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 143-154. Springer, Heidelberg (1996).

[21]

Kobara, K., Imai, I.: Semantically secure McEliece public-key cryptosystems -- conversions for McEliece PKC. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol. 1992, pp. 19-35. Springer, Heidelberg (2001).

[22]

Lyubashevsky, V., Micciancio, D.: On bounded distance decoding, unique shortest vectors, and the minimum distance problem. In: Tai, X.-C., et al. (eds.) CRYPTO 2009. LNCS, vol. 5677, pp. 577-594. Springer, Heidelberg (2009).

[23]

Leurent, G., Nguyen, P.Q.: How risky is the random-oracle model? In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 445-464. Springer, Heidelberg (2009).

[24]

Loidreau, P., Sendrier, N.: Weak keys in McEliece public-key cryptosystem. IEEE Trans. Inform. Th. 47(3), 1207-1212 (2001).

[25]

Misoczki, R., Barreto, P.S.L.M.: Compact McEliece keys from goppa codes. Cryptology ePrint Archive, Report 2009/187 (2009), http://eprint.iacr.org/

[26]

McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. Technical report, DSN Progress report # 42-44, Jet Propulsion Laboratory, Pasadena, Californila (1978).

[27]

Naor, M.: Deniable ring authentification. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 481-498. Springer, Heidelberg (2002).

[28]

Otmani, A., Tillich, J.P., Dallot, L.: Cryptanalysis of a McEliece cryptosystem based on quasi-cyclic LDPC codes. In: Faugre, J.C., Wang, D. (eds.) Proceedings of the first international conference on symbolic computation and cryptography. LMIB, pp. 69-81 (2008).

[29]

Rivest, R.L., Shamir, A., Tauman, Y.: How to leak a secret. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 552-565. Springer, Heidelberg (2001).

[30]

Sendrier, N.: Finding the permutation between equivalent codes: the support splitting algorithm. IEEE Trans. Inform. Th. 46, 1193-1203 (2000).

[31]

Sendrier, N.: Cryptosystèmes à clé publique basés sur les codes correcteurs d'erreurs. Habilitation à diriger les recherches, Université Pierre et Marie Curie, Paris 6, Paris, France, Mars (2002) (in French).

[32]

Shamir, A.: How to share a secret. Commun. of the ACM 22(11), 612-613 (1979).

[33]

Stern, J.: An alternative to the Fiat-Shamir protocol. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 173-180. Springer, Heidelberg (1990).

[34]

Stern, J.: A new paradigm for public key identification. IEEE Trans. Inform. Th. 42(6), 1757-1768 (1996).

[35]

Shacham, H., Waters, B.: Efficient ring signatures without random oracles. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 166-180. Springer, Heidelberg (2007).

[36]

Zheng, D., Li, X., Chen, K.: Code-based ring signature scheme. International Journal of Network Security 5(2), 154-157 (2007).

Cited By

Nguyen KSafavi-Naini RSusilo WWang HXu YZeng N(2024)Group encryptionTheoretical Computer Science10.1016/j.tcs.2024.1146781007:COnline publication date: 29-Jul-2024
https://dl.acm.org/doi/10.1016/j.tcs.2024.114678
Wu CJiang SZhang FDu YLin Q(2024)An Efficient Threshold Ring Signature from G+G Identification ProtocolData Security and Privacy Protection10.1007/978-981-97-8540-7_13(211-221)Online publication date: 25-Oct-2024
https://dl.acm.org/doi/10.1007/978-981-97-8540-7_13
Ling SNguyen KPhan DTang KWang HXu Y(2024)Fully Dynamic Attribute-Based Signatures for Circuits from CodesPublic-Key Cryptography – PKC 202410.1007/978-3-031-57718-5_2(37-73)Online publication date: 15-Apr-2024
https://dl.acm.org/doi/10.1007/978-3-031-57718-5_2
Show More Cited By

Provably Secure Code-Based Threshold Ring Signatures

Recommendations

A Provably Secure Threshold Ring Signature Scheme in Certificateless Cryptography
ISME '10: Proceedings of the 2010 International Conference of Information Science and Management Engineering - Volume 01

Ring signature is a kind of group-oriented signature. It allows a member of a group to sign messages on behalf of the group without revealing his/her identity. Certificateless public key cryptography was first introduced by Al-Riyami and Paterson at ...
Provably Secure Identity-Based Undeniable Signatures with Selective and Universal Convertibility
Information Security and Cryptology

In this paper, we present <em>the first</em>concrete example of identity-based undeniable signature <em>with</em>selective and universal convertibility, where the signer can release a selective proof to make a single undeniable signature publicly ...
Provably-secure electronic cash based on certificateless partially-blind signatures

We extend the partially-blind signature approach into certificateless public key cryptography to eliminate the key escrow problem that occurs with identities in public key cryptography. We also formalize conditions for security for certificateless ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

Cryptography and Coding '09: Proceedings of the 12th IMA International Conference on Cryptography and Coding

December 2009

494 pages

ISBN:9783642108679

Editor:
Matthew G. Parker
The Selmer Centre Department of Informatics, University of Bergen, Bergen, Norway N-5020

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 03 December 2009

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

16
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 25 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Nguyen KSafavi-Naini RSusilo WWang HXu YZeng N(2024)Group encryptionTheoretical Computer Science10.1016/j.tcs.2024.1146781007:COnline publication date: 29-Jul-2024
https://dl.acm.org/doi/10.1016/j.tcs.2024.114678
Wu CJiang SZhang FDu YLin Q(2024)An Efficient Threshold Ring Signature from G+G Identification ProtocolData Security and Privacy Protection10.1007/978-981-97-8540-7_13(211-221)Online publication date: 25-Oct-2024
https://dl.acm.org/doi/10.1007/978-981-97-8540-7_13
Ling SNguyen KPhan DTang KWang HXu Y(2024)Fully Dynamic Attribute-Based Signatures for Circuits from CodesPublic-Key Cryptography – PKC 202410.1007/978-3-031-57718-5_2(37-73)Online publication date: 15-Apr-2024
https://dl.acm.org/doi/10.1007/978-3-031-57718-5_2
Buser MDowsley REsgin MGritti CKasra Kermanshahi SKuchta VLegrow JLiu JPhan RSakzad ASteinfeld RYu J(2023)A Survey on Exotic Signatures for Post-quantum Blockchain: Challenges and Research DirectionsACM Computing Surveys10.1145/357277155:12(1-32)Online publication date: 2-Mar-2023
https://dl.acm.org/doi/10.1145/3572771
Qi YWang L(2022)A New Code-Based Traceable Ring Signature SchemeSecurity and Communication Networks10.1155/2022/39383212022Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1155/2022/3938321
Ling SNguyen KPhan DTang HWang H(2021)Zero-Knowledge Proofs for Committed Symmetric Boolean FunctionsPost-Quantum Cryptography10.1007/978-3-030-81293-5_18(339-359)Online publication date: 20-Jul-2021
https://dl.acm.org/doi/10.1007/978-3-030-81293-5_18
Nguyen KSafavi-Naini RSusilo WWang HXu YZeng N(2021)Group Encryption: Full Dynamicity, Message Filtering and Code-Based InstantiationPublic-Key Cryptography – PKC 202110.1007/978-3-030-75248-4_24(678-708)Online publication date: 10-May-2021
https://dl.acm.org/doi/10.1007/978-3-030-75248-4_24
Abe MAmbrona MBogdanov AOhkubo MRosen A(2020)Non-interactive Composition of Sigma-Protocols via Share-then-HashAdvances in Cryptology – ASIACRYPT 202010.1007/978-3-030-64840-4_25(749-773)Online publication date: 7-Dec-2020
https://dl.acm.org/doi/10.1007/978-3-030-64840-4_25
Nguyen KTang HWang HZeng N(2019)New Code-Based Privacy-Preserving Cryptographic ConstructionsAdvances in Cryptology – ASIACRYPT 201910.1007/978-3-030-34621-8_2(25-55)Online publication date: 8-Dec-2019
https://dl.acm.org/doi/10.1007/978-3-030-34621-8_2
Zhou GZeng PYuan XChen SChoo K(2017)An Efficient Code-Based Threshold Ring Signature Scheme with a Leader-Participant ModelSecurity and Communication Networks10.1155/2017/19152392017Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1155/2017/1915239
Show More Cited By

View Options

View options

Figures

Tables

Media

View Table of Conten