Efficient attribute-based signatures for non-monotone predicates in the standard model
From MaRDI portal
Publication:3084339
DOI10.1007/978-3-642-19379-8_3zbMATH Open1291.94194OpenAlexW2129596906MaRDI QIDQ3084339FDOQ3084339
Authors: 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
Recommendations
Cited In (31)
- Succinct attribute-based signatures for bounded-size circuits by combining algebraic and arithmetic proofs
- Tightly secure signature schemes from the LWE and subset sum assumptions
- Predicate signatures from pair encodings via dual system proof technique
- FABSS: Attribute-Based Sanitizable Signature for Flexible Access Structure
- Escrow free attribute-based signature with self-revealability
- Compact NIZKs from standard assumptions on bilinear maps
- Practical (fully) distributed signatures provably secure in the standard model
- Attribute-based versions of Schnorr and ElGamal
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
- Short attribute-based signatures for threshold predicates
- Some key techniques on pairing vector spaces
- Verifiable fully outsourced attribute-based signcryption system for IoT eHealth big data in cloud computing
- Revocable attribute-based signatures with adaptive security in the standard model
- Policy controlled system with anonymity
- Fully dynamic attribute-based signatures for circuits from codes
- Registered attribute-based signature
- Decentralized attribute-based signatures
- Compact NIZKs from standard assumptions on bilinear maps
- Attribute-based signatures with advanced delegation, and tracing
- On the security of joint signature and encryption revisited
- Hierarchical Attribute-Based Signatures
- Stronger security notions for decentralized traceable attribute-based signatures and more efficient constructions
- Efficient and secure attribute-based signature for monotone predicates
- Generic Framework for Attribute-Based Group Signature
- Attribute-based signatures from RSA
- An \(r\)-hiding revocable group signature scheme: group signatures with the property of hiding the number of revoked users
- Efficient attribute-based signature for monotone predicates
- Short attribute-based signatures for arbitrary Turing machines from standard assumptions
- Attribute-based signatures for unbounded languages from standard assumptions
- Revocable hierarchical attribute-based signatures from lattices
- Attribute-based signatures for range of inner product and its applications
This page was built for publication: Efficient attribute-based signatures for non-monotone predicates in the standard model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3084339)
