New answers tagged

2

Unless otherwise noted, I assume adversaries know the genuine QR-code, and can alter it and submit it for decryption. I posit the design requirements are: Confidentiality of $\text{seed}$, to as high a level as the passphrase + key stretching of Argon2 allows. Integrity of $\text{seed}$, to 64-bit security level [ample in the context, where we want to catch ...


2

Why is a cryptographically secure random-number-generator (to generate the private key aka data-bytearray) not enough? A Cryptographically Secure True Random Number Generator would be enough. This code uses a belt-and-suspenders approach. This is common in RNGs, in recognition of the fact that RNGs are traditionally one of the most brittle components in ...


1

I've always had a problem with probability and that is that over time it will happen 100% for sure. So even if something won't happen statistically for a millenia there is nothing to stop it happening today at say 12.01 pm and then not happening for another millenia or perhaps even happening today, tomorrow and the next day and then not happening for another ...


0

Try to check UTREEXO (I'm not skilled enough to argue about it, but my educated guess is that it could be interesting for you - shortly and surely inaccurately said: it's an idea about how to use recursive ZKPs to squeeze blockchain) That said I'm not convinced by your assumption: to improve decentralization of PoW blockchains the most critical parameter is ...


Top 50 recent answers are included