Article

Separable linkable threshold ring signatures

Authors:

Patrick P. Tsang,

Duncan S. WongAuthors Info & Claims

INDOCRYPT'04: Proceedings of the 5th international conference on Cryptology in India

Pages 384 - 398

https://doi.org/10.1007/978-3-540-30556-9_30

Published: 20 December 2004 Publication History

Abstract

A ring signature scheme is a group signature scheme with no group manager to setup a group or revoke a signer. A linkable ring signature, introduced by Liu, et al. [20], additionally allows anyone to determine if two ring signatures are signed by the same group member (a.k.a. they are linked). In this paper, we present the first separable linkable ring signature scheme, which also supports an efficient thresholding option. We also present the security model and reduce the security of our scheme to well-known hardness assumptions. In particular, we introduce the security notions of accusatory linkability and non-slanderability to linkable ring signatures. Our scheme supports “event-oriented” linking. Applications to such linking criterion is discussed.

References

[1]

M. Abe, M. Ohkubo, and K. Suzuki. 1-out-of-n signatures from a variety of keys. In ASIACRYPT 2002, pages 415-432. Springer-Verlag, 2002.

[2]

G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik. A practical and provably secure coalition-resistant group signature scheme. In CRYPTO 2000, pages 255- 270. Springer-Verlag, 2000.

Digital Library

[3]

M. Bellare, D. Micciancio, and B. Warinschi. Foundations of group signatures: formal definitions, simplified requirements and a construction based on general assumptions. In EUROCRYPT'03, volume 2656 of LNCS. Springer-Verlag, 2003.

Digital Library

[4]

M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In Proceedings of the 1st ACM conference on Computer and communications security, pages 62-73. ACM Press, 1993.

Digital Library

[5]

M. Bellare, H. Shi, and C. Zhang. Foundations of group signatures: the case of dynamic groups. Cryptology ePrint Archive, Report 2004/077, 2004. http://eprint.iacr.org/.

[6]

E. Bresson, J. Stern, and M. Szydlo. Threshold ring signatures and applications to ad-hoc groups. In Crypto'02, volume 2442 of LNCS, pages 465-480. Springer-Verlag, 2002.

Digital Library

[7]

J. Camenisch and M. Michels. A group signature scheme based on an RSA-variant. rs RS-98-27, brics, 1998.

[8]

J. Camenisch and M. Michels. Separability and efficiency for generic group signature schemes. In Crypto'99, pages 413-430. Springer-Verlag, 1999.

Digital Library

[9]

J. Camenisch and M. Stadler. Efficient group signature schemes for large groups (extended abstract). In CRYPTO'97, pages 410-424. Springer-Verlag, 1997.

Digital Library

[10]

D. Chaum and E. van Heyst. Group signatures. In EUROCRYPT'91, volume 547 of LNCS, pages 257-265. Springer-Verlag, 1991.

Digital Library

[11]

R. Cramer, I. Damgard, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In CRYPTO'94, pages 174-187. Springer-Verlag, 1994.

Digital Library

[12]

Y. Desmedt and Y. Frankel. Threshold cryptosystems. In CRYPTO '89, volume 435 of LNCS, pages 307-315. Springer-Verlag, 1990.

Digital Library

[13]

Y. Dodis, A. Kiayias, A. Nicolosi, and V. Shoup. Anonymous identification in ad hoc groups. In EUROCRYPT 2004, volume 3027 of LNCS, pages 609-626. Springer-Verlag, 2004.

[14]

A. Fiat and A. Shamir. How to prove yourself: Practical solution to identification and signature problems. In CRYPTO'86, volume 263 of LNCS, pages 186-194. Springer-Verlag, 1987.

Digital Library

[15]

E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In CRYPTO'97, pages 16-30. Springer-Verlag, 1997.

Digital Library

[16]

E. Fujisaki and T. Okamoto. A practical and provably secure scheme for publicly verifiable secret sharing and its applications. In Eurocrypt '98, volume 1403 of LNCS, pages 32-46. Springer-Verlag, 1998.

[17]

S. Goldwasser, S. Micali, and R. L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput., 17(2):281-308, 1988.

Digital Library

[18]

A. Kiayias and M. Yung. Group signatures: provable security, efficient constructions, and anonymity from trapdoor-holders. Cryptology ePrint Archive, Report 2004/076, 2004. http://eprint.iacr.org/.

[19]

J. K. Liu, V. K.Wei, and D. S.Wong. A separable threshold ring signature scheme. In ICISC 2003, volume 2971 of LNCS, pages 12-26. Springer-Verlag, 2003.

[20]

J. K. Liu, V. K. Wei, and D. S. Wong. Linkable spontaneous anonymous group signature for ad hoc groups (extended abstract). In ACISP'04, volume 3108 of LNCS, pages 325-335. Springer-Verlag, 2004.

[21]

D. Pointcheval and J. Stern. Security proofs for signature schemes. In EUROCRYPT' 96, volume 1070 of LNCS, pages 387-398. Springer-Verlag, 1996.

Digital Library

[22]

R. L. Rivest, A. Shamir, and Y. Tauman. How to leak a secret. In ASIACRYPT 2001, pages 552-565. Springer-Verlag, 2001.

Digital Library

[23]

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

Digital Library

[24]

D. S. Wong, K. Fung, J. K. Liu, and V. K. Wei. On the RS-code construction of ring signature schemes and a threshold setting of RST. In ICISC 2003, volume 2971 of LNCS, pages 34-46. Springer-Verlag, 2003.

Cited By

Kabaleeshwaran RKishan B(2024)Efficient Revocable Linkable Ring SignaturesProgress in Cryptology – INDOCRYPT 202410.1007/978-3-031-80308-6_14(305-325)Online publication date: 18-Dec-2024
https://dl.acm.org/doi/10.1007/978-3-031-80308-6_14
Xue YLu XAu MZhang C(2024)Efficient Linkable Ring Signatures: New Framework and Post-quantum InstantiationsComputer Security – ESORICS 202410.1007/978-3-031-70903-6_22(435-456)Online publication date: 16-Sep-2024
https://dl.acm.org/doi/10.1007/978-3-031-70903-6_22
Pham MDuong DLi YSusilo W(2023)Threshold Ring Signature Scheme from Cryptographic Group ActionProvable and Practical Security10.1007/978-3-031-45513-1_12(207-227)Online publication date: 20-Oct-2023
https://dl.acm.org/doi/10.1007/978-3-031-45513-1_12
Show More Cited By

Recommendations

Designated-Verifier Linkable Ring Signatures
Information Security and Cryptology – ICISC 2021
Abstract
We introduce Designated-Verifier Linkable Ring Signatures (DVLRS), a novel cryptographic primitive which combines designated-verifier and linkable ring signatures. Our goal is to guarantee signer ambiguity and provide the capability to the ...
Fiat-Shamir with Aborts: From Identification Schemes to Linkable Ring Signatures
Security, Privacy, and Applied Cryptography Engineering
Abstract
Fiat-Shamir with aborts is a technique to transform a lattice-based identification scheme to a signature scheme introduced by Lyubashevsky (in Asiacrypt 2009). The scheme is also provably secure based on some standard lattice problems. In this ...
Short linkable ring signatures revisited
EuroPKI 2006: Proceedings of the Third European conference on Public Key Infrastructure: theory and Practice

Ring signature is a group-oriented signature in which the signer can spontaneously form a group and generate a signature such that the verifier is convinced the signature was generated by one member of the group and yet does not know who actually ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

INDOCRYPT'04: Proceedings of the 5th international conference on Cryptology in India

December 2004

429 pages

ISBN:3540241302

Editors:
Anne Canteaut
INRIA Rocquencourt, France
,
Kapaleeswaran Viswanathan
SETS, 21 Mangadu Swamy Street, Nungambakkam, Chennai, India

Sponsors

Dept. of Information Techn., Government of India: Department of Information Technology, Government of India
Dept. of Science and Techn., Government of India: Department of Science and Technology, Government of India
Electronics Corporation of India Limited: Electronics Corporation of India Limited
Bharat Electronics Limited: Bharat Electronics Limited
BRNS Secretariat, Bhabha Atomic Research Centre: BRNS Secretariat, Bhabha Atomic Research Centre

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 20 December 2004

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

35
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 05 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Kabaleeshwaran RKishan B(2024)Efficient Revocable Linkable Ring SignaturesProgress in Cryptology – INDOCRYPT 202410.1007/978-3-031-80308-6_14(305-325)Online publication date: 18-Dec-2024
https://dl.acm.org/doi/10.1007/978-3-031-80308-6_14
Xue YLu XAu MZhang C(2024)Efficient Linkable Ring Signatures: New Framework and Post-quantum InstantiationsComputer Security – ESORICS 202410.1007/978-3-031-70903-6_22(435-456)Online publication date: 16-Sep-2024
https://dl.acm.org/doi/10.1007/978-3-031-70903-6_22
Pham MDuong DLi YSusilo W(2023)Threshold Ring Signature Scheme from Cryptographic Group ActionProvable and Practical Security10.1007/978-3-031-45513-1_12(207-227)Online publication date: 20-Oct-2023
https://dl.acm.org/doi/10.1007/978-3-031-45513-1_12
Boneh DKomlo C(2022)Threshold Signatures with Private AccountabilityAdvances in Cryptology – CRYPTO 202210.1007/978-3-031-15985-5_19(551-581)Online publication date: 15-Aug-2022
https://dl.acm.org/doi/10.1007/978-3-031-15985-5_19
Aranha DHall-Andersen MNitulescu APagnin EYakoubov S(2022)Count Me In! Extendability for Threshold Ring SignaturesPublic-Key Cryptography – PKC 202210.1007/978-3-030-97131-1_13(379-406)Online publication date: 8-Mar-2022
https://dl.acm.org/doi/10.1007/978-3-030-97131-1_13
Cachin CCollins DCrain TGramoli V(2020)Anonymity Preserving Byzantine Vector ConsensusComputer Security – ESORICS 202010.1007/978-3-030-58951-6_7(133-152)Online publication date: 14-Sep-2020
https://dl.acm.org/doi/10.1007/978-3-030-58951-6_7
Haque AScafuro A(2020)Threshold Ring Signatures: New Definitions and Post-quantum SecurityPublic-Key Cryptography – PKC 202010.1007/978-3-030-45388-6_15(423-452)Online publication date: 4-May-2020
https://dl.acm.org/doi/10.1007/978-3-030-45388-6_15
Li PLai J(2019)LaT-Voting: Traceable Anonymous E-Voting on BlockchainNetwork and System Security10.1007/978-3-030-36938-5_14(234-254)Online publication date: 15-Dec-2019
https://dl.acm.org/doi/10.1007/978-3-030-36938-5_14
Thorncharoensri PSusilo WMu Y(2017)Policy-controlled signatures and their applicationsComputer Standards & Interfaces10.1016/j.csi.2016.08.00550:C(26-41)Online publication date: 1-Feb-2017
https://dl.acm.org/doi/10.1016/j.csi.2016.08.005
Tsz Hon Yuen Liu JMan Ho Au Xinyi Huang Susilo WJianying Zhou (2015)$k$ -Times Attribute-Based Anonymous Access Control for Cloud ComputingIEEE Transactions on Computers10.1109/TC.2014.236674164:9(2595-2608)Online publication date: 1-Sep-2015
https://dl.acm.org/doi/10.1109/TC.2014.2366741
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Table of Contents