2 Hits in 3.1 sec

Asymptotically Compact Adaptively Secure Lattice IBEs and Verifiable Random Functions via Generalized Partitioning Techniques [chapter]

Shota Yamada
2017 Lecture Notes in Computer Science  
In this paper, we focus on the constructions of adaptively secure identity-based encryption (IBE) from lattices and verifiable random function (VRF) with large input spaces.  ...  They achieve the best asymptotic space efficiency among existing schemes that depend on the same assumption and achieve the same level of security.  ...  The author is grateful to the members of the study group "Shin-Akarui-Angou-Benkyokai" and anonymous reviewers of Eurocrypt 2017 and Crypto 2017 for insightful comments.  ... 
doi:10.1007/978-3-319-63697-9_6 fatcat:nql2x76ijrbgtl77vd2nw54hgu

Computing Blindfolded on Data Homomorphically Encrypted under Multiple Keys: An Extended Survey [article]

Asma Aloufi and Peizhao Hu and Yongsoo Song and Kristin Lauter
2020 arXiv   pre-print
We analyze them based on different system and security models, and examine their complexities. We share lessons learned and draw observations for designing better schemes with reduced overheads.  ...  We review techniques and schemes including Attribute-Based Encryption (ABE), Proxy Re-Encryption (PRE), Threshold Homomorphic Encryption (ThHE), and Multi-Key Homomorphic Encryption (MKHE).  ...  Identity-/Attribute-based Encryption Identity-based encryption (IBE) [15, 89] , and its generalization attribute-based encryption (ABE) [85] , is a type of encryption scheme that provides a fine-grained  ... 
arXiv:2007.09270v2 fatcat:7pkdtlnbvrgcnooql642rzd2za