Forward-Secure Linkable Ring Signatures from Bilinear Maps
AbstractWe 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 are never obtained, our minimal two-epoch construction instantiated from bilinear maps can be combinatorially boosted to synthesise a polynomial time granularity, which would be sufficient for Internet voting and more. View Full-Text
Share & Cite This Article
Boyen, X.; Haines, T. Forward-Secure Linkable Ring Signatures from Bilinear Maps. Cryptography 2018, 2, 35.
Boyen X, Haines T. Forward-Secure Linkable Ring Signatures from Bilinear Maps. Cryptography. 2018; 2(4):35.Chicago/Turabian Style
Boyen, Xavier; Haines, Thomas. 2018. "Forward-Secure Linkable Ring Signatures from Bilinear Maps." Cryptography 2, no. 4: 35.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.