# Nadav Kohen - Schnorr Applications: FROST (Highlights)  ## Metadata **Review**:: [readwise.io](https://readwise.io/bookreview/38451071) **Source**:: #from/readwise #from/reader **Zettel**:: #zettel/fleeting **Status**:: #x **Authors**:: [[Nadav Kohen]] **Full Title**:: Schnorr Applications: FROST **Category**:: #articles #readwise/articles **Category Icon**:: 📰 **URL**:: [suredbits.com](https://suredbits.com/schnorr-applications-frost/) **Host**:: [[suredbits.com]] **Highlighted**:: [[2024-03-07]] **Created**:: [[2024-03-08]] ## Highlights - Flexible Round-Optimized Schnorr Threshold (FROST) ([View Highlight](https://read.readwise.io/read/01hrc2p5thex6a5r9k785xfey0)) ^689280016 - Specifically we need a mathematical object which admits *n* parties to each have a piece of information and where if any *t* of them get together, they can determine the object. ([View Highlight](https://read.readwise.io/read/01hrc2qqyhqsr3dy59s9yy80wv)) ^689280039