Attribute-Based Signatures for Circuits from Multilinear Maps

Tang, Fei; Li, Hongda; Liang, Bei

doi:10.1007/978-3-319-13257-0_4

Cited by 16 publications

(22 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For fairness, we summarize the properties of circuit-ABS schemes in Table 1. At conceptual level, our scheme is distinct from Tang et al (2014) since CR-TOR suffices to construct ABS for circuits. On the other hand, it uses multilinear maps as its internally computing mechanism, which resulting in the same security assumption as the Tang's construction.…”

Section: Comparison Of Schemesmentioning

confidence: 99%

“…The ideal for this oracle that algorithm B proceeds to make the signature is same as in Tang et al (2014). Briefly, B can sign any of A's signing requests, just because the queries (m, ind) will differ from the challenge ðm Ã ; ind Ã Þ in at least one bit.…”

Section: Proofmentioning

confidence: 99%

“…In this section, we first give the definition of KP-ABS for circuits and its security model Tang et al (2014). We then construct a novel KP-ABS for circuits from CR-TOR system in the leveled multilinear maps setting, and prove security in the standard model.…”

Section: A Key-policy Abs Scheme For Circuitsmentioning

confidence: 99%

“…Similar to the notion of attribute-based encryption (ABE) (Goyal et al 2006;Jin et al 2011Jin et al , 2014Sahai and Waters 2005), there are two variants of ABS: Key-Policy ABS and Signature-Policy ABS (Tang et al 2014). In a key-policy ABS system, a sign-key SK, which issued by an authority, is associated with a boolean function f from some function classes F. A signer, who holds the SK, can sign a message for an attribute set x if and only f ðxÞ ¼ 1.…”

Section: Introductionmentioning

confidence: 99%

“…Achieving key-policy ABS for general circuits is still an interesting issue in this area. Recently, Tang et al (2014) provided the first key-policy ABS for circuits, in which the new techniques called 'move forward and shift' in multilinear maps setting are employed. This technique was introduced to build a secure ABE scheme for circuits by Garg et al (2013b).…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Anonymous authentication for circuits from correlation-relaxed two-to-one recoding

Jing

Jiang

et al. 2015

J Ambient Intell Human Comput

View full text Add to dashboard Cite

Anonymous authentication is very useful to protect the users' identity privacy in distributed environment, such as in cloud computing. With the anonymous property, attribute-based signature (ABS) provides a cryptographic tool to construct a secure authentication scheme. In an attribute-based signature scheme, a signer owning a set of attributes is able to sign anonymously message with regarding to a policy, while the signatures are kept unforgeable even in the case of collusion. In this paper, we provide a novel construction of key-policy ABS for general circuits. Our construction is based on the correlation-relaxed two-to-one recoding (CR-TOR), which can be instantiated from the existence of multilinear maps. Due to the key indistinguishability property of the CR-TOR system, we prove that our scheme is selective unforgeability in the standard model under the k-Multilinear Computational Diffie-Hellman (k-MCDH) assumption. At the same time, the proposed scheme also holds the property of perfect privacy. Our framework based on CR-TOR leads to a circuit-ABS scheme that is conceptually different from the existing construction in the multilinear maps setting.

show abstract

Section: Comparison Of Schemesmentioning

confidence: 99%

Section: Proofmentioning

confidence: 99%

Section: A Key-policy Abs Scheme For Circuitsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Anonymous authentication for circuits from correlation-relaxed two-to-one recoding

Jing

Jiang

et al. 2015

J Ambient Intell Human Comput

View full text Add to dashboard Cite

show abstract

Outsourced attribute‐based signatures with perfect privacy for circuits in cloud computing

Huang

Lin

Chen

et al. 2021

Concurrency and Computation

View full text Add to dashboard Cite

Summary Attribute‐based signature (ABS) is a widely used cryptographic primitive, that provides both data integrity and fine‐grained privacy protection. However, the signing overhead of ABS is usually too large, making it unsuitable for resource‐constrained devices. Using cloud computing technology, the notion of outsourced attribute‐based signatures (OABS) was introduced to overcome this drawback. In OABS, the user can outsource him/her signing tasks to the signing‐cloud service provider (S‐CSP). The previous notion of privacy of OABS does not take the S‐CSP's attack into account, so it is not strong enough. To conform to the reality of cloud computing, we present a more accurate notion of privacy, called perfect privacy, which ensures that any adversary, even the S‐CSP, cannot identify which policy is used to generate the signature. Then, we propose a key‐policy OABS scheme for circuits based on multilinear mapping with perfect privacy. By using the outsourcing technique, in our scheme, the computation cost of the signer is only three or four pairing operations, which is independent of the complexity of the policy and the size of the attribute set. Our scheme achieves three advantages: perfect privacy, expressive policy, and constant signing cost, simultaneously.

show abstract