Article

Forward-Secure Linkable Ring Signatures

Authors:

Thomas HainesAuthors Info & Claims

Information Security and Privacy: 23rd Australasian Conference, ACISP 2018, Wollongong, NSW, Australia, July 11-13, 2018, Proceedings

Pages 245 - 264

https://doi.org/10.1007/978-3-319-93638-3_15

Published: 11 July 2018 Publication History

Abstract

We present the first linkable ring signature scheme with both unconditional anonymity and forward-secure key update: a powerful tool which has direct applications in elegantly addressing a number of simultaneous constraints in remote electronic voting. We propose a comprehensive security model, and construct a scheme based on the hardness of finding discrete logarithms, and (for forward security) inverting bilinear or multilinear maps of moderate degree to match the time granularity of forward security. We prove efficient security reductions—which, of independent interest, apply to, and are much tighter than, linkable ring signatures without forward security, thereby vastly improving the provable security of these legacy schemes. If efficient multilinear maps should ever admit a secure realisation, our contribution would elegantly address a number of problems heretofore unsolved in the important application of (multi-election) practical internet voting. Even if multilinear maps never obtain, our minimal two-epoch construction instantiated from bilinear maps can be combinatorially boosted to synthesize a polynomial time granularity, which would be sufficient for internet voting and more.

References

[1]

Adida, B.: Helios: web-based open-audit voting. In: USENIX Security (2008)

[2]

Adida, B.: Helios v3 verification specs. Technical report, Helios Voting (2010)

[3]

Albrecht M, Bai S, and Ducas L Robshaw M and Katz J A subfield lattice attack on overstretched NTRU assumptions Advances in Cryptology – CRYPTO 2016 2016 Heidelberg Springer 153-178

Digital Library

[4]

Barak B, Goldreich O, Impagliazzo R, Rudich S, Sahai A, Vadhan SP, and Yang K On the (im)possibility of obfuscating programs J. ACM 2012 59 2 6

Digital Library

[5]

Boneh D and Silverberg A Applications of multilinear forms to cryptography Contemp. Math. 2003 324 1 71-90

[6]

Boneh D, Wu DJ, and Zimmerman J Immunizing multilinear maps against zeroizing attacks IACR Cryptol. ePrint Archive 2014 2014 930

[7]

Chaum D and van Heyst E Davies DW Group signatures Advances in Cryptology — EUROCRYPT ’91 1991 Heidelberg Springer 257-265

[8]

Cheon JH, Han K, Lee C, Ryu H, and Stehlé D Oswald E and Fischlin M Cryptanalysis of the multilinear map over the integers Advances in Cryptology – EUROCRYPT 2015 2015 Heidelberg Springer 3-12

[9]

Cheon JH, Jeong J, and Lee C An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low level encoding of zero IACR Cryptol. ePrint Archive 2016 19 255-266

[10]

Coron J-S, Lepoint T, and Tibouchi M Canetti R and Garay JA Practical multilinear maps over the integers Advances in Cryptology – CRYPTO 2013 2013 Heidelberg Springer 476-493

[11]

Cramer R, Ducas L, Peikert C, and Regev O Fischlin M and Coron J-S Recovering short generators of principal ideals in cyclotomic rings Advances in Cryptology – EUROCRYPT 2016 2016 Heidelberg Springer 559-585

[12]

Demirel, D., Van De Graaf, J., Araújo, R.: Improving helios with everlasting privacy towards the public. In: Proceedings of eVOTE/Trustworthy Elections. USENIX (2012)

[13]

Fujisaki E and Suzuki K Okamoto T and Wang X Traceable ring signature Public Key Cryptography – PKC 2007 2007 Heidelberg Springer 181-200

[14]

Garg S, Gentry C, and Halevi S Johansson T and Nguyen PQ Candidate multilinear maps from ideal lattices Advances in Cryptology – EUROCRYPT 2013 2013 Heidelberg Springer 1-17

[15]

Gentry C, Gorbunov S, and Halevi S Dodis Y and Nielsen JB Graph-induced multilinear maps from lattices Theory of Cryptography 2015 Heidelberg Springer 498-527

[16]

Hu Y and Jia H Fischlin M and Coron J-S Cryptanalysis of GGH map Advances in Cryptology – EUROCRYPT 2016 2016 Heidelberg Springer 537-565

[17]

Langlois A, Stehlé D, and Steinfeld R Nguyen PQ and Oswald E GGHLite: more efficient multilinear maps from ideal lattices Advances in Cryptology – EUROCRYPT 2014 2014 Heidelberg Springer 239-256

[18]

Liu JK, Au MH, Susilo W, and Zhou J Linkable ring signature with unconditional anonymity IEEE Trans. Knowl. Data Eng. 2014 26 1 157-165

Digital Library

[19]

Liu JK, Wei VK, and Wong DS Wang H, Pieprzyk J, and Varadharajan V Linkable spontaneous anonymous group signature for Ad Hoc groups Information Security and Privacy 2004 Heidelberg Springer 325-335

[20]

Miles E, Sahai A, and Zhandry M Robshaw M and Katz J Annihilation attacks for multilinear maps: cryptanalysis of indistinguishability obfuscation over GGH13 Advances in Cryptology – CRYPTO 2016 2016 Heidelberg Springer 629-658

Digital Library

[21]

Paneth O and Sahai A On the equivalence of obfuscation and multilinear maps IACR Cryptol. ePrint Archive 2015 2015 791

[22]

Pedersen TP Feigenbaum J Non-interactive and information-theoretic secure verifiable secret sharing Advances in Cryptology — CRYPTO ’91 1992 Heidelberg Springer 129-140

[23]

Pointcheval D and Stern J Maurer U Security proofs for signature schemes Advances in Cryptology — EUROCRYPT ’96 1996 Heidelberg Springer 387-398

[24]

Rivest RL, Shamir A, and Tauman Y Boyd C How to leak a secret Advances in Cryptology — ASIACRYPT 2001 2001 Heidelberg Springer 552-565

[25]

Tsoukalas G, Papadimitriou K, Louridas P, and Tsanakas P From helios to zeus USENIX J. Elect. Technol. Syst. (JETS) 2013 1 1-17

[26]

Zhandry M Adaptively secure broadcast encryption with small system parameters IACR Cryptol. ePrint Archive 2014 2014 757

Cited By

Li PLai JZhou DHuang LSun MWu WYang Y(2025)Linkable and traceable anonymous authentication with fine-grained access controlFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-023-3225-319:2Online publication date: 1-Feb-2025
https://dl.acm.org/doi/10.1007/s11704-023-3225-3
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
Wang SZhang YXiong L(2023)A Blockchain-Based Conditional Anonymous Authentication SchemeProceedings of the 2023 5th International Conference on Blockchain Technology10.1145/3638025.3638030(15-20)Online publication date: 10-Nov-2023
https://dl.acm.org/doi/10.1145/3638025.3638030
Show More Cited By

Recommendations

Designated-Verifier Linkable Ring Signatures with Unconditional Anonymity
Algebraic Informatics
Abstract
In this work we propose Designated-Verifier Linkable Ring Signatures with unconditional anonymity, a cryptographic primitive that protects the privacy of signers in two different ways. First, it allows signers to hide inside a ring (an anonymity ...
A Linkable and Convertible ID-based Ring Signature
ICCIS '11: Proceedings of the 2011 International Conference on Computational and Information Sciences

Digital signatures have been widely used in our life, and many variants of digital signatures have been studied these years. Ring signature is one of the variants that pro-vides anonymity for signers. Ring signature has a non-central structure, and it ...
Secure obfuscation for encrypted signatures
EUROCRYPT'10: Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques

Obfuscation is one of the most intriguing open problems in cryptography and only a few positive results are known. In TCC’07, Hohenberger et al. proposed an obfuscator for a re-encryption functionality, which takes a ciphertext for a message encrypted ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

Information Security and Privacy: 23rd Australasian Conference, ACISP 2018, Wollongong, NSW, Australia, July 11-13, 2018, Proceedings

Jul 2018

836 pages

ISBN:978-3-319-93637-6

DOI:10.1007/978-3-319-93638-3

Editors:
Willy Susilo
University of Wollongong, Wollongong, NSW, Australia
,
Guomin Yang
University of Wollongong, Wollongong, NSW, Australia

© Springer International Publishing AG, part of Springer Nature 2018.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 11 July 2018

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 12 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Li PLai JZhou DHuang LSun MWu WYang Y(2025)Linkable and traceable anonymous authentication with fine-grained access controlFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-023-3225-319:2Online publication date: 1-Feb-2025
https://dl.acm.org/doi/10.1007/s11704-023-3225-3
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
Wang SZhang YXiong L(2023)A Blockchain-Based Conditional Anonymous Authentication SchemeProceedings of the 2023 5th International Conference on Blockchain Technology10.1145/3638025.3638030(15-20)Online publication date: 10-Nov-2023
https://dl.acm.org/doi/10.1145/3638025.3638030
Li NLi YMiyaji ATian YYuen T(2023)A Practical Forward-Secure DualRingCryptology and Network Security10.1007/978-981-99-7563-1_23(516-537)Online publication date: 30-Oct-2023
https://dl.acm.org/doi/10.1007/978-981-99-7563-1_23
Yu XWang Y(2023)Forward Secure Lattice-Based Ring Signature Scheme in the Standard ModelInformation and Communications Security10.1007/978-981-99-7356-9_9(146-158)Online publication date: 18-Nov-2023
https://dl.acm.org/doi/10.1007/978-981-99-7356-9_9
Backes MDöttling NHanzlik LKluczniak KSchneider J(2019)Ring Signatures: Logarithmic-Size, No Setup—from Standard AssumptionsAdvances in Cryptology – EUROCRYPT 201910.1007/978-3-030-17659-4_10(281-311)Online publication date: 19-May-2019
https://dl.acm.org/doi/10.1007/978-3-030-17659-4_10

View Options

View options

Figures

Tables

Media

View Table of Conten