2018 · 65 citations · 12 references
ComputingComputer ScienceCybersecurityAuthenticationCryptographyQuantum ComputingCryptographic Protocol DesignDigital SignaturesElectronic SignaturesHash FunctionsPost-quantum CryptographyQuantum CryptographyBlockchain SecurityDigital Signature SchemesKey GenerationMerkle TreesPost-quantum Cryptographic ProtocolsPost-quantum Digital SignaturesPost-quantum Signature SchemesSignature Schemes
Inspired by the blockchain architecture and existing Merkle tree based signature schemes, we propose BPQS, an extensible post-quantum (PQ) resistant digital signature scheme best suited to blockchain and distributed ledger technologies (DLTs). One of the unique characteristics of the protocol is that it can take advantage of application-specific chain/graph structures in order to decrease key generation, signing and verification costs as well as signature size. Compared to recent improvements in the field, BPQS outperforms existing hash-based algorithms when a key is reused for reasonable numbers of signatures, while it supports a fallback mechanism to allow for a practically unlimited number of signatures if required. We provide an open source implementation of the scheme and benchmark it.
12
A fast quantum mechanical algorithm for database search
Lov K. Grover · 1996 · 8.6K citations · Full text
Algorithms for quantum computation: discrete logarithms and factoring
Peter W. Shor · 2002 · 8.5K citations
Computing, Computer Science, Physics +12
Constructing Digital Signatures from a One Way Function
Leslie Lamport · 2016 · 655 citations
Defining and detecting quantum speedup
Troels F. Rønnow, Zhihui Wang, Joshua Job et al. · Science · 2014 · 604 citations · Full text
Computing, Computer Science, Physics +15