Attribute-based Signatures for Unbounded Circuits in the ROM and Efficient Instantiations from Lattices

@article{Kaafarani2018AttributebasedSF,
  title={Attribute-based Signatures for Unbounded Circuits in the ROM and Efficient Instantiations from Lattices},
  author={Ali El Kaafarani and Shuichi Katsumata},
  journal={IACR Cryptol. ePrint Arch.},
  year={2018},
  volume={2018},
  pages={22}
}
Attribute-based signature (ABS), originally introduced by Maji et al. (CT-RSA’11), represents an essential mechanism to allow for fine-grained authentication. A user associated with an attribute x can sign w.r.t. a given public policy C only if his attribute satisfies C, i.e., \(C(x)=1\). So far, much effort on constructing bilinear map-based ABS schemes have been made, where the state-of-the-art scheme of Sakai et al. (PKC’16) supports the very wide class of unbounded circuits as policies… 
View via Publisher
eprint.iacr.org
14 Citations
Background Citations
3
Methods Citations
1

14 Citations

Citation Type

Citation Type

Efficient Attribute-Based Signatures for Unbounded Arithmetic Branching Programs
TLDR
This paper designs a fully secure, i.e., adaptively unforgeable and perfectly signer-private ABS scheme for signing policies realizable by arithmetic branching programs (ABP), which are a quite expressive model of arithmetic computations.
Attribute-Based Signatures for Inner-Product Predicate from Lattices
TLDR
This paper introduces a fully secure and efficient attribute-based signature for inner-product (IP) predicate from lattice assumptions in the random oracle model, in which the admissible IP predicate is more general in contrast to those of the existing lattice-based constructions.
Recent Advances in Attribute-Based Signatures
TLDR
A brief overview of the recent advances in the area of attribute-based signatures is given, to pick up some of the recently schemes, and introduce the key techniques for these constructions.
Secure Outsourced Attribute-Based Signatures with Perfect Anonymity in the Standard Model
TLDR
This paper treats the S-CSP as an adversary and present more accurate unforgeability and anonymity models for OABS to remedy the drawbacks of the previous ones and proves the security of the improved scheme under the standard model.
Traceable Policy-Based Signatures and Instantiation from Lattices
Outsourced attribute‐based signatures with perfect privacy for circuits in cloud computing
TLDR
This work proposes a key‐policy OABS scheme for circuits based on multilinear mapping with perfect privacy, which ensures that any adversary, even the S‐CSP, cannot identify which policy is used to generate the signature.
Lattice-Based E-Cash, Revisited
TLDR
This work proposes the first secure compact e-cash system based on lattices following the result from Bourse et al. (Asiacrypt 2019), and depart from previous frameworks of e- cash systems by leveraging lossy trapdoor functions to construct the authors' coins.
Revocable Hierarchical Attribute-based Signatures from Lattices
TLDR
A direct HABS scheme with a Verifier-Local Revocation (VLR) property, extending the original HABS security model to address revocation and developing a new attribute delegation technique with appropriate VLR mechanism for HABS, which also implies the first ABS scheme to support VLR.
Group Signatures and More from Isogenies and Lattices: Generic, Simple, and Efficient
TLDR
This work builds on the recent efficient OR-proof by Beullens, Katsumata, and Pintore and further shows that the resulting non-interactive zero-knowledge proof system is online extractable.
Collisions in Supersingular Isogeny Graphs and the SIDH-based Identification Protocol
TLDR
This paper revisits the proofs that have appeared in the literature for the special soundness property of the aforementioned SIDH-based identification protocol, and introduces an alternative extractor for which it is shown that this is not always the case.
...
...

References

SHOWING 1-10 OF 46 REFERENCES
Post-Quantum Attribute-Based Signatures from Lattice Assumptions
TLDR
This work gives new and efficient constructions of lattice-based ABS signature schemes, that are not based on the traditional approach of using span programs or secret sharing schemes as for classical schemes, and is less involved and does not require such complex subroutines.
Attribute-Based Signatures for Circuits from Bilinear Map
TLDR
This work presents an attribute-based signature scheme which allows us to use an arbitrary circuit as the predicate with practical efficiency from the symmetric external Diffie-Hellman assumption, and achieves this by combining the efficiency of Groth-Sahai proofs, which allow us to prove algebraic equations efficiently, and the expressiveness ofGroth-Ostrovsky- Sahai proofs.
An Equivalence Between Attribute-Based Signatures and Homomorphic Signatures, and New Constructions for Both
TLDR
In Attribute-Based Signatures (ABS), an authority can generate multiple signing keys, where each key is associated with an attribute x, such that a key for x can sign messages respective to f only if \(f(x) = 0\).
Short Attribute-Based Signatures for Threshold Predicates
TLDR
This work proposes the first two attribute-based signature schemes with constant size signatures, which are proven in the selective-predicate and adaptive-message setting, in the standard model, under chosen message attacks, with respect to some algorithmic assumptions related to bilinear groups.
Attribute-Based Signatures
TLDR
A construction which is secure even against a malicious attribute authority, but the security for this scheme is proven in the generic group model, and several practical instantiations based on groups with bilinear pairing operations are shown.
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
TLDR
This work demonstrates how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices and is able to shorten the length of the signatures that are produced by Girault's factoring-based digital signature scheme.
Lattice Signatures Without Trapdoors
TLDR
This work provides an alternative method for constructing lattice-based digital signatures which does not use the "hash-and-sign" methodology, and shows that by slightly changing the parameters, one can get even more efficient signatures that are based on the hardness of the Learning With Errors problem.
Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
TLDR
A new lattice-based cryptographic tool is constructed: a statistical zero-knowledge argument of knowledge of a valid message-signature pair for Boyen's signature scheme (Boyen, PKC’10), which potentially can be used as the building block to design various privacy-enhancing cryptographic constructions.
Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures
TLDR
This paper provides a more efficient way to prove knowledge of plaintexts for lattice-based encryption schemes and makes use of this to construct a new group signature scheme that is a “hybrid” in the sense that privacy holds under a lattices-based assumption while security is discrete-logarithm-based.
Design Validations for Discrete Logarithm Based Signature Schemes
TLDR
This paper considers several Discrete Logarithm (DSA-like) signatures abstracted as generic schemes, and shows that the following holds: if the schemes can be broken by an existential forgery using an adaptively chosen-message attack then either the discrete logarithM problem can be solved, or some hash function can be distinguished from an ideal one, or multi-collisions can be found.
...
...