Survey on cyberspace security
H Zhang, W Han, X Lai, D Lin, J Ma, JH Li - Science China Information …, 2015 - Springer
Along with the rapid development and wide application of information technology, human
society has entered the information era. In this era, people live and work in cyberspace …
society has entered the information era. In this era, people live and work in cyberspace …
An improved compression technique for signatures based on learning with errors
S Bai, SD Galbraith - Topics in Cryptology–CT-RSA 2014: The …, 2014 - Springer
We present a new approach to the compression technique of Lyubashevsky et al.[17, 13] for
lattice-based signatures based on learning with errors (LWE). Our ideas seem to be …
lattice-based signatures based on learning with errors (LWE). Our ideas seem to be …
Improved short lattice signatures in the standard model
L Ducas, D Micciancio - Advances in Cryptology–CRYPTO 2014: 34th …, 2014 - Springer
We present a signature scheme provably secure in the standard model (no random oracles)
based on the worst-case complexity of approximating the Shortest Vector Problem in ideal …
based on the worst-case complexity of approximating the Shortest Vector Problem in ideal …
Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
S Yamada - Advances in Cryptology–CRYPTO 2017: 37th Annual …, 2017 - Springer
In this paper, we focus on the constructions of adaptively secure identity-based encryption
(IBE) from lattices and verifiable random function (VRF) with large input spaces. Existing …
(IBE) from lattices and verifiable random function (VRF) with large input spaces. Existing …
Towards tightly secure lattice short signature and id-based encryption
X Boyen, Q Li - International Conference on the Theory and …, 2016 - Springer
Constructing short signatures with tight security from standard assumptions is a long-
standing open problem. We present an adaptively secure, short (and stateless) signature …
standing open problem. We present an adaptively secure, short (and stateless) signature …
Programmable hash functions from lattices: short signatures and IBEs with small key sizes
J Zhang, Y Chen, Z Zhang - Annual international cryptology conference, 2016 - Springer
Driven by the open problem raised by Hofheinz and Kiltz 34, we study the formalization of
lattice-based programmable hash function (PHF), and give two types of constructions by …
lattice-based programmable hash function (PHF), and give two types of constructions by …
Adaptively secure identity-based encryption from lattices with asymptotically shorter public parameters
S Yamada - Annual International Conference on the Theory and …, 2016 - Springer
In this paper, we present two new adaptively secure identity-based encryption (IBE)
schemes from lattices. The size of the public parameters, ciphertexts, and private keys are ̃ O …
schemes from lattices. The size of the public parameters, ciphertexts, and private keys are ̃ O …
The magic of ELFs
M Zhandry - Journal of Cryptology, 2019 - Springer
We introduce the notion of an Extremely Lossy Function (ELF). An ELF is a family of
functions with an image size that is tunable anywhere from injective to having a polynomial …
functions with an image size that is tunable anywhere from injective to having a polynomial …
Removing the strong RSA assumption from arguments over the integers
Committing integers and proving relations between them is an essential ingredient in many
cryptographic protocols. Among them, range proofs have been shown to be fundamental …
cryptographic protocols. Among them, range proofs have been shown to be fundamental …