The following pages link to Fermi Ma (Q1623264):
Displayed 15 items.
- The fewest clues problem (Q1623268) (← links)
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks (Q1631346) (← links)
- Return of GGH15: provable security against zeroizing attacks (Q1631349) (← links)
- Leakage-resilient key exchange and two-seed extractors (Q2096493) (← links)
- On the round complexity of secure quantum computation (Q2120084) (← links)
- One-way functions imply secure computation in a quantum world (Q2120090) (← links)
- Does Fiat-Shamir require a cryptographic hash function? (Q2139639) (← links)
- On the (In)security of Kilian-based SNARGs (Q2175953) (← links)
- Public-key function-private hidden vector encryption (and more) (Q2178865) (← links)
- New techniques for obfuscating conjunctions (Q2292710) (← links)
- The distinction between fixed and random generators in group-based assumptions (Q2305002) (← links)
- Arboral satisfaction: recognition and LP approximation (Q2398493) (← links)
- The Fewest Clues Problem (Q5282810) (← links)
- (Q5875789) (← links)
- Succinct classical verification of quantum computation (Q6104334) (← links)