Pages that link to "Item:Q2289207"
From MaRDI portal
The following pages link to Efficient attribute-based signatures for unbounded arithmetic branching programs (Q2289207):
Displayed 4 items.
- Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security (Q2132442) (← links)
- Efficient attribute-based signature for monotone predicates (Q2697932) (← links)
- Short attribute-based signatures for arbitrary Turing machines from standard assumptions (Q2701493) (← links)
- Succinct attribute-based signatures for bounded-size circuits by combining algebraic and arithmetic proofs (Q6134855) (← links)