Item Type |
Journal paper
|
Abstract |
Lattice-based cryptography is evolving rapidly and is often employed to design cryptographic primitives that hold a great promise to be post-quantum resistant and can be employed in multiple application settings such as: e-cash, unique digital signatures, non-interactive lottery and others. In such
application scenarios, a user is often required to prove non-interactively the correct computation of
a pseudo-random function Fk(x) without revealing the secret key k used. Commitment schemes are
also useful in application settings requiring to commit to a chosen but secret value that could be revealed later. In this short paper, we provide our insights on constructing a lattice-based simulatable
verifiable random function (sVRF) using non interactive zero knowledge arguments and dual-mode
commitment schemes and we point out the main challenges that need to be addressed in order to
achieve it. |
Authors |
Brunetta, Carlo; Liang, Bei & Mitrokotsa, Aikaterini |
Journal or Publication Title |
Journal of Internet Services and Information Security (JISIS) |
Language |
English |
Keywords |
Dual-Mode Commitment Scheme, Lattice-based Cryptography, Non Interactive Zero
Knowledge Arguments, Pseudo Random Functions, Verifiable Random Functions |
Subjects |
computer science |
HSG Classification |
contribution to scientific community |
HSG Profile Area |
None |
Refereed |
Yes |
Date |
30 November 2018 |
Publisher |
Innovative Information Science & Technology Research Group (ISYOU) |
Volume |
8 |
Number |
4 |
Page Range |
57-69 |
Number of Pages |
13 |
Publisher DOI |
https://doi.org/10.22667/JISIS.2018.11.30.057 |
Official URL |
http://isyou.info/jisis/vol8/no4/jisis-2018-vol8-n... |
Depositing User |
Eriane Breu
|
Date Deposited |
31 Mar 2021 20:07 |
Last Modified |
20 Jul 2022 17:45 |
URI: |
https://www.alexandria.unisg.ch/publications/262913 |