Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles

Rückert, Markus

doi:10.1007/978-3-642-12929-2_14

Cited by 74 publications

(75 citation statements)

References 27 publications

(51 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Rückert [52] modified our signature scheme to make it strongly unforgeable, and constructed hierarchical identity-based signatures. Agrawal and Boyen [3] constructed a standard-model IBE based on LWE, which is secure under a selective-identity attack; their construction has structure similar to ours, but it does not address delegation, nor does it give an efficient signature scheme.…”

Section: Related Techniques and Workmentioning

confidence: 99%

Bonsai Trees, or How to Delegate a Lattice Basis

Cash

Hofheinz

Kiltz

et al. 2010

Lecture Notes in Computer Science

530

359

View full text Add to dashboard Cite

Abstract. We introduce a new lattice-based cryptographic structure called a bonsai tree, and use it to resolve some important open problems in the area. Applications of bonsai trees include:-An efficient, stateless 'hash-and-sign' signature scheme in the standard model (i.e., no random oracles), and -The first hierarchical identity-based encryption (HIBE) scheme (also in the standard model) that does not rely on bilinear pairings. Interestingly, the abstract properties of bonsai trees seem to have no known realization in conventional number-theoretic cryptography.

show abstract

Section: Related Techniques and Workmentioning

confidence: 99%

Bonsai Trees, or How to Delegate a Lattice Basis

Cash

Hofheinz

Kiltz

et al. 2010

Lecture Notes in Computer Science

530

359

View full text Add to dashboard Cite

show abstract

“…For group and ring signatures see [35,77,24]. For identity based cryptography see [2,22,1,78]. For (fully) homomorphic encryption see [33,28,80,65,29,3,82,79,32,25,19,31,30].…”

Section: Resultsmentioning

confidence: 99%

The Geometry of Lattice Cryptography

Micciancio

2011

Foundations of Security Analysis and Design VI

View full text Add to dashboard Cite

Lattice cryptography is one of the hottest and fastest moving areas in mathematical cryptography today. Interest in lattice cryptography is due to several concurring factors. On the theoretical side, lattice cryptography is supported by strong worst-case/average-case security guarantees. On the practical side, lattice cryptography has been shown to be very versatile, leading to an unprecedented variety of applications, from simple (and efficient) hash functions, to complex and powerful public key cryptographic primitives, culminating with the celebrated recent development of fully homomorphic encryption. Still, one important feature of lattice cryptography is simplicity: most cryptographic operations can be implemented using basic arithmetic on small numbers, and many cryptographic constructions hide an intuitive and appealing geometric interpretation in terms of point lattices. So, unlike other areas of mathematical cryptology even a novice can acquire, with modest effort, a good understanding of not only the potential applications, but also the underlying mathematics of lattice cryptography.In these notes, we give an introduction to the mathematical theory of lattices, describe the main tools and techniques used in lattice cryptography, and present an overview of the wide range of cryptographic applications. This material should be accessible to anybody with a minimal background in linear algebra and some familiarity with the computational framework of modern cryptography, but no prior knowledge about point lattices.

show abstract

“…Moreover, we employ the lattice basis delegation technique in [21] for delegating a short lattice basis that has the advantage of keeping the lattice dimension invariant, thus the signing private key size and the signature length of our scheme are both invariant. More specifically, compared with the classic Rückert's scheme [25], our proposed public auditing scheme has obvious advantage in storage space. This is because Rückert's scheme utilizes the Bonsai tree technique [10] to construct the identity-based signature from lattice assumption, which results in the lattice dimension expanding and the size of signing private key and the signature length increase dramatically.…”

Section: Efficiency Evaluationmentioning

confidence: 99%

Efficient Identity-Based Public Auditing Scheme for Cloud Storage from Lattice Assumption

Zhang

2014

2014 IEEE 17th International Conference on Computational Science and Engineering

View full text Add to dashboard Cite

In this paper, we propose a post-quantum secure cloud storage system supporting privacy-preserving public auditing scheme from lattice assumption. In our public auditing scheme, we introduce a third party auditor (TPA), which can efficiently audit the cloud storage data, bringing no additional on-line burden to the users. We utilize preimage sampleable functions to realize our lattice-based signature, thus can be considered as random masking to make sure the TPA can not recover the primitive data blocks of the users. Based on the inhomogeneous small integer solution assumption (ISIS), our public auditing scheme is proved secure against the data lost attacks and tamper attacks from the cloud service providers. To the best of our knowledge, we construct the first identitybased public auditing for secure cloud storage from lattice assumption, which is an interesting stepping stone in the postquantum cryptographic communication.

show abstract

Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles

Cited by 74 publications

References 27 publications

Bonsai Trees, or How to Delegate a Lattice Basis

Bonsai Trees, or How to Delegate a Lattice Basis

The Geometry of Lattice Cryptography

Efficient Identity-Based Public Auditing Scheme for Cloud Storage from Lattice Assumption

Contact Info

Product

Resources

About