搜索结果: 31-45 共查到“lattices”相关记录254条 . 查询时间(0.359 秒)
Proxy re-encryption (PRE) and Proxy re-signature (PRS) were introduced by Blaze, Bleumer and Strauss [Eurocrypt '98]. Basically, PRE allows a semi-trusted proxy to transform a ciphertext encrypted und...
Faster Gaussian Sampling for Trapdoor Lattices with Arbitrary Modulus
Lattice-Based Cryptography Discrete Gaussian Sampling Lattice Trapdoors
2017/4/11
We present improved algorithms for gaussian preimage sampling using the lattice trapdoors of (Micciancio and Peikert, CRYPTO 2012). The MP12 work only offered a highly optimized algorithm for the on-l...
One-Shot Verifiable Encryption from Lattices
Verifiable encryption proofs of plaintext knowledge lattice cryptography
2017/2/20
Verifiable encryption allows one to prove properties about encrypted data and is an important building block in the design of cryptographic protocols, e.g., group signatures, key escrow, fair exchange...
Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices
Lattices Bounded Distance Decoding Problem Unique Shortest Vector Problem
2016/12/12
We present a probabilistic polynomial-time reduction from the lattice Bounded Distance Decoding (BDD) problem with parameter 1/(2√⋅γ2⋅γ) to the unique Shortest Vector Problem (uSVP) with p...
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...
A Parallel Variant of LDSieve for the SVP on Lattices
lattices sieving algorithms parallel algorithms
2016/12/9
In this paper, we propose a parallel implementation of LDSieve, a recently published sieving algorithm for the SVP, which achieves the best theoretical complexity to this day, on parallel shared-memor...
The closest vector problem in tensored root lattices of type A and in their duals
Lattice based cryptography Cyclotomic lattices Tensored root lattices
2016/12/9
The closest vector problem in tensored root lattices of type A and in their duals.
Server-Aided Revocable Identity-Based Encryption from Lattices
lattice techniques public-key cryptography
2016/12/8
Server-aided revocable identity-based encryption (SR-IBE), recently proposed by Qin et al.
at ESORICS 2015, offers significant advantages over previous user revocation mechanisms in the scope
of IBE...
Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
public-key cryptography PHF
2016/5/30
Driven by the open problem raised by Hofheinz and Kiltz (Journal of Cryptology, 2012), we study the formalization of lattice-based programmable hash function (PHF), and give two types of constructions...
Proxy re-encryption (PRE) was introduced by Blaze, Bleumer and Strauss [Eurocrypt '98]. Basically, PRE allows a semi-trusted proxy to transform a ciphertext encrypted under one key into an encryption ...
Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters
public-key cryptography Asymptotically Shorter Public Parameters
2016/2/23
In this paper, we present two new adaptively secure identity-based encryption (IBE) schemes from lattices. The size of the public parameters, ciphertexts, and private keys are O~(n2κ1/d), O~(n), and O...
Transcript Secure Signatures Based on Modular Lattices
lattice techniques digital signatures
2016/1/9
We introduce the notion of a class of lattice-based
digital signature schemes based on modular properties of the coordinates
of lattice vectors. We also suggest a method of making
such schemes tran...
In a homomorphic signature scheme, given a vector of signatures σ⃗ corresponding to a dataset of messages μ⃗ , there is a {\it public} algorithm that allows to derive a signature σ′ for m...
GGHLite: More Efficient Multilinear Maps from Ideal Lattices
public-key cryptography multilinear maps
2016/1/9
The GGH Graded Encoding Scheme [10], based on ideal lattices, is the first plausible approximation
to a cryptographic multilinear map. Unfortunately, using the security analysis in [10], the
scheme ...
In this paper, we present a practical and provably secure two-pass AKE protocol from ideal lattices,
which is conceptually simple and has similarities to the Diffie-Hellman based protocols such as HM...