Attribute-Based Signatures with User-Controlled Linkability Without Random Oracles

Kaafarani, Ali El; Ghadafi, Essam

doi:10.1007/978-3-319-71045-7_9

Cited by 11 publications

(5 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Tang et al [15] proposed an ABS scheme for circuits from multilinear, and Sakai et al [16] proposed an ABS scheme for circuits from bilinear maps. Based on lattices, Kaafarani et al [17] proposed an ABS scheme for unbounded circuits. Datta et al [18] proposed an ABS scheme for unbounded arithmetic branching programs.…”

Section: Introductionmentioning

confidence: 99%

SPCABS: Signature-Policy Comparable Attribute-Based Signatures

Chen¹,

Huang

et al. 2022

Security and Communication Networks

View full text Add to dashboard Cite

Attribute-based signature is an attractive cryptographic primitive and finds broad applications in many fields. Existing attribute-based signature schemes deal with attributes in the way of “with” or “without,” and there is no attribute-based signature scheme that supports comparing attributes. Using the 0-encoding and 1-encoding, we propose an access structure algorithm and an attribute expansion algorithm, enabling the attribute-based signature scheme to effectively deal with the comparative attributes. Then, we propose a signature-policy comparable attribute-based signature scheme using the proposed expansion algorithms. The proposed scheme is existentially unforgeable under the computational Diffie–Hellman exponent (CDHE) assumption and achieves privacy in the sense of information theory. Theoretical analysis and simulation experiments show that our method is practical and has significant advantages in storage and computation overhead compared with the trivial way. Comparable attribute-based signature dramatically expands the application scenarios of attribute-based signature.

show abstract

Section: Introductionmentioning

confidence: 99%

SPCABS: Signature-Policy Comparable Attribute-Based Signatures

Chen¹,

Huang

et al. 2022

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

“…Like [2], attribute-based primitives [8,9,10] have been extended to achieve controlled linkability relying on pseudonyms. While of interest, they do not support the modification of the attributes' values, the user is only allowed to present attributes as they were initially certified by the issuing entity.…”

Section: Introductionmentioning

confidence: 99%

PIMA: A Privacy-preserving Identity management system based on an unlinkable MAlleable signature

Masmoudi

Laurent²,

Kaaniche³

2022

Journal of Network and Computer Applications

View full text Add to dashboard Cite

“…SPS schemes on Diffie-Hellman pairs have rendered themselves as a tool to get around the known lower bounds for SPS schemes thus improving efficiency without being too restrictive as they suffice for many applications of SPS schemes. Examples of where SPS schemes on Diffie-Hellman pairs provide better efficency than optimal SPS schemes on unilateral messages include [32,23]. Also, as argued by [32], optimal SPS schemes on Diffie-Hellman pairs outperform some widely used non-structure-preserving schemes in terms of efficiency.…”

Section: Introductionmentioning

confidence: 99%

Further Lower Bounds for Structure-Preserving Signatures in Asymmetric Bilinear Groups

Ghadafi

2019

Progress in Cryptology – AFRICACRYPT 2019

Self Cite

View full text Add to dashboard Cite

Structure-Preserving Signatures (SPSs) are a useful tool for the design of modular cryptographic protocols. Recent series of works have shown that by limiting the message space of those schemes to the set of Diffie-Hellman (DH) pairs, it is possible to circumvent the known lower bounds in the Type-3 bilinear group setting thus obtaining the shortest signatures consisting of only 2 elements from the shorter source group. It has been shown that such a variant yields efficiency gains for some cryptographic constructions, including attribute-based signatures and direct anonymous attestation. Only the cases of signing a single DH pair or a DH pair and a vector from Zp have been considered. Signing a vector of group elements is required for various applications of SPSs, especially if the aim is to forgo relying on heuristic assumptions. An open question is whether such an improved lower bound also applies to signing a vector of > 1 messages. We answer this question negatively for schemes existentially unforgeable under an adaptive chosenmessage attack (EUF-CMA) whereas we answer it positively for schemes existentially unforgeable under a random-message attack (EUF-RMA) and those which are existentially unforgeable under a combined chosenrandom-message attack (EUF-CMA-RMA). The latter notion is a leeway between the two former notions where it allows the adversary to adaptively choose part of the message to be signed whereas the remaining part of the message is chosen uniformly at random by the signer. Another open question is whether strongly existentially unforgeable under an adaptive chosen-message attack (sEUF-CMA) schemes with 2element signatures exist. We answer this question negatively, proving it is impossible to construct sEUF-CMA schemes with 2-element signatures even if the signature consists of elements from both source groups. On the other hand, we prove that sEUF-RMA and sEUF-CMA-RMA schemes with 2-element (unilateral) signatures are possible by giving constructions for those notions. Among other things, our findings show a gap between random-message/combined chosen-random-message security and chosen-message security in this setting.

show abstract

Attribute-Based Signatures with User-Controlled Linkability Without Random Oracles

Cited by 11 publications

References 35 publications

SPCABS: Signature-Policy Comparable Attribute-Based Signatures

SPCABS: Signature-Policy Comparable Attribute-Based Signatures

PIMA: A Privacy-preserving Identity management system based on an unlinkable MAlleable signature

Further Lower Bounds for Structure-Preserving Signatures in Asymmetric Bilinear Groups

Contact Info

Product

Resources

About