✳flâneur — a map of the web's best reading

ZX-based quantum obfuscation for dummies – 20[ ] – The blog

blog.20squares.xyz · 1,475 words · saved by 1 readers

The quest around building Quantum 1-Shot Signatures revolves around building practical, optimized equivocal hash functions. Such equivocal hash functions have been proved to exist, for instance in this paper, using ordered affine partitions. Unfortunately, the proof there is essentially non-constructive, so the problem of actually building the thing™ still stands. We had a first stab at building these gadgets explicitly here, but Lev, one of the main researchers involved in this project, quickly broke the mechanism. Now we have some other candidate constructions: Lev is working on implementing Quantum 1-shot tokens using claw-free functions — hopefully a post about this willfollow soon! — whereas Stefano and Richie are investingating an alternative approach based on ZX-calculus, which will be the focus of this post. In general, all of these endeavours piggyback to the same problem, namely that the construction used to implement an equivocal hash function needs to be obfuscated in some

ZX-based quantum obfuscation for dummies Fabrizio Genovese · June 12, 2024 ZX-calculus obfuscation cryptography This is a cross-post from the Qsig blog . I want to thank Stefano Gogioso and Richie Yeung, who are actively working to figure out this stuff. Pictures of the confusion process by Stefano Gogioso. The quest around building Quantum 1-Shot Signatures revolves around building practical, optimized equivocal hash functions . Such equivocal hash functions have been proved to exist, for instance in this paper , using ordered affine partitions. Unfortunately, the proof there is essentially n

Explore this link on the map →

saved by

related reading