Efficient attribute-based signatures for unbounded arithmetic branching programs

DOI10.1007/978-3-030-17253-4_5zbMath1465.94095OpenAlexW3153381877MaRDI QIDQ2289207

Tatsuaki Okamoto, Katsuyuki Takashima, Pratish Datta

Publication date: 28 January 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-17253-4_5

zbMATH Keywords

concrete efficiencyarithmetic span programsattribute-based signaturesarithmetic branching programsbilinear groupsunbounded multi-use of attributes

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (4)

Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security ⋮ Succinct attribute-based signatures for bounded-size circuits by combining algebraic and arithmetic proofs ⋮ Efficient attribute-based signature for monotone predicates ⋮ Short attribute-based signatures for arbitrary Turing machines from standard assumptions

This page was built for publication: Efficient attribute-based signatures for unbounded arithmetic branching programs