Smooth Hash Proof System Based on the Learning With Errors Problem With Multi-Bit Key Output
Since hash proof system (HPS) can be utilized to build versatilely cryptographic schemes, the study on realizing this cryptographic primitive has been a very active research area. With the increasing concerns on the huge progress in quantum computing, it urges cryptographers to explore the existence...
Main Authors: | Momeng Liu, Yupu Hu, Shanshan Zhang, Linming Gong |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8859236/ |
Similar Items
-
Fault Attacks on CCA-secure Lattice KEMs
by: Peter Pessl, et al.
Published: (2021-02-01) -
Password–Authenticated Group Key Establishment from Smooth Projective Hash Functions
by: Bohli Jens-Matthias, et al.
Published: (2019-12-01) -
The Design and Analysis of Hash Families For Use in Broadcast Encryption
Published: (2012) -
Scabbard: a suite of efficient learning with rounding key-encapsulation mechanisms
by: Jose Maria Bermudo Mera, et al.
Published: (2021-08-01) -
Saber on ARM
by: Angshuman Karmakar, et al.
Published: (2018-08-01)