Would the fact that this tag is an TOPRF output prevent the attack? The fake realm would need to have the OPRF private key from the original realm in order for the โphase 2โ to complete, assuming itโs not possible to swap in the malicious realm in between phases (would need to look at code)
05.06.2025 20:51 โ ๐ 2 ๐ 0 ๐ฌ 1 ๐ 0
Looks like the cost is dominated by a size-3 elliptic curve MSM per guess. The work should be ~the same order of magnitude as edDSA signing operations. So on the order of 100k guesses per second on consumer hardware.
21.02.2024 13:25 โ ๐ 1 ๐ 0 ๐ฌ 0 ๐ 0
I donโt see how a hash existence oracle could be more useful than a username existence oracle, which already exists.
The pedersen proof thing was implemented so it may just come down to โproof of knowledge of the actual username+discriminationโ is easier to reason about/ harder to fuck up
20.02.2024 23:57 โ ๐ 0 ๐ 0 ๐ฌ 0 ๐ 0
The current implementation code limits the discriminators to a 64-bit representable value
20.02.2024 23:51 โ ๐ 0 ๐ 0 ๐ฌ 1 ๐ 0
I guess the question is: What kind of adversary knows H(username, discriminator) but not username and discriminator?
20.02.2024 23:46 โ ๐ 0 ๐ 0 ๐ฌ 1 ๐ 0
I had considered that it also forces Alice to prove that the hash was constructed properly, but
* I donโt know why that would be important
* It doesnโt actually prove the discriminator is in the correct range, nickname is valid, etc
20.02.2024 23:43 โ ๐ 0 ๐ 0 ๐ฌ 1 ๐ 0
Yeah, I get that this system ensures Bob knows the hash input, but donโt see why that lends any security over knowing the hash output. Maybe they intend to use the hash for something else, and might leak it? But that could just be solved with domain separation.
20.02.2024 23:42 โ ๐ 0 ๐ 0 ๐ฌ 2 ๐ 0
Right, but I guess the question is โwhy do we want a Pedersen commitment to the nicknameโ
Maybe some fun future feature that needs it for more zk proofs?
Given the desire for a pedersen commitment, the design makes sense (hash prevents brute-forcing the nickname and discriminator independently)
20.02.2024 23:37 โ ๐ 0 ๐ 0 ๐ฌ 1 ๐ 0
Any idea why they use this pedersen hash
nickname*G1 + discriminator*G2 + H(nickname, discriminator)*G3
rather than just
H(nickname, discriminator)*G
along with a simple Schnorr proof?
I canโt think of any properties the former gives over the latter
20.02.2024 23:18 โ ๐ 0 ๐ 0 ๐ฌ 1 ๐ 0
Engineer and Applied Cryptographer working in the ASML at Harvardโs BKC.
Led cryptography R&D at Juicebox and privacy projects at Signal.
Passionate about fostering inclusive communities, mentoring women in tech, and building third spaces for creatives.
Founder, Risepoint Search Partners. Former litigator. Mom to two amazing girls. Color commentary for @stevevladeck.bsky.social.
@ksvesq.bsky.socialโs husband; father of daughters; professor @georgetownlaw.bsky.social; #SCOTUS nerd @CNN.com
Bio: www.law.georgetown.edu/faculty/stephen-i-vladeck
"One First" Supreme Court newsletter: stevevladeck.com
Book: tinyurl.com/shadowdocketpb
We help NGOs, foundations, and activists apply strategic digital leadership in justice efforts. Our manifesto: https://aspirationtech.org/publications/manifesto
Proud LatinAmerican. "Legendary quantum lady/cryptographer". Researcher @brave she/they hrpc co-chair @inretafo anti-fraud @w3c @otr_im @LondonU
Crypto means maths. Cryptogopher doing random stuff on the internet, quite literally.
Researcher in cryptographic engineering at MPI-SP.
Cryptographer working on Penumbra
Cryptography, FP, Math, and other cool stuff.
Blog too infrequently at cronokirby.com
Lost in Seattle somewhere
cryptographer at Stevens
axhoover.com
Researcher in Cryptography (symmetric-key, white-box, post-quantum, etc.)
https://affine.group
Cryptographer, security & privacy geek, human. CS Prof @ U. Chile. DCC, CLCERT, IMFD. My posts are my own (he/him).
Cryptography | PhD student at Johns Hopkins University | adishegde.github.io
During the day: Research on Fault-tolerant distributed systems, applied cryptography, Rust and Emacs
Off-Work: Pickleball, Road-tripper, reader