[PDF] Top 20 Symbolic Proofs for Lattice-Based Cryptography
Has 10000 "Symbolic Proofs for Lattice-Based Cryptography" found on our website. Below are the top 20 most common "Symbolic Proofs for Lattice-Based Cryptography".
Symbolic Proofs for Lattice-Based Cryptography
... and symbolic tools from the Dolev-Yao ...security proofs; each step of the proof corresponds to a hop, and symbolic side-conditions are used to ensure the validity of the ...security proofs ... See full document
36
Gaussian Sampling Precision in Lattice Cryptography
... Based on our findings, we propose the following implementation parameters that allow standard, significantly more efficient data types to be used. Here we conserva- tively claim that the new parameters maintain ... See full document
9
High-Performance Ideal Lattice-Based Cryptography on 8-bit ATxmega Microcontrollers
... scheme based on the ring learning with errors (RLWE) problem [35, 40] (from now on referred to as ...best-studied lattice-based public key encryption schemes (see [7, 11, 13, 38, 48, 49, 51]) and is ... See full document
20
NEON PQCryto: Fast and Parallel Ring-LWE Encryption on ARM NEON Architecture
... Recently, ARM NEON architecture has occupied a significant share of tablet and smartphone markets due to its low cost and high performance. This paper studies efficient techniques of lattice-based ... See full document
8
Compact, Scalable, and Efficient Discrete Gaussian Samplers for Lattice-Based Cryptography
... This paper proposes a scalable discrete Gaussian sampling template suitable for all lattice-based cryptographic appli- cations. The design combines the use of Gaussian convo- lutions [12] with an efficient ... See full document
5
$\Lambda \circ \lambda$: Functional Lattice Cryptography
... Many lattice-based cryptosytems, such as digital signatures and identity- based or attribute-based encryption schemes following [GPV08], require sampling from a discrete Gaussian probability ... See full document
64
Short Lattice-based One-out-of-Many Proofs and Applications to Ring Signatures
... short lattice- based one-out-of-many proofs and ring ...the lattice setting is far from being trivial, which was indeed stated as an open problem in [19, ...one-out-of-many proofs and ... See full document
35
Computational Soundness of Symbolic Zero-knowledge Proofs: Weaker Assumptions and Mechanized Verification
... called symbolic models, is essential in almost all tool-supported methods for analyzing security ...that symbolic models offering basic cryptographic operations such as encryption and digital signatures can ... See full document
36
A lattice-based changeable threshold multi-secret sharing scheme and its application to threshold cryptography
... proposed lattice-based TMSSS ...(LWE) based public key encryption scheme based on the study of Lindner and ...is based on hardness of lattice problems, ... See full document
10
Tighter Security for Efficient Lattice Cryptography via the Rényi Divergence of Optimized Orders
... of samples. We say that the reduction is tight when the right hand side of the inequality (1) is approximately equivalent to ε 0 , i.e., ≈ ε 0 . Since the number of samples k (resp. the quantity γ) relate to ... See full document
22
Even More Practical Key Exchanges for the Internet using Lattice Cryptography
... schemes based on ring learning with errors (ring-LWE) [10, 11] in particular, are increasingly viewed as offering the most promising post-quantum alternatives to classical Diffie-Hellman key exchanges or RSA key ... See full document
20
Faster AVX2 optimized NTT multiplication for Ring-LWE lattice cryptography
... many lattice-based cryptographic constructions. For schemes based on the hardness of Ring-LWE in power-of-two cyclotomic fields with completely splitting primes, the AVX2 optimized implementation of ... See full document
14
Building an Efficient Lattice Gadget Toolkit: Subgaussian Sampling and More
... operation based on subgaussian sampling range from 18x (for 2 attributes) to 289x (for 16 attributes; the maximum number supported by a previous implementa- ...in lattice cryptography, such as ... See full document
26
A Practical Key Exchange for the Internet using Lattice Cryptography
... post-quantum cryptography. These primitives also give the first lattice-based scheme to provide perfect forward secrecy, and thus represent a major advancement in providing the same sort of security ... See full document
31
Accelerating Bliss: the geometry of ternary polynomials
... Lattice based cryptography [Ajt96, AD97], has received a lot of attention in the last decade, mostly for theoretical ...side, lattice-based cryptography has long been a promising ... See full document
12
Lattice-Based Group Signatures and Zero-Knowledge Proofs of Automorphism Stability
... While lattice-based signatures in the standard model are inefficient, there is a much more efficient selectively-secure lattice-based digital signature scheme that is implicit from the works ... See full document
37
Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs
... on lattice- based group signatures that combines signature schemes (usually variants of Boyen’s signature [Boy10] or B¨ ohl signature [BHJ + 15]) with non-interactive zero-knowledge (NIZK) protocols, ... See full document
50
Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
... in lattice-based cryptography in [LPR13], in the decision to search reduction for the Ring Learning With Errors problem (which serves as a security foundation for many asymptotically fast ...in ... See full document
32
Lattice Based Cryptography for Beginners
... 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 ... See full document
121
Expander based cryptography meets natural proofs
... Acknowledgements The authors thank Mahdi Cheraghchi, Emanuele Viola, and Avi Wigderson for useful e-mail exchanges about the complexity of constructing unbalanced lossless bipartite expander graphs. The authors are ... See full document
14
Related subjects