搜索结果: 1-15 共查到“密码学 lattice-based cryptography”相关记录16条 . 查询时间(0.067 秒)
Lattice-based Cryptography for IoT in A Quantum World: Are We Ready?
Quantum Safe cryptography Post quantum cryptography IoT security
2019/6/12
The impending realization of scalable quantum computers has led to active research in Post Quantum Cryptography (PQC). The challenge is harder for embedded IoT (edge) devices, due to their pervasive d...
Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography
zero-knowledge lattice cryptography MPC
2019/5/23
In this work we present a new interactive Zero-Knowledge Argument of knowledge for general arithmetic circuits. Our protocol is based on the ``MPC-in-the-head''-paradigm of Ishai et al. (STOC 2009) an...
Fault Attack Countermeasures for Error Samplers in Lattice-Based Cryptography
Lattice-based cryptography fault attacks countermeasures
2019/3/1
Lattice-based cryptography is one of the leading candidates for NIST's post-quantum standardisation effort, providing efficient key encapsulation and signature schemes. Most of these schemes base thei...
Symbolic methods have been used extensively for proving security of cryptographic protocols in the Dolev-Yao model, and more recently for proving security of cryptographic primitives and constructions...
Compact, Scalable, and Efficient Discrete Gaussian Samplers for Lattice-Based Cryptography
lattice-based cryptography post-quantum cryptography Gaussian samplers
2018/3/14
Lattice-based cryptography, one of the leading candidates for post-quantum security, relies heavily on discrete Gaussian samplers to provide necessary uncertainty, obfuscating computations on secret i...
Proof of a shuffle for lattice-based cryptography
mix-nets evoting post-quantum cryptographic protocol
2017/9/25
In this paper we present the first proof of a shuffle for lattice-based cryptography which can be used to build a universally verifiable mix-net capable of mixing votes encrypted with a post-quantum a...
A Framework to Select Parameters for Lattice-Based Cryptography
Lattice-Based Cryptography Ideal Lattices Parameter Selection
2017/6/28
Selecting parameters in lattice-based cryptography is a challenging task, which is essentially accomplished using one of two approaches. The first (very common) approach is to derive parameters assumi...
Sharper Bounds in Lattice-Based Cryptography using the Rényi Divergence
Security Proofs Lattice-Based Cryptography Gaussian Sampling
2017/5/31
First, we give theoretic results which renders it more efficient and easier to use. This is done by providing two lemmas, which give tight bounds in very common situations { for distributions that are...
GLITCH: A Discrete Gaussian Testing Suite For Lattice-Based Cryptography
Post-quantum cryptography lattice-based cryptography discrete Gaussian samplers
2017/5/23
Lattice-based cryptography is one of the most promising areas within post-quantum cryptography, and offers versatile, efficient, and high performance security services. The aim of this paper is to ver...
Two-party authenticated key exchange protocol using lattice-based cryptography
Authenticated key exchange ring learning with errors
2016/12/10
Authenticated key exchange (AKE) protocol is an important cryptographic primitive that assists communicating entities, who are communicating over an insecure network, to establish a shared session key...
Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography
Post-quantum cryptography number theoretic transform (NTT) ring learning with errors (R-LWE)
2016/5/24
The Number Theoretic Transform (NTT) provides efficient algorithms for cyclic and nega-cyclic convolutions, which have many applications in computer arithmetic, e.g., for multiplying large integers an...
High-Performance Ideal Lattice-Based Cryptography on 8-bit ATxmega Microcontrollers
Ideal lattices NTT RLWE
2015/12/31
Over the last years lattice-based cryptography has received much attention due to versatile
average-case problems like Ring-LWE or Ring-SIS that appear to be intractable by quantum computers.
But de...
Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
public-key cryptography probability distributions
2015/12/30
The Rényi divergence is a measure of closeness of two probability
distributions. We show that it can often be used as an alternative
to the statistical distance in security proofs for lattice-based ...
Lattice Based Cryptography for Beginners
Lattice-based cryptography Ring-LWE cryptography Multilinear map
2015/12/22
The purpose of this lecture note is to introduce lattice based cryptography, which is
thought to be a cryptosystem of post-quantum age. We have tried to give as many details
possible specially for n...
Selecting Secure Parameters for Lattice-based Cryptography
Lattice-based cryptography post-quantum cryptography Lenstra Heuristic
2010/3/16
Encryption and signature schemes based on worst-case lattice problems are
promising candidates for the post-quantum era, where classic number-theoretic assumptions
are rendered false. Although there...