The following pages link to Arithmetic Cryptography (Q2989025):
Displaying 7 items.
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN (Q2129007) (← links)
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) (Q2170025) (← links)
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) (Q2693051) (← links)
- Linicrypt: A Model for Practical Cryptography (Q2829955) (← links)
- Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
- Indistinguishability obfuscation (Q6198645) (← links)
- Lower bounds for lattice-based compact functional encryption (Q6636507) (← links)
