搜索结果: 16-30 共查到“军事学 LWE”相关记录135条 . 查询时间(0.097 秒)
A Simple Key Reuse Attack on LWE and Ring LWE Encryption Schemes as Key Encapsulation Mechanisms (KEMs)
LWE RLWE KEM
2019/3/13
In this paper, we present a simple attack on LWE and Ring LWE encryption schemes used directly as Key Encapsulation Mechanisms (KEMs). This attack could work due to the fact that a key mismatch in a K...
Multi-Authority Attribute-Based Encryption from LWE in the OT Model
attribute-based encryption LWE
2019/3/13
In a (ciphertext policy) attribute-based encryption (ABE) scheme, a ciphertext is associated with a predicate ϕϕ and a secret key is associated with a string xx such that a key decrypts a ci...
Algebraic aspects of solving Ring-LWE, including ring-based improvements in the Blum-Kalai-Wasserman algorithm
ring learning with errors learning with errors Ring-LWE
2019/3/1
We provide several reductions of Ring-LWE problems to smaller Ring-LWE problems in the presence of samples of a restricted form (i.e. (a,b) such that a is restricted to a subring, or multiplicative co...
Short Discrete Log Proofs for FHE and Ring-LWE Ciphertexts
Zero-Knowledge Proofs Bulletproofs FHE
2019/1/26
In applications of fully-homomorphic encryption (FHE) that involve computation on encryptions produced by several users, it is important that each user proves that her input is indeed well-formed. Thi...
Non-Zero Inner Product Encryption Schemes from Various Assumptions: LWE, DDH and DCR
Non-zero inner product encryption lattices generic constructions functional encryption for inner products
2019/1/18
In non-zero inner product encryption (NIPE) schemes, ciphertexts and secret keys are associated with vectors and decryption is possible whenever the inner product of these vectors does not equal zero....
On the Asymptotics of Solving the LWE Problem Using Coded-BKW with Sieving
public-key cryptography LWE
2019/1/9
The Learning with Errors problem (LWE) has become a central topic in recent cryptographic research. In this paper, we present a new solving algorithm combining important ideas from previous work on im...
Implementing Token-Based Obfuscation under (Ring) LWE
implementation lattice techniques token-based program obfuscation
2019/1/2
Token-based obfuscation (TBO) is an interactive approach to cryptographic program obfuscation that was proposed by Goldwasser et al. as a potentially more practical alternative to conventional non-int...
The impact of error dependencies on Ring/Mod-LWE/LWR based schemes
Lattice cryptography Ring-LWE Error Correcting Codes
2018/12/3
Current estimation techniques for the probability of decryption failures in Ring/Mod-LWE/LWR based schemes assume independence of the failures in individual bits of the transmitted message to calculat...
LWE Without Modular Reduction and Improved Side-Channel Attacks Against BLISS
LWE problem lattice-based cryptography side-channel analysis
2018/11/19
Our interest in studying this problem stems from the side-channel attack against the BLISS lattice-based signature scheme described by Espitau et al. at CCS 2017. The attack targets a quadratic functi...
Simple and More Efficient PRFs with Tight Security from LWE and Matrix-DDH
Pseudorandom functions LWE MDDH
2018/11/19
We construct efficient and tightly secure pseudorandom functions (PRFs) with only logarithmic security loss and short secret keys. This yields very simple and efficient variants of well-known construc...
Partial Key Exposure in Ring-LWE-Based Cryptosystems: Attacks and Resilience
public-key cryptography lattice-based cryptography leakage resilience
2018/11/12
Introduce the search and decision Leaky-RLWE assumptions (Leaky-SRLWE, Leaky-DRLWE), to formalize the hardness of search/decision RLWE under leakage of some fraction of coordinates of the NTT transfor...
On the impact of decryption failures on the security of LWE/LWR based schemes
Lattice cryptography Post-quantum cryptography Decryption failures
2018/11/12
In this paper we investigate the impact of decryption failures on the chosen-ciphertext security of (Ring/Module)-Learning With Errors and (Ring/Module)-Learning with Rounding based primitives. Our an...
A Bit-fixing PRF with O(1) Collusion-Resistance from LWE
Constrained PRF Collusion-resistance LWE
2018/11/9
Constrained pseudorandom functions (CPRFs) allow learning modified PRF keys that can evaluate the PRF on a subset of the input space, or based on some sort of predicate. First introduced by Boneh and ...
A traitor tracing scheme is a public key encryption scheme for which there are many secret decryption keys. Any of these keys can decrypt a ciphertext; moreover, even if a coalition of users collude, ...
In distributed pseudorandom functions (DPRFs), a PRF secret key SKSK is secret shared among NN servers so that each server can locally compute a partial evaluation of the PRF on some input XX. A combi...