Attribute-based signatures for unbounded languages from standard assumptions

DOI10.1007/978-3-030-03329-3_17zbMath1446.94156OpenAlexW2898422980MaRDI QIDQ1710613

Shuichi Katsumata, Nuttapong Attrapadung, Goichiro Hanaoka, Yusuke Sakai

Publication date: 23 January 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-03329-3_17

zbMATH Keywords

Turing machinesstructure-preserving signaturesnondeterministic finite automataattribute-based signaturesgroth-sahai proofs

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

Attribute-based signatures for range of inner product and its applications ⋮ 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: Attribute-based signatures for unbounded languages from standard assumptions