March 1, 2023, 2:10 a.m. | Lijie Chen, Ramis Movassagh

cs.CR updates on arXiv.org arxiv.org

Commitment scheme 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 tree is a well-known construction for
doing so in a succinct manner, in which the verifier can learn any part of the …

called changing construction cryptography doing information learn merkle party piece quantum task trees verify well-known

Information Security Engineers

@ D. E. Shaw Research | New York City

Technology Security Analyst

@ Halton Region | Oakville, Ontario, Canada

Senior Cyber Security Analyst

@ Valley Water | San Jose, CA

COMM Penetration Tester (PenTest-2), Chantilly, VA OS&CI Job #368

@ Allen Integrated Solutions | Chantilly, Virginia, United States

Consultant Sécurité SI H/F Gouvernance - Risques - Conformité

@ Hifield | Sèvres, France

Infrastructure Consultant

@ Telefonica Tech | Belfast, United Kingdom