The following pages link to Daniel Apon (Q391324):
Displaying 10 items.
- One-round multi-party communication complexity of distinguishing sums (Q391326) (← links)
- SoK: how (not) to design and implement post-quantum cryptography (Q826276) (← links)
- Cryptanalysis of LEDAcrypt (Q2102071) (← links)
- Constant-round group key exchange from the Ring-LWE assumption (Q2302133) (← links)
- Deniable Attribute Based Encryption for Branching Programs from LWE (Q3181031) (← links)
- Combinatorial Rank Attacks Against the Rectangular Simple Matrix Encryption Scheme (Q5041227) (← links)
- Efficient, Reusable Fuzzy Extractors from LWE (Q5082200) (← links)
- Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13 (Q5111369) (← links)
- Verifiable Oblivious Storage (Q5402968) (← links)
- The complexity of grid coloring (Q6109067) (← links)
