Skip to main content
Log in

Attribute-based signature on lattices

  • Published:
Journal of Shanghai Jiaotong University (Science) Aims and scope Submit manuscript

Abstract

Attribute-based signature is a versatile class of digital signatures. In attribute-based signature, a signer obtains his private key corresponding to the set of his attributes from a trusted authority, and then he can sign a message with any predicate that is satisfied by his attributes set. Unfortunately, there does not exist an attributebased signature which is resistance to the quantum attacks. This means we do not have secure attribute-based signature schemes in a post-quantum world. Based on this consideration, an attribute-based signature on lattices, which could resist quantum attacks, is proposed. This scheme employs “bonsai tree” techniques, and could be proved secure under the hardness assumption of small integer solution problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Maji H K, Prabhakaran M, Rosulek M. Attribute-based signatures [C]// Proceedings of the 11th International Conference on Topics in Cryptology (CT-RSA 2011). Berlin, Germany: Springer-Verlag, 2011: 376–392.

    Google Scholar 

  2. Guo S, Zeng Y. Attribute-based signature scheme [C]// Proceedings of the 2008 International Conference on Information Security and Assurance (ISA 2008). Washington DC, USA: IEEE Computer Society, 2008: 509–511.

    Google Scholar 

  3. Li J, Au M H, Susilo W, et al. Attribute-based signature and its applications [C]// Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security. NewYork, USA: ACM, 2010: 60–69.

    Google Scholar 

  4. Herranz J, Laguillaumie F, Libert B, et al. Short attribute-based signatures for threshold predicates [C]// Proceedings of Topics in Cryptology (CTRSA 2012). Berlin, Germany: Springer-Verlag, 2012: 51–67.

    Google Scholar 

  5. Zeng F, Xu C, Li Q, et al. Attribute-based signature scheme with constant size signature [J]. Journal of Computational Information Systems, 2012, 8(7): 2875–2882.

    Google Scholar 

  6. Ge A J, Ma C G, Zhang Z F. Attribute-based signature scheme with constant size signature in the standard model [J]. IET Information Security, 2012, 6(2): 47–54.

    Article  Google Scholar 

  7. Okamoto T, Takashima K. Efficient attribute-based signatures for non-monotone predicates in the standard model [C]// Proceedings of Public Key Cryptography (PKC 2011). Berlin, Germany: Springer-Verlag, 2011: 35–52.

    Google Scholar 

  8. Okamoto T, Takashima K. Decentralized attribute-Based signatures [C]// Proceedings of Public-Key Cryptography (PKC 2013). Berlin, Germany: Springer-Verlag, 2013: 125–142.

    Google Scholar 

  9. Ajtai M. Generating hard instances of lattice problems (extended abstract) [C]//Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing (STOC’ 96). New York, USA: ACM, 1996: 99–108.

    Google Scholar 

  10. Cash D, Hofheinz D, Kiltz E, et al. Bonsai trees, or how to delegate a lattice basis [C]// Proceedings of Advances in Cryptology (EUROCRYPT 2010). Berlin, Germany: Springer-Verlag, 2010: 523–552.

    Google Scholar 

  11. Rückert M. Lattice-based blind signatures [C]// Proceedings of Advances in Cryptology (ASIACRYPT 2010). Berlin, Germany: Springer-Verlag, 2010: 413–430.

    Google Scholar 

  12. Gordon S, Katz J, Vaikuntanathan V. A group signature scheme from lattice assumptions [C]// Proceedings of Advances in Cryptology (ASIACRYPT 2010). Berlin, Germany: Springer-Verlag, 2010: 395–412.

    Google Scholar 

  13. Cayrel P L, Lindner R, Rückert M, et al. A lattice-based threshold ring signature scheme [C]// Progress in Cryptology-LATINCRYPT 2010. Berlin, Germany: Springer-Verlag, 2010: 255–272.

    Chapter  Google Scholar 

  14. Regev O. On lattices, learning with errors, random linear codes, and cryptography [C]//Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing (STOC’ 05). New York, USA: ACM, 2005: 84–93.

    Google Scholar 

  15. Boyen X. Attribute-based functional encryption on lattices [C]// Proceedings of the 10th Theory of Cryptography Conference on Theory of Cryptography. Berlin, Germany: Springer-Verlag, 2013: 122–142.

    Google Scholar 

  16. Alwen J, Peikert C. Generating shorter bases for hard random lattices [J]. Theory of Computing Systems, 2011, 48(3): 535–553.

    Article  MATH  MathSciNet  Google Scholar 

  17. Gentry C, Peikert C, Vaikuntanathan V. Trapdoors for hard lattices and new cryptographic constructions [C]//Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC’ 08). New York, USA: ACM, 2008: 197–206.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ke-fei Chen  (陈克非).

Additional information

Foundation item: the National Natural Science Foundation of China (Nos. 61133014 and 60903189)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mao, Xp., Chen, Kf., Long, Y. et al. Attribute-based signature on lattices. J. Shanghai Jiaotong Univ. (Sci.) 19, 406–411 (2014). https://doi.org/10.1007/s12204-014-1516-4

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12204-014-1516-4

Key words

CLC number

Navigation