Book ChapterDOI
Adaptively secure efficient lattice (H)IBE in standard model with short public parameters
Kunwar P. Singh,C. Pandurangan,A. K. Banerjee +2 more
- pp 153-172
Reads0
Chats0
TLDR
A scheme to divide an l-bit identity into l′ blocks of l/l′ so that size of the vector $\overrightarrow{V}$ can be reduced from l elements of G to l′ elements ofG is presented.Abstract:
Independent work by Chatterjee and Sarkar [9] and Naccache [16] provided a variant of Waters' IBE to reduce public parameters. The idea is to divide an l-bit identity into l′ blocks of l/l′ so that size of the vector $\overrightarrow{V}$ can be reduced from l elements of G to l′ elements of G. We name this technique as blocking technique. This leads to some associated degradation in security reduction. In this paper our contribution is two fold: First we apply Waters' [21] idea to convert Agrawal et al. [1] selective-ID secure lattice HIBE to adaptive-ID secure HIBE then using blocking technique we reduce the public parameters. Second we present efficient lattice identity based encryption in standard model with smaller public key size which is variant of [1]. Using blocking technique our scheme reduces public key size by a factor of β at the cost of increasing (β−lg (β))2 number of bits in q where q is size of field Zq. There is an interesting trade-off between reducing the public parameter size and increase in the computational cost. For 160-bit identities we show that compared to scheme [1] the public parameter size can be reduced by almost 90% while increasing the computation cost by only 8.71% for appropriate choice of β.read more
Citations
More filters
Journal Article
Traitor Tracing with constant transmission rate
Aggelos Kiayias,Moti Yung +1 more
TL;DR: This work presents a general methodology and two protocol constructions that result in the first two public-key traitor tracing schemes with constant transmission rate in settings where plaintexts can be calibrated to be sufficientlylarge.
Book
Advances in cryptology -- EUROCRYPT 2010 : 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, May 30-June 3, 2010 : proceedings
TL;DR: Cryptosystems I and II: Cryptography between Wonderland and Underland as discussed by the authors, a simple BGN-type Cryptosystem from LWE, or Bonsai Trees, or how to delegate a Lattice Basis.
Book ChapterDOI
Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
Shuichi Katsumata,Shota Yamada +1 more
TL;DR: In this paper, Chen et al. proposed a secure IBE scheme based on the hardness of a computational/search problem, rather than a decisional problem such as DDH and DLIN on bilinear maps with sublinear public parameter size.
Book ChapterDOI
Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters
TL;DR: An attribute-based encryption scheme for branching programs that simultaneously satisfies the following properties for the first time: the scheme achieves compact secret keys, the security is proven under the LWE assumption with polynomial approximation factors, and the scheme can deal with unbounded length branching programs.
Book ChapterDOI
Loop-Abort Faults on Lattice-Based Fiat-Shamir and Hash-and-Sign Signatures
TL;DR: This work focuses on the implementation security issues related to postquantum schemes and their applications in e-commerce, e.g. the supply and demand for identity protection in the e-sports industry.
References
More filters
Book ChapterDOI
Engineering and Computer-Science
TL;DR: In this chapter articles from various fields are collected, spanning from computer-science and image-processing to engineering applications from electrical engineering and structural mechanics.