搜索结果: 46-60 共查到“Polynomial”相关记录358条 . 查询时间(0.05 秒)
Efficient KDM-CCA Secure Public-Key Encryption for Polynomial Functions
public-key encryption key-dependent messages chosen-ciphertext security
2016/12/10
KDM[F][F]-CCA secure public-key encryption (PKE) protects the security of message f(sk)f(sk), with f∈Ff∈F, that is computed directly from the secret key, even if the adversary has access to a decrypti...
Partitioning via Non-Linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
Ring LWE Bilinear Maps Identity-Based Encryption
2016/12/10
In this paper, we present new adaptively secure identity-based encryption (IBE) schemes. One of the distinguishing property of the schemes is that it achieves shorter public parameters than previous s...
Concurrently Composable Security With Shielded Super-polynomial Simulators
universal composability protocol design cryptographic security proofs
2016/12/7
We propose a new framework for concurrently composable security that relaxes the security notion of UC security. As in previous frameworks, our notion is based on the idea of providing the simulator w...
Polynomial Batch Codes for Efficient IT-PIR
Private information retrieval batch codes batch queries
2016/6/8
Private information retrieval (PIR) is a way for clients to query a remote database without the database holder learning the clients' query terms or the responses they generate. Compelling application...
Quantum homomorphic encryption for polynomial-sized circuits
homomorphic encryption quantum cryptography quantum teleportation
2016/6/6
We present a new scheme for quantum homomorphic encryption which is compact and allows for efficient evaluation of arbitrary polynomial-sized quantum circuits. Building on the framework of Broad- bent...
A Generalisation of the Conjugation Method for Polynomial Selection for the Extended Tower Number Field Sieve Algorithm
finite fields discrete logarithm tower number field sieve
2016/6/2
In a recent work, Kim and Barbulescu showed how to combine previous polynomial selection methods with the extended tower number field sieve algorithm to obtain improved complexity for the discrete log...
A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm
Discrete Log Tower Number Field Sieve
2016/5/24
In a recent work, Kim and Barbulescu had extended the tower number field sieve algorithm to obtain improved asymptotic complexities in the medium prime case for the discrete logarithm problem on Fpn w...
Methods for Efficient Homomorphic Integer Polynomial Evaluation based on GSW FHE
GSW integer multiplication packing
2016/5/23
We introduce new methods to evaluate integer polynomials
with GSW FHE. Our methods cause much slower noise growth and result
in much better efficiency in the evaluation of low-degree large plaintext...
Tower Number Field Sieve Variant of a Recent Polynomial Selection Method
TNFS Recent Polynomial Selection Method
2016/4/25
At Asiacrypt 2015, Barbulescu et al. performed a thorough analysis of the tower number field sieve (TNFS) variant of the number field sieve algorithm. More recently, Kim and Barbulescu combined the TN...
A Family of Scalable Polynomial Multiplier Architectures for Ring-LWE Based Cryptosystems
number theoretic transform Ring learning with errors
2016/3/24
Many lattice based cryptosystems are based on the Ring learning with errors (Ring-LWE) problem. The most critical and computationally intensive operation of these Ring-LWE based cryptosystems is polyn...
A Polynomial-Time Attack on the BBCRS Scheme
Code-based cryptography distinguisher generalized Reed-Solomon codes
2016/3/18
The BBCRS scheme is a variant of the McEliece public-key encryption scheme where the hiding phase is performed by taking the inverse of a matrix which is of the form T+R where T is a sparse matrix wit...
$GF(2^n)$ Bit-Parallel Squarer Using Generalized Polynomial Basis For a New Class of Irreducible Pentanomials
implementation implementation
2016/1/26
We present explicit formulae and complexities of bit-parallel GF(2n) squarers for a new class of irreducible pentanomials xn+xn−1+xk+x+1, where n is odd and 1
A Polynomial Time Attack against Algebraic Geometry Code Based Public Key Cryptosystems
public-key cryptography Algebraic Geometry codes
2016/1/26
We give a polynomial time attack on the McEliece public key cryptosystem based on algebraic geometry codes. Roughly speaking, this attacks runs in O(n4) operations in Fq, where n denotes the code leng...
Bootstrapping is a technique, originally due to Gentry (STOC 2009), for “refreshing” ciphertexts of a
somewhat homomorphic encryption scheme so that they can support further homomorphic operations. T...
Polynomial Time Attack on Wild McEliece Over Quadratic Extensions
public-key cryptography wild McEliece cryptosystem filtration
2016/1/25
We present a polynomial time structural attack against the McEliece system
based on Wild Goppa codes from a quadratic finite field extension. This attack uses the fact
that such codes can be disting...