Efficient Attribute-Based Signatures for Non-monotone Predicates in the Standard Model

DOI10.1007/978-3-642-19379-8_3zbMath1291.94194OpenAlexW2129596906MaRDI QIDQ3084339

Tatsuaki Okamoto, Katsuyuki Takashima

Publication date: 15 March 2011

Published in: Public Key Cryptography – PKC 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19379-8_3

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (26)

Short Attribute-Based Signatures for Threshold Predicates ⋮ Generic Framework for Attribute-Based Group Signature ⋮ Attribute-based versions of Schnorr and ElGamal ⋮ Verifiable fully outsourced attribute-based signcryption system for IoT eHealth big data in cloud computing ⋮ On the security of joint signature and encryption revisited ⋮ Efficient and secure attribute-based signature for monotone predicates ⋮ 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 ⋮ Hierarchical Attribute-Based Signatures ⋮ Efficient attribute-based signature for monotone predicates ⋮ Attribute-based signatures from RSA ⋮ Short attribute-based signatures for arbitrary Turing machines from standard assumptions ⋮ FABSS: Attribute-Based Sanitizable Signature for Flexible Access Structure ⋮ Revocable Attribute-Based Signatures with Adaptive Security in the Standard Model ⋮ Some Key Techniques on Pairing Vector Spaces ⋮ Decentralized Attribute-Based Signatures ⋮ Predicate signatures from pair encodings via dual system proof technique ⋮ Stronger Security Notions for Decentralized Traceable Attribute-Based Signatures and More Efficient Constructions ⋮ Policy controlled system with anonymity ⋮ Escrow free attribute-based signature with self-revealability ⋮ Compact NIZKs from standard assumptions on bilinear maps ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation ⋮ Tightly secure signature schemes from the LWE and subset sum assumptions ⋮ An \(r\)-hiding revocable group signature scheme: group signatures with the property of hiding the number of revoked users ⋮ Revocable hierarchical attribute-based signatures from lattices ⋮ Practical (fully) distributed signatures provably secure in the standard model

This page was built for publication: Efficient Attribute-Based Signatures for Non-monotone Predicates in the Standard Model