An all-inclusive taxonomy and critical review of blockchain-assisted authentication and session key generation protocols for IoT
A Shahidinejad, J Abawajy - ACM Computing Surveys, 2024 - dl.acm.org
Authentication and Session Key Generation Protocols (SKGPs) play an essential role in
securing the communication channels of connected Internet of Things (IoT) devices …
securing the communication channels of connected Internet of Things (IoT) devices …
A decade of lattice cryptography
C Peikert - Foundations and trends® in theoretical computer …, 2016 - nowpublishers.com
Lattice-based cryptography is the use of conjectured hard problems on point lattices in Rn
as the foundation for secure cryptographic systems. Attractive features of lattice cryptography …
as the foundation for secure cryptographic systems. Attractive features of lattice cryptography …
IoT middleware: A survey on issues and enabling technologies
The Internet of Things (IoT) provides the ability for humans and computers to learn and
interact from billions of things that include sensors, actuators, services, and other Internet …
interact from billions of things that include sensors, actuators, services, and other Internet …
Lattice signatures and bimodal Gaussians
Our main result is a construction of a lattice-based digital signature scheme that represents
an improvement, both in theory and in practice, over today's most efficient lattice schemes …
an improvement, both in theory and in practice, over today's most efficient lattice schemes …
Lattice signatures without trapdoors
V Lyubashevsky - Annual International Conference on the Theory and …, 2012 - Springer
We provide an alternative method for constructing lattice-based digital signatures which
does not use the “hash-and-sign” methodology of Gentry, Peikert, and Vaikuntanathan …
does not use the “hash-and-sign” methodology of Gentry, Peikert, and Vaikuntanathan …
Candidate multilinear maps from ideal lattices
We describe plausible lattice-based constructions with properties that approximate the
sought-after multilinear maps in hard-discrete-logarithm groups, and show an example …
sought-after multilinear maps in hard-discrete-logarithm groups, and show an example …
Post-quantum cryptography
DJ Bernstein, T Lange - Nature, 2017 - nature.com
Cryptography is essential for the security of online communication, cars and implanted
medical devices. However, many commonly used cryptosystems will be completely broken …
medical devices. However, many commonly used cryptosystems will be completely broken …
A subfield lattice attack on overstretched NTRU assumptions: Cryptanalysis of some FHE and graded encoding schemes
The subfield attack exploits the presence of a subfield to solve overstretched versions of the
NTRU assumption: norming the public key h down to a subfield may lead to an easier lattice …
NTRU assumption: norming the public key h down to a subfield may lead to an easier lattice …
Ariadne: A secure on-demand routing protocol for ad hoc networks
Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks Page 1 Ariadne: A
Secure On-Demand Routing Protocol for Ad Hoc Networks Yih-Chun Hu Carnegie Mellon …
Secure On-Demand Routing Protocol for Ad Hoc Networks Yih-Chun Hu Carnegie Mellon …
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
D Stehlé, R Steinfeld - Advances in Cryptology–EUROCRYPT 2011: 30th …, 2011 - Springer
NTRUEncrypt, proposed in 1996 by Hoffstein, Pipher and Silverman, is the fastest known
lattice-based encryption scheme. Its moderate key-sizes, excellent asymptotic performance …
lattice-based encryption scheme. Its moderate key-sizes, excellent asymptotic performance …