The following pages link to Be adaptive, avoid overcommitting (Q1675723):
Displaying 13 items.
- Cutting-edge cryptography through the lens of secret sharing (Q1627968) (← links)
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \) (Q2055654) (← links)
- Adaptively secure ABE for DFA from \(k\)-Lin and more (Q2055655) (← links)
- Compact NIZKs from standard assumptions on bilinear maps (Q2055661) (← links)
- Security analysis and improvements for the IETF MLS standard for group messaging (Q2096486) (← links)
- Limits on the adaptive security of Yao's garbling (Q2128573) (← links)
- Adaptively secure garbling schemes for parallel computations (Q2175942) (← links)
- Compact adaptively secure ABE for \(\mathsf{NC}^1\) from \(k\)-Lin (Q2188962) (← links)
- Fast, compact, and expressive attribute-based encryption (Q2234469) (← links)
- On treewidth, separators and Yao's garbling (Q2697873) (← links)
- The cost of adaptivity in security games on graphs (Q2697875) (← links)
- Fast, Compact, and Expressive Attribute-Based Encryption (Q5041150) (← links)
- (Inner-product) functional encryption with updatable ciphertexts (Q6141858) (← links)
