Forward-Secure Linkable Ring Signatures from Bilinear Maps

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...

Full description

Bibliographic Details
Main Authors: Xavier Boyen, Thomas Haines
Format: Article
Language:English
Published: MDPI AG 2018-11-01
Series:Cryptography
Subjects:
Online Access:https://www.mdpi.com/2410-387X/2/4/35
id doaj-d0b78dd6bcdf445a9f8a8bd54211ded0
record_format Article
spelling doaj-d0b78dd6bcdf445a9f8a8bd54211ded02020-11-24T22:52:09ZengMDPI AGCryptography2410-387X2018-11-01243510.3390/cryptography2040035cryptography2040035Forward-Secure Linkable Ring Signatures from Bilinear MapsXavier Boyen0Thomas Haines1Queensland University of Technology, Brisbane 4000, AustraliaPolyas GmbH, 10179 Berlin, GermanyWe 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.https://www.mdpi.com/2410-387X/2/4/35linkable ring signaturebilinear mapmultilinear mapelectronic votingforward securityunconditional anonymity
collection DOAJ
language English
format Article
sources DOAJ
author Xavier Boyen
Thomas Haines
spellingShingle Xavier Boyen
Thomas Haines
Forward-Secure Linkable Ring Signatures from Bilinear Maps
Cryptography
linkable ring signature
bilinear map
multilinear map
electronic voting
forward security
unconditional anonymity
author_facet Xavier Boyen
Thomas Haines
author_sort Xavier Boyen
title Forward-Secure Linkable Ring Signatures from Bilinear Maps
title_short Forward-Secure Linkable Ring Signatures from Bilinear Maps
title_full Forward-Secure Linkable Ring Signatures from Bilinear Maps
title_fullStr Forward-Secure Linkable Ring Signatures from Bilinear Maps
title_full_unstemmed Forward-Secure Linkable Ring Signatures from Bilinear Maps
title_sort forward-secure linkable ring signatures from bilinear maps
publisher MDPI AG
series Cryptography
issn 2410-387X
publishDate 2018-11-01
description 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 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.
topic linkable ring signature
bilinear map
multilinear map
electronic voting
forward security
unconditional anonymity
url https://www.mdpi.com/2410-387X/2/4/35
work_keys_str_mv AT xavierboyen forwardsecurelinkableringsignaturesfrombilinearmaps
AT thomashaines forwardsecurelinkableringsignaturesfrombilinearmaps
_version_ 1725666921835134976