Quantum Merkle Trees

arXiv:2112.14317v4 Announce Type: replace-cross
Abstract: Committing to information is a central task in cryptography, where a party (typically called a prover) stores a piece of information (e.g., a bit string) with the promise of not changing it. This information can be accessed by another party (typically called the verifier), who can later learn the information and verify that it was not meddled with. Merkle trees are a well-known construction for doing so in a succinct manner, in which the verifier …

arxiv called can central changing cryptography cs.cr information learn merkle party piece quant-ph quantum stores task trees verify