Chelsea Komlo

I’m at SBC and Simon’s for the next week, looking forward to seeing everyone!

Will be giving a talk on Thursday at Simon’s on our recent impossibility results on the adaptive security of threshold signatures- simons.berkeley.edu/talks/chelse...

Thank you!! Wow you are lucky

2025: started out with Covid, got better, then relapsed into Covid 🤦‍♀️

Back to blue sky and happy new year!!!

After 3 years & 12 drafts, the RFC for FROST is complete! We hope this makes implementing FROST easier with fewer bugs 🐛

Thank you to everyone who helped by reviewing FROST security, submitting comments, and implementing the draft, this was a team effort 🙌💪

www.rfc-editor.org/rfc/rfc9591....

Awesome! Added to the list for next year :)

In Croatia? Have fun!! Hopefully I’ll make it one day 🤞

There's a mergesort step on page 12 that is costed at N log N. So I don't think this improves on Sam Jaques' eprint 2024/080 from a theoretical perspective. Nice implementation work though!

Donate Used Eclipse Glasses | Eclipse Glasses USA Not sure what to do with your used eclipse glasses now that the October 2023 eclipse has passed? Donate them to Eclipse Glasses USA. We will send them to school children in other countries for those c...

Consider donating your eclipse glasses to Eclipse Glasses USA so schoolchildren in South America can use them in October. eclipse23.com/pages/donate...

Episode 318: Threshold Signature Schemes & FROST with Chelsea Komlo - ZK Podcast In this week’s episode, Anna and Nico chat with Chelsea Komlo, Chief Scientist for the Zcash Foundation and member of the Cryptography, Security, and Privacy lab at the University of Waterloo. They d...

First podcast, check it out! :) zeroknowledge.fm/318-2/

Facebook snooped on users' Snapchat traffic in secret project, documents reveal | TechCrunch A secret program called

This is jaw-dropping, wild news and should be criminal

techcrunch.com/2024/03/26/f...

It's not a choice of one or the other.

Use the appendix, as an author, to make reviewers see the value of sticky reviews and make them more likely to ask chairs to turn them on!

Good point!

If you are on a PC for an IACR conference, consider reaching out to the PC chairs to request “sticky reviews”, to allow reviews from prior submissions to IACR conferences to be visible! Let’s make science better! 💪

It is good to know you feel this way, as a potential future book-writer :)

Will do! Thanks Nigel 🙏

Well, I would like this feature as a reviewer :)

Great to hear this is possible!! So it is just a matter of promoting it to be more of the norm 🤔

I wish conferences asked papers to submit feedback received from prior submission attempts and a discussion of how the authors improved the paper since then… so much context is lost between submission attempts across different venues

Thanks for the amazing time #RealWorldCrypto, fantastic talks and conversations as always! See you next year in Europe :)

Changing my job title to “fancy cryptographer” thanks #RealWorldCrypto

Abstract. Threshold Schnorr signatures are seeing increased adoption in practice, and offer practical defenses against single points of failure. However, one challenge with existing randomized threshold Schnorr signature schemes is that signers must carefully maintain secret state across signing rounds, while also ensuring that state is deleted after a signing session is completed. Failure to do so will result in a fatal key-recovery attack by re-use of nonces. While deterministic threshold Schnorr signatures that mitigate this issue exist in the literature, all prior schemes incur high complexity and performance overhead in comparison to their randomized equivalents. In this work, we seek the best of both worlds; a deterministic and stateless threshold Schnorr signature scheme that is also simple and efficient. Towards this goal, we present Arctic, a lightweight two-round threshold Schnorr signature that is deterministic, and therefore does not require participants to maintain state between signing rounds. As a building block, we formalize the notion of a Verifiable Pseudorandom Secret Sharing (VPSS) scheme, and define Shine, an efficient VPSS construction. Shine is secure when the total number of participants is at least 2t − 1 and the adversary is assumed to corrupt at most t − 1; i.e., in the honest majority model. We prove that Arctic is secure under the discrete logarithm assumption in the random oracle model, similarly assuming at minimum 2t − 1 number of signers and a corruption threshold of at most t − 1. For moderately sized groups (i.e., when n ≤ 20), Arctic is more than an order of magnitude more efficient than prior deterministic threshold Schnorr signatures in the literature. For small groups where n ≤ 10, Arctic is three orders of magnitude more efficient.

Image showing part 2 of abstract.

Arctic: Lightweight and Stateless Threshold Schnorr Signatures (Chelsea Komlo, Ian Goldberg) ia.cr/2024/466

Hi Toronto! Looking forward to seeing everyone at #RealWorldCrypto 🇨🇦

I was asked today what the upper bound is on number of signers in threshold signature schemes used in practice today and I didn’t have a good answer…

I’m assuming consensus schemes are larger, but does anyone know of signing groups of > 20? That seems on the larger side

Apparently those leading the anti-diversity programs at US public universities believe “a healthy society requires patriarchy”- why in 2023 are women with voices and brains considered to be such a threat www.nytimes.com/interactive/...

I wish there was more of a culture in cryptography of reaching out to authors to carefully double check claims before writing these claims in reviews or related work.

I’ve seen *big* mistakes made- eg, by a reviewer that said my summary of my own prior work was wrong 🙃

I did this. Please do this; if you are a person who can get pregnant, have them on hand. I used AidAccess.org. I have a vision for care access where people can ask other people for abortion pills the way we call out for tampons in a public restroom. Though I suppose not in a *public* restroom.

Misuse resistant cryptography, but more. I want to see takes on it from more fields, like what do data centers need from it?

Better in what ways?

To anyone working on real-world cryptography- what would you like to see more of in cryptography research for 2024?

Readable papers? Performance measurements? Accounting for specific failure cases? More PQ? Acceptance of non-standard assumptions? Solving certain problems?