Bootstrapping for HElib

S Halevi, V Shoup - Journal of Cryptology, 2021 - Springer
Gentry's bootstrapping technique is still the only known method of obtaining fully
homomorphic encryption where the system's parameters do not depend on the complexity of …

A lattice-based homomorphic proxy re-encryption scheme with strong anti-collusion for cloud computing

J Li, Z Qiao, K Zhang, C Cui - Sensors, 2021 - mdpi.com
The homomorphic proxy re-encryption scheme combines the characteristics of a
homomorphic encryption scheme and proxy re-encryption scheme. The proxy can not only …

Симметричное полностью гомоморфное шифрование с использованием неприводимых матричных полиномов

ФБ Буртыка - Известия Южного федерального университета …, 2014 - cyberleninka.ru
Представлена новая симметричная компактная полностью гомоморфная криптос-хема,
основанная на использовании матричных полиномов и производящая шифрование в …

Symmetric fully homomorphic encryption using decidable matrix equations

P Burtyka, O Makarevich - … of the 7th International Conference on …, 2014 - dl.acm.org
We propose a new fully homomorphic encryption (FHE) scheme. Unlike previous ones, our
FHE scheme is effective and simple enough for practical applications. Our FHE essentially …

Weak is better: Tightly secure short signatures from weak prfs

J Alperin-Sheriff, D Apon - Cryptology ePrint Archive, 2017 - eprint.iacr.org
Abstract The Boyen-Li signature scheme [Asiacrypt'16] is a major theoretical breakthrough.
Via a clever homomorphic evaluation of a pseudorandom function over their verification key …

Bootstrapping fully homomorphic encryption with ring plaintexts within polynomial noise

L Chen, Z Zhang - International Conference on Provable Security, 2017 - Springer
Despite a great deal of progress in resent years, efficiency of fully homomorphic encryption
(FHE) is still a major concern. Specifically, the bootstrapping procedure is the most costly …

Compressible (F) HE with applications to PIR

CB Gentry, S Halevi - US Patent 10,985,904, 2021 - Google Patents
(57) ABSTRACT A request is received for specific information that can be determined using
data in a database on a first computer system. Either at least some of the data is encrypted …

Cryptography device having secure provision of random number sequences

M Georgieva, A Gouget - US Patent 11,394,525, 2022 - Google Patents
Secure computation of a random number sequence in a cryptographic device. The
computation is secured by receiving a homomorphic ciphertext seed vector, selecting an …

Homomorphic modular reduction and improved bootstrapping for bgv scheme

R Li, C Jia - Information Security and Cryptology: 17th International …, 2021 - Springer
Bootstrapping is a crucial subroutine of fully homomorphic encryption (FHE), where a
homomorphic encryption scheme evaluates its own decryption circuits. Homomorphic …

A simple lattice-based PKE scheme

L Zhou, Z Hu, F Lv - SpringerPlus, 2016 - Springer
In this paper, we first present a new lattice-based PKE scheme on SIS, proving that it
achieves CPA-security under DBi-ISIS assumption. Compared to some lattice-based …