A New Identification Scheme based on Syndrome Decoding Problem with Provable Security against Quantum Adversaries
Recently, in order to guarantee security against quantum adversaries, several identification (ID) schemes based on computational problems which are supposed to be hard even for quantum computers have been proposed. However, their security are only proven against non-quantum adversaries. In this pape...
Main Authors: | Bagus Santoso, Chunhua Su |
---|---|
Format: | Article |
Language: | English |
Published: |
Graz University of Technology
2019-03-01
|
Series: | Journal of Universal Computer Science |
Subjects: | |
Online Access: | https://lib.jucs.org/article/22599/download/pdf/ |
Similar Items
-
Rank AGS Identification Scheme and Signature Scheme
by: Vaishnavi Nagaraja, et al.
Published: (2023-02-01) -
Provably unbounded memory advantage in stochastic simulation using quantum mechanics
by: Garner, Andrew J. P., et al.
Published: (2018) -
A Secure Scheme Based on a Hybrid of Classical-Quantum Communications Protocols for Managing Classical Blockchains
by: Ang Liu, et al.
Published: (2023-05-01) -
Provably Secure Symmetric Private Information Retrieval with Quantum Cryptography
by: Wen Yu Kon, et al.
Published: (2020-12-01) -
Hardening quantum machine learning against adversaries
by: Nathan Wiebe, et al.
Published: (2018-01-01)