Viewing profile — anomalroil
anomalroil
HN member- Joined
- Wed, Apr 11, 2018, 10:54 AM UTC
- HN karma
- 166
- Public activity
- 49 items
- HN profile
- View on Hacker News ↗
About anomalroil
Recent public activity
- story
-
comment
Comment #45030267
These precompiles were long overdue, IMO. Good think to see them finally being available on Mainnet, but I wonder if we'll see the migration away from the much weaker BN254 pairing…
- story
-
comment
Comment #42918165
Depends if you want the RTX 5090 before next year or not, just like the collision :P
- story
-
comment
Comment #35054184
Too bad you didn't try it with much higher degrees.
-
story
Show HN: To stop Pokemon-type related questions, I created a dirty web-app
I was being asked every other minute "What's strong against Fairy" and other Pokemon type questions, so I figured I should find a web-app that's mobile friendly. Turns out most had…
-
comment
Comment #32858123
Speaking of Monte Carlo, here's a paper about how using bad randomness can lead to wrong simulation: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2992609/ (or should I call them _b…
-
comment
Comment #32852184
As you said: Java's Random is not meant for serious cryptographic usage, it's meant to be super fast. You have SecureRandom instead for cryptographic usage, and it's noticeably slo…
-
comment
Comment #32851052
It does but it does not! java.util.Random is not a CSPRNG at all and is terrible, so even tho the nextInt() method is using rejection sampling, it's still producing biased values a…
-
comment
Comment #32850338
Lemire's technique is really nice, in general a good thing to learn about, since it's a bit mind bending how it's playing with intervals. Sadly last time I benchmarked it in code o…
-
comment
Comment #32850193
Notice that nowadays, unlike 2 years ago, people usually recommend to use the last technique I presented there in the last paragraph before the Conclusion. Which is to generate a r…
-
comment
Comment #32605577
Or rather, observing a network meant to produce randomness in a distributed way.
- story
-
comment
Comment #32479892
It could, and that's why a solid threshold network should have nodes in different locations, jurisdictions, cloud providers, etc. and have a threshold that's high enough to avoid t…
-
comment
Comment #32479877
Also, be careful of a "last player attack" when XORing randomness: if your last source could spy on the state of your buffer, or on all other randomness sources, it can trivially c…
-
comment
Comment #32479870
Yeah, I guess that's a fair way of describing threshold cryptography and a threshold network. There was actually already once a proposal of creating a "timelapse encryption service…
-
comment
Comment #32479829
Well, Timelock Encryption is "encrypting somewhat towards the future", and as explained in the talk, in 1996 "Timelock puzzles" were proposed by Rivest, Shamir and Wagner as a "pro…
-
comment
Comment #32479783
That would be a pretty cool way of achieving timelock, sure, but might not be super practical.
-
comment
Comment #32478090
Timelock using trusted third parties was first proposed in 1993 by Tim May, the founder of the crypto-anarchist movement, yeah.
-
comment
Comment #32478080
Almost, the randomness is generated using a BLS signature that also makes it verifiable. And that signature is the decryption key.
-
comment
Comment #32478063
Except for the math part when the slides were frozen, I guess :P
-
comment
Comment #32478057
Yeah, that's not exactly how it works. The drand nodes are publishing random beacons that are signed, that's the only thing the networks does. Publishing public verifiable randomne…
-
comment
Comment #32478023
Onboarding new members on a drand network is fairly easy: there only needs to be a threshold of nodes doing a resharing ceremony and all nodes get new shares and new nodes can be o…
-
comment
Comment #32477997
It works by relying on identity-based encryption to encrypt plaintext that cannot be decrypted until the signature of a specific message is revealed. The League of Entropy is signi…