Attribute-based signatures for unbounded circuits in the ROM and efficient instantiations from lattices

DOI10.1007/978-3-319-76581-5_4zbMath1406.94051OpenAlexW2789323997MaRDI QIDQ1753843

Ali El Kaafarani, Shuichi Katsumata

Publication date: 29 May 2018

Full work available at URL: https://ora.ox.ac.uk/objects/uuid:1e14f187-c655-427d-8de8-536ed656f795

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (8)

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 ⋮ Traceable policy-based signatures and instantiation from lattices ⋮ Lattice-based e-cash, revisited ⋮ Efficient attribute-based signature for monotone predicates ⋮ Short attribute-based signatures for arbitrary Turing machines from standard assumptions ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ Revocable hierarchical attribute-based signatures from lattices

This page was built for publication: Attribute-based signatures for unbounded circuits in the ROM and efficient instantiations from lattices