Results 211 to 220 of about 1,263 (254)
Secure edge-based IoMT framework for ICU monitoring with TinyML and post-quantum cryptography. [PDF]
Sci RepKhan UH +5 more
europepmc +1 more source
SSDBFAN: Scalable and Secure Cluster-Based Data Aggregation with Blockchain for Flying Ad Hoc Networks. [PDF]
Sensors (Basel)Majmaie SA +4 more
europepmc +1 more source
A compact public key encryption with equality test for lattice in cloud computing. [PDF]
Sci RepHe J, Ye Q, Yang Z, Wang S, Wang J.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Lattice-Based Cryptography: A Survey
Chinese Annals of Mathematics Series B, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guangwu Xu, Xiaoyun Wang
exaly +3 more sources
2020
In this chapter, you will get an overview of lattice-based cryptography. You will learn why lattices are important in the cryptography field and the challenges in using them. Further, you will explore a practical implementation that uses lattices, namely the GGH (Goldreich–Goldwasser–Halevi) encryption scheme [1].
Marius Iulian Mihailescu +1 more
openaire +1 more source
In this chapter, you will get an overview of lattice-based cryptography. You will learn why lattices are important in the cryptography field and the challenges in using them. Further, you will explore a practical implementation that uses lattices, namely the GGH (Goldreich–Goldwasser–Halevi) encryption scheme [1].
Marius Iulian Mihailescu +1 more
openaire +1 more source
2017 12th International Conference on Computer Engineering and Systems (ICCES), 2017
Among the different cryptosystems, the Public Key Cryptosystems (PKCS) are of great usage and are used in many applications. Most of the current PKCS are based on a hard problem making the cryptanalysis of such cipher infeasible given the current computing and memory availability.
Ayman Wagih Mohsen +2 more
openaire +1 more source
Among the different cryptosystems, the Public Key Cryptosystems (PKCS) are of great usage and are used in many applications. Most of the current PKCS are based on a hard problem making the cryptanalysis of such cipher infeasible given the current computing and memory availability.
Ayman Wagih Mohsen +2 more
openaire +1 more source
Proof of a Shuffle for Lattice-Based Cryptography
2017In 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 algorithm, thus achieving long-term privacy. Universal verifiability is achieved by means of the publication of a non-interactive zero knowledge proof of a
Núria Costa +2 more
openaire +1 more source
Performance Characterization of Lattice-Based Cryptography Workloads
2020 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS), 2020In the domain of lattice cryptography, an emerging field of post-quantum secure cryptography, very few accelerator designs exist that both sufficiently accelerate a particular lattice cryptosystem and provide enough flexibility to accommodate a variety of cryptographic schemes.
Deepika Natarajan, Ronald G. Dreslinski
openaire +1 more source