Pages that link to "Item:Q1753843"
From MaRDI portal
The following pages link to Attribute-based signatures for unbounded circuits in the ROM and efficient instantiations from lattices (Q1753843):
Displaying 17 items.
- A new lattice-based threshold attribute-based signature scheme (Q1631936) (← links)
- An equivalence between attribute-based signatures and homomorphic signatures, and new constructions for both (Q1690282) (← links)
- Attribute-based signatures for unbounded languages from standard assumptions (Q1710613) (← links)
- Attribute-based signatures with user-controlled linkability without random oracles (Q1744854) (← links)
- Revocable hierarchical attribute-based signatures from lattices (Q2096621) (← links)
- Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security (Q2132442) (← links)
- Attribute-based signatures from RSA (Q2437776) (← links)
- Lattice-based e-cash, revisited (Q2692386) (← links)
- Efficient attribute-based signature for monotone predicates (Q2697932) (← links)
- Short attribute-based signatures for arbitrary Turing machines from standard assumptions (Q2701493) (← links)
- Group signatures and more from isogenies and lattices: generic, simple, and efficient (Q6041582) (← links)
- Enhanced Security of Attribute-Based Signatures (Q6104623) (← links)
- Succinct attribute-based signatures for bounded-size circuits by combining algebraic and arithmetic proofs (Q6134855) (← links)
- Traceable policy-based signatures and instantiation from lattices (Q6195214) (← links)
- Privacy enhanced secure compact attribute-based signature from MQ problem for monotone span program (Q6634384) (← links)
- Fully dynamic attribute-based signatures for circuits from codes (Q6635745) (← links)
- Two-round threshold signature from algebraic one-more learning with errors (Q6653014) (← links)
