Janmajaya Mall pfp

Janmajaya Mall

@jmall

56 Following
32 Followers
Dan Tehrani pfp
Dan Tehrani
@dantehrani.eth
Creddd search got a lot faster 1/n
1 reply
1 recast
2 reactions
Janmajaya Mall pfp
Janmajaya Mall
@jmall
Me: please let me enter. HK: nope. Please go through our 4 week long process because your passport is issued in some small city.
0 reply
0 recast
0 reaction
Janmajaya Mall pfp
Janmajaya Mall
@jmall
I am assuming a world where service like delegaTEE (https://eprint.iacr.org/2018/160.pdf) exists. It enables anyone to sell their private key anonymously just for proof.
0 reply
0 recast
1 reaction
Janmajaya Mall pfp
Janmajaya Mall
@jmall
Protocols that plan to use zk proofs for reputation gating while users stay anonymous. How do you prevent someone from selling access to their private key just for the proof?
1 reply
0 recast
0 reaction
Janmajaya Mall pfp
Janmajaya Mall
@jmall
Can’t DM. But would love to get an invite!
1 reply
0 recast
0 reaction
Janmajaya Mall pfp
Janmajaya Mall
@jmall
Crossposting from twitter. Looking for someone to help out with front-end of cool privacy/anonymous app (paid). The work wouldn't be too time consuming, but you will love it! DM for more info!
0 reply
0 recast
0 reaction
Janmajaya Mall pfp
Janmajaya Mall
@jmall
Been working on something really cool... https://medium.com/@janmajayamall18/anonymous-postbox-e6f5399f7243
0 reply
0 recast
0 reaction
Janmajaya Mall pfp
Janmajaya Mall
@jmall
In what new ways can homomorphic encryption (maybe combined with threshold encryption) help enable cool stuff on farcaster? Please no points for privacy preserving data analytics or something. By new I meant something wild that haven't been experimented with!
0 reply
0 recast
0 reaction
Janmajaya Mall pfp
Janmajaya Mall
@jmall
had been cluelessly staring at code for hours because I mistook substitution operation of polynomial for powers of polynomial in the paper 😓
0 reply
0 recast
0 reaction
Janmajaya Mall pfp
Janmajaya Mall
@jmall
...increase `k` in subsequent requests to the server. These requests will have a bit higher latency, but works.
0 reply
0 recast
0 reaction
Janmajaya Mall pfp
Janmajaya Mall
@jmall
I should clarify msgs "cap" in OMR. So given set of all messages, if more than `k` msgs are pertinent to a user, the digest sent to them consisting all their pertinent msgs will be useless. An attacker can cause this by posting msgs > k for some user. However we can change the `k` on the fly! User can...
1 reply
0 recast
0 reaction
Janmajaya Mall pfp
Janmajaya Mall
@jmall
false positive rate and clue keys are related, so changing false positive rate will require updating clue keys + render old clues useless for new params. I should mention that fp rate in OMR params used in demo (take from paper) is negligible.
0 reply
0 recast
0 reaction
Janmajaya Mall pfp
Janmajaya Mall
@jmall
...algorithm of encryption schemes used in blockchains. If some magic happens in future and we figure out an efficient way to homomorphically decrypt encrypted msgs, then we can get rid of separate clues.
1 reply
0 recast
0 reaction
Janmajaya Mall pfp
Janmajaya Mall
@jmall
...beyond which the digest sent to them becomes useless, this can result in targeted individuals not receiving important msgs. I think having either of merklized transparency log/signature on clues will be helpful! Also we only require separate clue keys because we don't have efficient eval circuit of decryption...
1 reply
0 recast
0 reaction
Janmajaya Mall pfp
Janmajaya Mall
@jmall
by interfering with resolution of lookup the attacker can make the message go to some other user ~ to which the resolved clue key belongs. So an attacker can spam an individual, or a group, by resolving most lookups to their clue keys. Since OMR caps msgs that can be pertinent to a user at once to max value(ex. 50)...
1 reply
0 recast
0 reaction
Janmajaya Mall pfp
Janmajaya Mall
@jmall
Haven't thought of better way for address <> clue key lookup than naively posting on the internet. If there's some progress, will keep you updated! Current hope is to bundle clues with transactions, but it's still early to confirm this.
1 reply
0 recast
0 reaction
Janmajaya Mall pfp
Janmajaya Mall
@jmall
yeah this makes sense. But we can experiment with both approaches and figure out what works best. I am working on implementing this for Aztec. So we likely have some data on how FMD compares with OMR in blockchain context.
1 reply
0 recast
0 reaction
Janmajaya Mall pfp
Janmajaya Mall
@jmall
...however we can always increase no. of cores to accommodate more traffic. Yeah, I understand that having 133kb clue key isn't ideal for blockchains. I think authors of OMR paper are in the process of integrating OMR with Zcash. Curious to see how they approach it.
1 reply
0 recast
0 reaction
Janmajaya Mall pfp
Janmajaya Mall
@jmall
Thanks! clue keys = 133kb and clues = 956 bytes (both same as paper). I haven't done anything new with detection key. Just reduced the polynomial size of ciphertexts from 2^15 to 2^11. This reduces evaluation time of messages by a lot but also reduces no. of messages that can be processed on a single core at once...
1 reply
0 recast
0 reaction
Janmajaya Mall pfp
Janmajaya Mall
@jmall
How useful would it be to have "private postboxes"? Anyone can post messages in it for you but without sender's and receiver's details on msg envelope ? So there's no way to link sender with receiver for a given msg. It's unlike signal/proton since their servers still need to know receiver's details.
0 reply
0 recast
0 reaction