Survey on fully homomorphic encryption, theory, and applications
Data privacy concerns are increasing significantly in the context of the Internet of Things,
cloud services, edge computing, artificial intelligence applications, and other applications …
cloud services, edge computing, artificial intelligence applications, and other applications …
[PDF][PDF] Status report on the third round of the NIST post-quantum cryptography standardization process
Abstract The National Institute of Standards and Technology is in the process of selecting
publickey cryptographic algorithms through a public, competition-like process. The new …
publickey cryptographic algorithms through a public, competition-like process. The new …
Quantum algorithms for attacking hardness assumptions in classical and post‐quantum cryptography
JF Biasse, X Bonnetain, E Kirshanova… - IET Information …, 2023 - Wiley Online Library
In this survey, the authors review the main quantum algorithms for solving the computational
problems that serve as hardness assumptions for cryptosystem. To this end, the authors …
problems that serve as hardness assumptions for cryptosystem. To this end, the authors …
Formal context reduction in deriving concept hierarchies from corpora using adaptive evolutionary clustering algorithm star
It is beneficial to automate the process of deriving concept hierarchies from corpora since a
manual construction of concept hierarchies is typically a time-consuming and resource …
manual construction of concept hierarchies is typically a time-consuming and resource …
Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
A Lombardi, V Vaikuntanathan - Annual International Cryptology …, 2020 - Springer
Abstract The Fiat-Shamir transform is a methodology for compiling a (public-coin) interactive
proof system for a language L into a non-interactive argument system for L. Proving security …
proof system for a language L into a non-interactive argument system for L. Proving security …
A complete analysis of the BKZ lattice reduction algorithm
We present the first rigorous dynamic analysis of BKZ, the most widely used lattice reduction
algorithm besides LLL: we provide guarantees on the quality of the current lattice basis …
algorithm besides LLL: we provide guarantees on the quality of the current lattice basis …
On bounded distance decoding with predicate: Breaking the “lattice barrier” for the hidden number problem
MR Albrecht, N Heninger - Annual International Conference on the Theory …, 2021 - Springer
Lattice-based algorithms in cryptanalysis often search for a target vector satisfying integer
linear constraints as a shortest or closest vector in some lattice. In this work, we observe that …
linear constraints as a shortest or closest vector in some lattice. In this work, we observe that …
Quantum lattice enumeration in limited depth
Abstract In 2018, Aono et al.(ASIACRYPT 2018) proposed to use quantum backtracking
algorithms (Montanaro, TOC 2018; Ambainis and Kokainis, STOC 2017) to speedup lattice …
algorithms (Montanaro, TOC 2018; Ambainis and Kokainis, STOC 2017) to speedup lattice …
Lattice reduction with approximate enumeration oracles: practical algorithms and concrete performance
This work provides a systematic investigation of the use of approximate enumeration oracles
in BKZ, building on recent technical progress on speeding-up lattice enumeration: relaxing …
in BKZ, building on recent technical progress on speeding-up lattice enumeration: relaxing …
Improving convergence and practicality of slide-type reductions
J Li, M Walter - Information and Computation, 2023 - Elsevier
The best lattice reduction algorithm known in theory for approximating the Shortest Vector
Problem (SVP) over lattices is the slide reduction algorithm (STOC'08 & CRYPTO'20). In this …
Problem (SVP) over lattices is the slide reduction algorithm (STOC'08 & CRYPTO'20). In this …